A self-organized locator obtaining method driven by local minima  

作　　者：王永功 Xie Gaogang 

机构地区：[1]Institute of Computing Technology,Chinese Academy of Sciences [2]The Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory,the 54th Research Institute of China Electronics Technology Group Corporation

出　　处：《High Technology Letters》2015年第2期155-161,共7页高技术通讯（英文版）

基　　金：Supported by the National High Technology Research and Development Program of China(No.2013AA013501);the National Program on Key Basic Research Project(No.2012CB315801);the National Natural Science Foundation of China(No.61133015);the Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory,CETC54

摘　　要：The scalability of routing architectures for large networks is one of the biggest challenges that the Internet faces today.Greedy routing,in which each node is assigned a locator used as a distance metric,recently received increased attention from researchers and is considered as a potential solution for scalable routing.In this paper,LMD—a local minimum driven method is proposed to compute the topology-based locator.To eliminate the negative effect of the " quasi" greedy property—transfer routes longer than the shortest routes,a two-stage routing strategy is introduced,which combines the greedy routing with source routing.The greedy routing path discovered and compressed in the first stage is then used by the following source-routing stage.Through extensive evaluations,based on synthetic topologies as well as on a snapshot of the real Internet AS(autonomous system)topology,it is shown that LMD guarantees 100%delivery rate on large networks with low stretch.The scalability of routing architectures for large networks is one of the biggest challenges that the Internet faces today. Greedy routing, in which each node is assigned a locator used as a distance metric, recently received increased attention from researchers and is considered as a potential solu tion for scalable routing. In this paper, LMD a local minimum driven method is proposed to com pute the topologybased locator. To eliminate the negative effect of the ＂quasi＂ greedy property transfer routes longer than the shortest routes, a twostage routing strategy is introduced, which com bines the greedy routing with source routing. The greedy routing path discovered and compressed in the first stage is then used by the following sourcerouting stage. Through extensive evaluations, based on synthetic topologies as well as on a snapshot of the real Internet AS （autonomous system） topology, it is shown that LMD guarantees 100% delivery rate on large networks with low stretch.

关 键 词：greedy routing locator SELF-ORGANIZED local minimum TOPOLOGY 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]