Geometric Name Routing for ICN in Dynamic World  

作　　者：SUN Yanbin ZHANG Yu SU Shen ZHANG Hongli FANG Binxing 

机构地区：[1]School of Computer Science and Technology,Harbin Institute of Technology

出　　处：《China Communications》2015年第7期47-59,共13页中国通信（英文版）

基　　金：supported in part by the National Key Basic Research Program of China(973 Program) under Grant No. 2011CB302605,2013CB329602;the National Natural Science Foundation of China under Grant No.61202457,61402149

摘　　要：A new paradigm of scalable routing for ICN is to combine a geometric routing scheme with a Distributed Hash Table. However, for most routing schemes in this paradigm, when a node joins or leaves, large numbers of nodes, even the whole topology, need to be re-embedded, and a great number of contents need to be re-registered. In this paper, we propose D-Griffin, a geometric routing scheme on flat names for dynamic topologies. D-Griffin provides two advantages. First, it avoids re-embedding the topology by using an online greedy embedding scheme and a void handling greedy forwarding scheme. Second, it decreases the number of re-registrations by using a name mapping scheme with a tradeoff between topology independence and load balancing. Theoretical and experimental analyses show that D-Griffin provides guaranteed content lookup, low description complexity, low path stretch, scalable routing update, and acceptable load balancing.A new paradigm of scalable routing for ICN is to combine a geometric routing scheme with a Distributed Hash Table. However, for most routing schemes in this paradigm, when a node joins or leaves, large numbers of nodes, even the whole topology, need to be re-embedded, and a great number of contents need to be re-registered. In this paper, we propose D-Griffin, a geometric routing scheme on flat names for dynamic topologies. D-Griffin provides two advantages. First, it avoids re-embedding the topology by using an online greedy embedding scheme and a void handling greedy forwarding scheme. Second, it decreases the number of re-registrations by using a name mapping scheme with a tradeoff between topology independence and load balancing. Theoretical and experimental analyses show that D-Griffin provides guaranteed content lookup, low description complexity, low path stretch, scalable routing update, and acceptable load balancing.

关 键 词：geometric name routing online greedy embedding name mapping flat name 

分 类 号：TN915.0[电子电信—通信与信息系统]