Routing to Multi-instantiated Destinations: Principles and Applications

Prior solutions for routing to multi-instantiated destinations (e.g., Internet multicasting and any casting, and routing in information centric networks) simply adapt existing routing algorithms designed for single-instance destinations, or rely on flooding techniques. As a result, they are unnecessarily complex and incur excessive overhead. A new approach for routing to multi-instantiated destinations is introduced, and MIDR (Multiple Instance Destination Routing) is presented as an example of the approach. MIDR uses only distance information to multi-instantiated destinations, without routers having to establish overlays, know the network topology, use complete paths to destination instances, or know about all the instances of destinations. MIDR enables routers to maintain multiple loop free routes to the nearest instances of any given destination, as well as to some or all instances of the same destination. It is shown that MIDR provides multiple loop-free paths to destination instances, and that is orders of magnitude more efficient than traditional approaches based on routing to single instance destinations. MIDR can be used in name-based content routing, IP unicast routing, multicasting, and any casting.

[1]  Baruch Awerbuch,et al.  A New Distributed Depth-First-Search Algorithm , 1985, Inf. Process. Lett..

[2]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[3]  Alexander Afanasyev,et al.  Adaptive forwarding in named data networking , 2012, CCRV.

[4]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.

[5]  J. J. Garcia-Luna-Aceves,et al.  Name-based content routing in information centric networks using distance information , 2014, ICN '14.

[6]  Syed Obaid Amin,et al.  NLSR: named-data link state routing protocol , 2013, ICN '13.

[7]  Dimitri P. Bertsekas,et al.  Data Networks: Second Edition , 1992 .

[8]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[9]  Alexander L. Wolf,et al.  A routing scheme for content-based networking , 2004, IEEE INFOCOM 2004.

[10]  Stephen E. Deering,et al.  Multicast routing in internetworks and extended LANs , 1988, SIGCOMM '88.

[11]  Liang Cheng,et al.  A survey of anycast in IPv6 networks , 2004, IEEE Communications Magazine.

[12]  J. J. Garcia-Luna-Aceves,et al.  A Protocol for Scalable Loop-Free Multicast Routing , 1997, IEEE J. Sel. Areas Commun..

[13]  Bengt Ahlgren,et al.  A survey of information-centric networking , 2012, IEEE Communications Magazine.

[14]  J.M. McQuillan.  Enhanced message addressing capabilities for computer networks , 1978, Proceedings of the IEEE.

[15]  J. J. Garcia-Luna-Aceves,et al.  A unified approach to loop-free routing using distance vectors or link states , 1989, SIGCOMM '89.

[16]  J. J. Garcia-Luna-Aceves,et al.  Congestion-oriented shortest multipath routing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[17]  J. J. Garcia-Luna-Aceves,et al.  A path-finding algorithm for loop-free routing , 1997, TNET.

[18]  Deep Medhi,et al.  Network routing - algorithms, protocols, and architectures , 2007 .

[19]  Dharma P. Agrawal,et al.  Multipath Routing in Wireless Mesh Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[20]  John Wroclawski,et al.  A framework for scalable global IP-anycast (GIA) , 2000, CCRV.

[21]  Anjali Gupta,et al.  Efficient Routing for Peer-to-Peer Overlays , 2004, NSDI.

[22]  Scott Shenker,et al.  Internet indirection infrastructure , 2004, IEEE/ACM Transactions on Networking.

[23]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[24]  David R. Cheriton,et al.  An Architecture for Content Routing Support in the Internet , 2001, USITS.

[25]  J. J. Garcia-Luna-Aceves,et al.  Improving Internet multicast with routing labels , 1997, Proceedings 1997 International Conference on Network Protocols.

[26]  J. J. Garcia-Luna-Aceves,et al.  Hierarchical routing using link vectors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[27]  Paul Francis,et al.  Towards a global IP anycast service , 2005, SIGCOMM '05.

[28]  Nikos Fotiou,et al.  A Survey of Information-Centric Networking Research , 2014, IEEE Communications Surveys & Tutorials.

[29]  J. J. Garcia-Luna-Aceves,et al.  Multipath routing in wireless mesh networks , 2005 .

[30]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[31]  J. J. Garcia-Luna-Aceves,et al.  Dynamics of distributed shortest-path routing algorithms , 1991, SIGCOMM '91.

[32]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1998, IEEE J. Sel. Areas Commun..

[33]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[34]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM 1993.

[35]  Raouf Boutaba,et al.  A survey of naming and routing in information-centric networks , 2012, IEEE Communications Magazine.

[36]  Alexander Afanasyev,et al.  journal homepage: www.elsevier.com/locate/comcom , 2022 .

[37]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[38]  G. Sicuranza,et al.  The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .

[39]  J. J. Garcia-Luna-Aceves,et al.  Robust content dissemination in disrupted environments , 2008, CHANTS '08.

[40]  J. J. Garcia-Luna-Aceves,et al.  A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM 1989.

[41]  J. J. Garcia-Luna-Aceves,et al.  Scalable link-state Internet routing , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

[42]  Nicola Blefari-Melazzi,et al.  CONET: a content centric inter-networking architecture , 2011, ICN '11.

[43]  Janne Riihijärvi,et al.  On name-based inter-domain routing , 2011, Comput. Networks.

[44]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM '07.

[45]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[46]  J. J. Garcia-Luna-Aceves,et al.  Scalable Multicasting: The Core-Assisted Mesh Protocol , 2001, Mob. Networks Appl..

[47]  Marjory J. Johnson.  Updating routing tables after resource failure in a distributed computer network , 1984, Networks.

[48]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[49]  Ellen W. Zegura,et al.  Application-layer anycasting: a server selection architecture and use in a replicated Web service , 2000, TNET.