Scalable geometric routing scheme based on location-independent names

Yanbin SUN; Yu ZHANG; Hongli ZHANG; Binxing FANG

doi:10.11959/j.issn.1000-0801.2016001

您当前的位置：

首页 >

文章列表页 >

Scalable geometric routing scheme based on location-independent names

Ressearch and development | 更新时间：2024-06-05

- Scalable geometric routing scheme based on location-independent names
- Telecommunications Science Vol. 32, Issue 1, Pages: 1-10(2016)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：10.11959/j.issn.1000-0801.2016001
  CLC： TP301
- Published Online：2016-01，
  
  Published：20 January 2016
- 稿件说明：
移动端阅览
Yanbin SUN, Yu ZHANG, Hongli ZHANG, et al. Scalable geometric routing scheme based on location-independent names[J]. Telecommunications science, 2016, 32(1): 1-10.
DOI：

Yanbin SUN, Yu ZHANG, Hongli ZHANG, et al. Scalable geometric routing scheme based on location-independent names[J]. Telecommunications science, 2016, 32(1): 1-10. DOI： 10.11959/j.issn.1000-0801.2016001.

摘要

名字路由已成为未来网络的研究热点之一，由于网络中节点和信息规模的持续增长，可扩展问题成为其瓶颈。几何路由作为新型可扩展路由方案，可同时满足路由表规模和路由路径的可扩展，但难以支持名字路由。首先在几何路由基础上提出了一种通用的基于位置无关名字的可扩展几何路由方案——GRIN，结合源路由和贪心路由实现混合几何路由，在混合几何路由上引入基于双层稀疏群组的名字解析（映射）。然后理论分析了节点状态及名字映射的路径延展度上界。最后通过仿真验证了GRIN具备可扩展、低延展度以及高可靠性等特征，并优于其他名字路由方案。

Abstract

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.

关键词

Keywords

references

AHLGREN B , DANNEWITZ C , IMBRENDA C , et al . A survey of information-centric networking [J ] . Communications Magazine , 2012 , 50 （ 7 ）: 26 - 36 .

CAESAR M , CONDIE T , KANNAN J , et al . ROFL:routing on flat labels [J ] . ACM Sigcomm Computer Communication Review , 2006 , 36 （ 4 ）: 363 - 374 .

JACOBSON V , SMETTERS D K , JAMES D , et al . Networking named content [C ] // Proceedings of Conference on Emerging Networking Experiments and Technology , December 1 - 4 , 2009 , Rome,Italy . New York : ACM Press , 2009 : 1 - 12 .

The Locator/ID Separation Protocol:RFC6830:2013 [S/OL ] .[ 2015 - 7 - 25 ] http://www.chayiba.com/50cnnet.com http://www.chayiba.com/50cnnet.com .

SINGLA A , GODFREY P B , FALL K , et al . Scalable routing on flat names [J ] . Eprint Arxiv , 2013 : 1 - 12 .

GRITTER M , CHERITON D R . An architecture for content routing support in the Internet [C ] // Proceedings of Unix Symposium on Internet Technologies , March 26 - 28 , 2001 , San Francisco,California,USA . New York : ACM Press , 2001 : 4 .

KOPONEN T , CHAWLA C , CHUN B G , et al . A data-oriented （and beyond）network architecture [J ] . ACM Sigcomm Computer Communication Review , 2007 , 37 （ 4 ）: 181 - 192 .

DANNEWITZ C , KUTSCHER D , OHLMAN B , et al . Network of Information （NetInf）-An information-centric networking architecture [J ] . Computer Communications , 2013 , 36 （ 7 ）: 721 - 735 .

KLEINBERG R . Geographic routing using hyperbolic space [C ] // Proceedings of IEEE International Conference on Computer Communications , May 6-12 , 2007 , Anchorage,Alaska,USA . New Jersey : IEEE Press , 2007 : 1902 - 1909 .

KLEINROCK L , KAMOUN F . Hierarchical routing for large networks:Performance evaluation and optimization [J ] . Computer Networks , 1977 , 1 （ 3 ）: 155 - 174 .

CAESAR M , CASTRO M , NIGHTINGALE E , et al . Virtual ring routing:network routing inspired by DHTs [J ] . ACM Sigcomm Computer Communication Review , 2006 , 36 （ 4 ）: 351 - 362 .

THORUP M , ZWICK U . Compact routing schemes [C ] // Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures , July 4 - 6 , 2001 , Crete Island,Greece . New York : ACM Press , 2001 : 1 - 10 .

HERZEN J , WESTPHAL C , THIRAN P . Scalable Routing Easy as PIE:a Practical Isometric Embedding Protocol [C ] // Proceedings of the 19th IEEE International Conference on Network Protocols , October 17 - 20 , 2011 , Vancouver,Canada . New Jersey : IEEE Press , 2011 : 49 - 58 .

AHMED R , BARI M F , CHOWDHURY S R , et al . alpha Route:A name based routing scheme for Information Centric Networks [C ] // Proceedings of the IEEE International Conference on Computer Communications , April 14 - 19 , 2013 , Turin,Italy . New Jersey : IEEE Press , 2013 : 90 - 94 .

DAMBROSIO M , DANNEWITZ C , KARL H , et al . MDHT:a hierarchical name resolution service for information-centric networks [C ] // Proceedings of Conference of the Special Interest Group on Data Communication , August 15 - 19 , 2011 , Toronto,Canada . New York : ACM Press , 2011 : 7 - 12 .

唐明董，刘建勋，张国清，等 . 无标度网络上名字无关的紧凑路由研究 [J ] . 计算机学报， 2014 , 37 （ 11 ）: 2353 - 2365 .

TANG M D , LIU J X , ZHANG G Q , et al . Name-independent compact routing in scale-free networks [J ] . Chinese Journal of Computers , 2014 , 37 （ 11 ）: 2353 - 2365 .

WANG L , WALTARI O , KANGASHARJU J . Mobiccn:mobility support with greedy routing in content-centric networks [C ] // Proceedings of IEEE Global Communications Conference （GLOBECOM） , December 9 - 13 , 2013 , Atlanta,USA . New Jersey : IEEE Press , 2013 : 2069 - 2075 .

HOFER A , ROOS S , STRUFE T . Greedy embedding,routing and content addressing for darknets . Proceeds of Conference on Networked Systems , March 11-15 , 2013 , Stuttgart,Germany . New Jersey:IEEE Press , 2013 : 43 - 50 .

SUN Y , ZHANG Y , SU S , et al . Geometric name routing for ICN in dynamic world [J ] . Communications , 2015 , 12 （ 7 ）: 47 - 59 .

CVETKOVSKI A , CROVELLA M . On the choice of a spanning tree for greedy embedding of network graphs [J ] . Networking Science , 2013 , 3 （ 1-4 ）: 2 - 12 .

PERLMAN R . An algorithm for distributed computation of a spanning tree in an extended LAN [J ] . ACM Sigcomm Computer Communication review , 1985 , 15 （ 4 ）: 44 - 53 .

The IPv4 routed/24 AS links dataset [EB/OL ] .[ 2015 - 07 - 15 ] . http://www.caida.org/data/active//ipv4_routed_topology_aslinks_dataset.xml http://www.caida.org/data/active//ipv4_routed_topology_aslinks_dataset.xml .

BARABASI A L , ALBERT R . Emergence of scaling in random networks [J ] . Science , 1999 , 286 （ 5439 ）: 509 - 512 .

Views

429

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Scalability Optimization of Virtualization Based Botnet Emulation Platform

Reconfiguration Technology and Future Network Architecture

Related Author

Li Ruan

Bo Lin

Limin Xiao

Julong Lan

Chiqiang Xing

Yuxiang Hu

Dongnian Cheng

Related Institution

State Key Laboratory of Software Development Environment,Beihang University

School of Computer Science and Engineering, Beihang University

⁰