期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于位置无关名字的可扩展几何路由方案

Scalable geometric routing scheme based on location-independent names
下载PDF
导出
摘要 名字路由已成为未来网络的研究热点之一,由于网络中节点和信息规模的持续增长,可扩展问题成为其瓶颈。几何路由作为新型可扩展路由方案,可同时满足路由表规模和路由路径的可扩展,但难以支持名字路由。首先在几何路由基础上提出了一种通用的基于位置无关名字的可扩展几何路由方案——GRIN,结合源路由和贪心路由实现混合几何路由,在混合几何路由上引入基于双层稀疏群组的名字解析(映射)。然后理论分析了节点状态及名字映射的路径延展度上界。最后通过仿真验证了GRIN具备可扩展、低延展度以及高可靠性等特征,并优于其他名字路由方案。 Name-based routing has become one of the hot topics in future network. However, due to the sustained growth of the size of nodes and information, the scalability issue is becoming one of the bottlenecks of name-based routing. As a new type of scalable routing, geometric routing provides both scalable routing tables and low routing paths, but it is difficult to support name-based routing. A universal scalable geometric routing scheme based on location-independent names （GRIN） was proposed. GRIN implemented a hybrid geometric routing（HGR） combining greedy routing with source routing, introduced a distributed name resolution using 2-level sloppy groups. Then the state and the path stretch upper bound of GRIN were analyzed. The simulation results show that GRIN guarantees scalability, low stretch and reliability. It outperformanced other similar routing schemes.
作者 孙彦斌 张宇 张宏莉 方滨兴
机构地区 哈尔滨工业大学计算机科学与技术学院
出处 《电信科学》 北大核心 2016年第1期1-10,共10页 Telecommunications Science
基金 国家重点基础研究发展计划("973"计划)基金资助项目(No.2011CB302605 No.2013CB329602) 国家自然科学基金资助项目(No.61202457 No.61402149)~~
关键词 几何路由 名字解析 名字路由 可扩展性 geometric muting； name resolution； name-based muting； scalability
分类号 TP301 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献2

二级参考文献55

  • 1Krioukov D, Fall K, Yang X. Compact routing on lnternet- like graphs//Proceedings of the IEEE INFOCOM 2004. Hong Kong, China, 2004:209 -219.
  • 2Brady A, Cowen L. Compact routing on power-law graphs with additive stretch//Proeeedings of the 8th Workshop on Algorithm Engineering and Experiments. Miami, USA, 2006:119-128.
  • 3Chen W, Sommer C, Teng S H, Wang Y. Compact routing in power-law graphs//Proceedings of the International Symposium on Distributed Computing (DISC' 09). Elche , Spain, 2009: 379-391.
  • 4Enachescu M, Wang M, Goel A. Reducing maximum stretch in compact routing//Proceedings of the IEEE INFOCOM 2008. Phoenix, USA, 2008: 977-985.
  • 5Norros 1. Powernet , Compact routing on Internet-like random networks//Proceedings of the Next Generation Internet Networks. Aveiro, Portugal, 2009: 1-8.
  • 6Cowen L J. Compact routing with minimum stretch// Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Baltimore, USA, 1999: 255- 260.
  • 7Thorup M, Zwick U. Compact routing schemes/ /Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architecture (SPAA). Heraklion , Greece, 2001: 1-10.
  • 8Arias M, Cowen L J, Laing K A, Rajaraman R, Taka O. Compact routing with name independence//Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures(SPAA). San Diego, USA, 2003: 184-192.
  • 9Abraham I, Gavoille C, Malkhi D, et al. Compact nameindependent routing with minimum stretch. ACM Transactions on Algorithms, 2008, 4(3): 37.
  • 10Gavoille C, Gengler M. Space-efficiency for routing schemes of stretch factor three//Proceedings of the International Colloquium on Structural Information and Communication Complexity (SIROCCO). Monte Verita , Ascona , Switzerland. 1997: 162-175.

共引文献2

电信科学
2016年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部