用于全球地理信息传递的自适应覆盖网络

Frank Dürr, K. Rothermel
{"title":"用于全球地理信息传递的自适应覆盖网络","authors":"Frank Dürr, K. Rothermel","doi":"10.1109/AINA.2008.67","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an overlay network supporting world-wide geographic messaging. Our approach is based on hierarchical symbolic coordinates like /usa/fl/miami/. Although hierarchical network topologies lend themselves to the implementation of such overlay networks, they may lead to bottlenecks at the root of the hierarchy, long message paths, and inefficient bandwidth utilization. To avoid these problems, we propose an overlay network that adapts its structure to the users' communication patterns by dynamically adding \"shortcut\" links to the hierarchy leading to a routing mesh. We present an algorithm that carefully selects shortcuts based on their utility to assure short message paths on the one hand and to reduce the induced overhead on the other hand. Through simulations we show that this approach decreases the average path length significantly and reduces network load to about 50% compared to hierarchical routing.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An Adaptive Overlay Network for World-Wide Geographic Messaging\",\"authors\":\"Frank Dürr, K. Rothermel\",\"doi\":\"10.1109/AINA.2008.67\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an overlay network supporting world-wide geographic messaging. Our approach is based on hierarchical symbolic coordinates like /usa/fl/miami/. Although hierarchical network topologies lend themselves to the implementation of such overlay networks, they may lead to bottlenecks at the root of the hierarchy, long message paths, and inefficient bandwidth utilization. To avoid these problems, we propose an overlay network that adapts its structure to the users' communication patterns by dynamically adding \\\"shortcut\\\" links to the hierarchy leading to a routing mesh. We present an algorithm that carefully selects shortcuts based on their utility to assure short message paths on the one hand and to reduce the induced overhead on the other hand. Through simulations we show that this approach decreases the average path length significantly and reduces network load to about 50% compared to hierarchical routing.\",\"PeriodicalId\":328651,\"journal\":{\"name\":\"22nd International Conference on Advanced Information Networking and Applications (aina 2008)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd International Conference on Advanced Information Networking and Applications (aina 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2008.67\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2008.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文提出了一种支持全球地理信息传递的覆盖网络。我们的方法是基于像/usa/fl/miami/这样的分层符号坐标。尽管分层网络拓扑可以实现这种覆盖网络,但它们可能会在分层结构的根部导致瓶颈、长消息路径和低效率的带宽利用。为了避免这些问题,我们提出了一种覆盖网络,通过动态地向导致路由网格的层次结构中添加“快捷”链接,使其结构适应用户的通信模式。我们提出了一种算法,该算法根据快捷方式的实用性仔细选择快捷方式,一方面保证了短消息路径,另一方面减少了引起的开销。通过仿真表明,与分层路由相比,该方法显著降低了平均路径长度,并将网络负载降低了约50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Adaptive Overlay Network for World-Wide Geographic Messaging
In this paper, we propose an overlay network supporting world-wide geographic messaging. Our approach is based on hierarchical symbolic coordinates like /usa/fl/miami/. Although hierarchical network topologies lend themselves to the implementation of such overlay networks, they may lead to bottlenecks at the root of the hierarchy, long message paths, and inefficient bandwidth utilization. To avoid these problems, we propose an overlay network that adapts its structure to the users' communication patterns by dynamically adding "shortcut" links to the hierarchy leading to a routing mesh. We present an algorithm that carefully selects shortcuts based on their utility to assure short message paths on the one hand and to reduce the induced overhead on the other hand. Through simulations we show that this approach decreases the average path length significantly and reduces network load to about 50% compared to hierarchical routing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
STAMP: Towards A Scalable Topology Announcement and Management Protocol Analysis of Packet Relaying Models and Incentive Strategies in Wireless Ad Hoc Networks with Game Theory Extending Always Best Connected Paradigm for Voice Communications in Next Generation Wireless Network Maintaining Packet Order in Reservation-Based Shared-Memory Optical Packet Switch Near Optimal Broadcasting in Optimal Triple Loop Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1