research-article

Scalable routing on flat names

Authors:

P. Brighten Godfrey,

Gianluca Iannaccone,

Sylvia RatnasamyAuthors Info & Claims

Co-NEXT '10: Proceedings of the 6th International COnference

Article No.: 20, Pages 1 - 12

https://doi.org/10.1145/1921168.1921195

Published: 30 November 2010 Publication History

Abstract

We introduce a protocol which routes on flat, location-independent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of compact routing, and is the first to realize these guarantees in a dynamic distributed setting.

References

[1]

I. Abraham, A. Badola, D. Bickson, D. Malkhi, S. Maloo, and S. Ron. Practical locality-awareness for large scale information sharing. In Proc. IPTPS, 2005.

Digital Library

[2]

I. Abraham, C. Gavoille, and D. Malkhi. Routing with improved communication-space trade-off. Lecture notes in computer science, pages 305--319, 2004.

[3]

I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup. Compact name-independent routing with minimum stretch. In SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 20--24, New York, NY, USA, 2004. ACM.

Digital Library

[4]

I. Abraham, D. Malkhi, and O. Dobzinski. Land: Stretch (1 + e) locality-aware networks for dhts. In Proc. SODA, pages 550--559, 2004.

Digital Library

[5]

D. G. Andersen, H. Balakrishnan, N. Feamster, T. Koponen, D. Moon, and S. Shenker. Accountable Internet Protocol (AIP). In ACM SIGCOMM, Seattle, WA, August 2008.

Digital Library

[6]

M. Arias, L. J. Cowen, K. A. Laing, R. Rajaraman, and O. Taka. Compact routing with name independence. In SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pages 184--192, New York, NY, USA, 2003. ACM.

Digital Library

[7]

B. Awerbuch, A. Bar-noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive routing. In Proc. STOC, pages 479--489. ACM Press, 1989.

Digital Library

[8]

J. Brutlag. Speed matters for Google web search, June 2009. http://code.google.com/speed/files/delayexp.pdf.

[9]

M. Caesar, M. Castro, E. Nightingale, G. O'Shea, and A. Rowstron. Virtual ring routing: network routing inspired by DHTs. ACM SIGCOMM Computer Communication Review, 36(4):362, 2006.

Digital Library

[10]

M. Caesar, T. Condie, J. Kannan, K. Lakshminarayanan, I. Stoica, and S. Shenker. ROFL: routing on flat labels. In ACM SIGCOMM, 2006.

Digital Library

[11]

D. Clark. The design philosophy of the DARPA Internet protocols. In Proc. SIGCOMM, page 114, 1988.

Digital Library

[12]

D. Clark, R. Braden, A. Falk, and V. Pingali. Fara: reorganizing the addressing architecture. SIGCOMM Comput. Commun. Rev., 33(4):313--321, 2003.

Digital Library

[13]

D. Farinacci, V. Fuller, D. Meyer, and D. Lewis. Locator/ID separation protocol (LISP). In Internet-Draft, March 2009.

[14]

R. Fonseca, S. Ratnasamy, J. Zhao, C. Ee, D. Culler, S. Shenker, and I. Stoica. Beacon vector routing: Scalable point-to-point routing in wireless sensornets. In NSDI, May 2005.

Digital Library

[15]

B. A. Ford. UIA: A Global Connectivity Architecture for Mobile Personal Devices. PhD thesis, Massachusetts Institute of Technology, September 2008.

Digital Library

[16]

P. Fraigniaud and C. Gavoille. Memory requirement for universal routing schemes. In PODC '95: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, pages 223--230, New York, NY, USA, 1995. ACM.

Digital Library

[17]

C. Gavoille. An overview on compact routing schemes. In Presentation at 2nd Research Workshop on Flexible Network Design, October 2006. http://www.aladdin.cs.cmu.edu/workshops/netdes2/slides/gavoille.pdf.

[18]

C. Gavoille and M. Gengler. Space-efficiency for routing schemes of stretch factor three. J. Parallel Distrib. Comput., 61(5):679--687, 2001.

Digital Library

[19]

P. B. Godfrey, I. Ganichev, S. Shenker, and I. Stoica. Pathlet routing. In ACM SIGCOMM, 2009.

Digital Library

[20]

M. Gritter and D. R. Cheriton. An architecture for content routing support in the internet. In USENIX Symposium on Internet Technologies and Systems, March 2001.

Digital Library

[21]

P. Jokela, P. Nikander, J. Melen, J. Ylitalo, and J. Wall. Host identity protocol-extended abstract. In Wireless World Research Forum, February 2004.

[22]

D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In Proc. STOC, pages 654--663, New York, NY, USA, 1997. ACM.

Digital Library

[23]

B. Karp and H. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Proc. MobiCom, pages 243--254. ACM, August 2000.

Digital Library

[24]

E. Karpilovsky and J. Rexford. Using forgetful routing to control BGP table size. In CoNEXT, 2006.

Digital Library

[25]

R. Kessler and J. Schwarzmeier. CRAY T3D: A new dimension for Cray Research. Compcon Spring'93, Digest of Papers., pages 176--182, 1993.

[26]

C. Kim, M. Caesar, and J. Rexford. Floodless in SEATTLE: A Scalable Ethernet Architecture for Large Enterprises. In ACM SIGCOMM, Seattle, WA, August 2008.

Digital Library

[27]

L. Kleinrock and F. Kamoun. Hierarchical routing for large networks: Performance evaluation and optimization. Computer Networks, 1(3):155--174, January 1977.

[28]

T. Koponen, M. Chawla, B. Chun, A. Ermolinskiy, K. Kim, S. Shenker, and I. Stoica. A data-oriented (and beyond) network architecture. ACM SIGCOMM Computer Communication Review, 37(4):192, 2007.

Digital Library

[29]

D. Krioukov, K. Fall, and X. Yang. Compact routing on Internet-like graphs. In IEEE INFOCOM, volume 1, pages 209--219. Citeseer, 2004.

[30]

D. Krioukov, kc claffy, K. Fall, and A. Brady. On compact routing for the internet. ACM SIGCOMM Computer Communication Review, 37(3):52, 2007.

Digital Library

[31]

K. Levchenko, G. Voelker, R. Paturi, and S. Savage. XL: An efficient network routing algorithm. In ACM SIGCOMM, pages 15--26, August 2008.

Digital Library

[32]

G. S. Manku, M. Bawa, P. Raghavan, and V. Inc. Symphony: Distributed hashing in a small world. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, pages 127--140, 2003.

Digital Library

[33]

G. S. Manku, M. Naor, and U. Wieder. Know thy neighbor's neighbor: the power of lookahead in randomized p2p networks. In Proc. STOC, pages 54--63, 2004.

Digital Library

[34]

Y. Mao, F. Wang, L. Qiu, S. Lam, and J. Smith. S4: Small state and small stretch routing protocol for large wireless sensor networks. In Proc. NSDI, April 2007.

Digital Library

[35]

D. Mazieres, M. Kaminsky, M. Kaashoek, and E. Witchel. Separating key management from file system security. In ACM SOSP, December 1999.

Digital Library

[36]

S. Nath, P. B. Gibbons, S. Seshan, and Z. R. Anderson. Synopsis diffusion for robust aggregation in sensor networks. In ACM SenSys, 2004.

Digital Library

[37]

D. Peleg and E. Upfal. A tradeoff between space and efficiency for routing tables. In Proc. STOC, pages 43--52, New York, NY, USA, 1988. ACM.

Digital Library

[38]

C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc. SPAA, pages 311--320, New York, NY, USA, 1997. ACM.

Digital Library

[39]

A. Rowstron and P. Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems. In Proc. Middleware, 2001.

Digital Library

[40]

M. Särelä, T. R. Aho, and T. Tarkoma. RTFM: Publish/subscribe internetworking architecture. ICT Mobile Summit, 2008.

[41]

A. Singla, P. B. Godfrey, K. Fall, G. Iannaccone, and S. Ratnasamy. Scalable routing on flat names, July 2010. http://www.cs.illinois.edu/homes/singla2/compactrouting.pdf.

Digital Library

[42]

I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana. Internet indirection infrastructure. In Proc. SIGCOMM, pages 73--86. ACM New York, NY, USA, 2002.

Digital Library

[43]

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. SIGCOMM, 2001.

Digital Library

[44]

M. Thorup and U. Zwick. Compact routing schemes. In Proc. SPAA, pages 1--10. ACM, 2001.

Digital Library

[45]

P. F. Tsuchiya. The landmark hierarchy: a new hierarchy for routing in very large networks. In Proc. SIGCOMM, pages 35--42, New York, NY, USA, 1988. ACM.

Digital Library

[46]

M. Walfish, H. Balakrishnan, and S. Shenker. Untangling the Web from DNS. In Proc. NSDI, page 17. USENIX Association, 2004.

Digital Library

[47]

C. Westphal and J. Kempf. A compact routing architecture for mobility. In Proc. MobiArch, pages 1--6. ACM, 2008.

Digital Library

[48]

Young Hyun, Bradley Huffaker, Dan Andersen, Emile Aben, Colleen Shannon, Matthew Luckie, and kc claffy. The CAIDA IPv4 Routed /24 Topology Dataset. http://www.caida.org/data/active/ipv4_routed_24_topology_dataset.xml (accessed on 2009--11).

[49]

Young Hyun, Bradley Huffaker, Dan Andersen, Emile Aben, Matthew Luckie, kc claffy, and Colleen Shannon. The IPv4 Routed /24 AS Links Dataset. http://www.caida.org/data/active/ipv4_routed_topology_aslinks_dataset.xml (accessed on 2009--11).

[50]

B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, Apr. 2001.

Digital Library

Cited By

Bless RZitterbart MDespotovic ZHecker A(2022)KIRA: Distributed Scalable ID-based Routing with Fast Forwarding2022 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking55013.2022.9829816(1-9)Online publication date: 13-Jun-2022
https://doi.org/10.23919/IFIPNetworking55013.2022.9829816
Byrenheid MStrufe TRoos S(2020)Secure Embedding of Rooted Spanning Trees for Scalable Routing in Topology-Restricted Networks2020 International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS51746.2020.00025(175-184)Online publication date: Sep-2020
https://doi.org/10.1109/SRDS51746.2020.00025
Avramovic I(2019)Routing Sets and Hint-Based Routing10.1007/978-3-030-12385-7_43(586-602)Online publication date: 2-Feb-2019
https://doi.org/10.1007/978-3-030-12385-7_43
Show More Cited By

Index Terms

Scalable routing on flat names

Recommendations

Scalable routing in delay tolerant networks
MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing

The non-existence of an end-to-end path poses a challenge inadapting the traditional routing algorithms to delay tolerantnetworks (DTNs). Previous works include centralized rout-ing approaches based on deterministic mobility, ferry-basedrouting with ...
Scalable Routing in Cyclic Mobile Networks

The nonexistence of an end-to-end path poses a challenge in adapting traditional routing algorithms to delay-tolerant networks (DTNs). Previous works have covered centralized routing approaches based on deterministic mobility, ferry-based routing with ...
Scalable routing overlay networks

Routing overlays have become a viable approach to working around slow BGP convergence and sub-optimal path selection, as well as to deploy novel forwarding architectures. A common sub-component of a routing overlay is a routing mesh: the route-selection ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

Co-NEXT '10: Proceedings of the 6th International COnference

November 2010

349 pages

ISBN:9781450304481

DOI:10.1145/1921168

Conference Chairs:
Jaudelice de Oliveira
Drexel University
,
Maximilian Ott
NICTA, Australia
,
Program Chairs:
Tim Griffin
University of Cambridge
,
Muriel Medard
Massachusetts Institute of Technology

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 November 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

Co-NEXT '10

Sponsor:

SIGCOMM

Co-NEXT '10: Conference on emerging Networking EXperiments and Technologies

November 30 - December 3, 2010

Pennsylvania, Philadelphia

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
428
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)1

Reflects downloads up to 01 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bless RZitterbart MDespotovic ZHecker A(2022)KIRA: Distributed Scalable ID-based Routing with Fast Forwarding2022 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking55013.2022.9829816(1-9)Online publication date: 13-Jun-2022
https://doi.org/10.23919/IFIPNetworking55013.2022.9829816
Byrenheid MStrufe TRoos S(2020)Secure Embedding of Rooted Spanning Trees for Scalable Routing in Topology-Restricted Networks2020 International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS51746.2020.00025(175-184)Online publication date: Sep-2020
https://doi.org/10.1109/SRDS51746.2020.00025
Avramovic I(2019)Routing Sets and Hint-Based Routing10.1007/978-3-030-12385-7_43(586-602)Online publication date: 2-Feb-2019
https://doi.org/10.1007/978-3-030-12385-7_43
Shen TZhang XXie GMeng YZhang D(2018)CoDE: Fast Name Lookup and Update using Conflict-driven Encoding2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)10.1109/PCCC.2018.8711226(1-8)Online publication date: Nov-2018
https://doi.org/10.1109/PCCC.2018.8711226
Yu YBelazzougui DQian CZhang Q(2017)A concise forwarding information base for scalable and fast name lookups2017 IEEE 25th International Conference on Network Protocols (ICNP)10.1109/ICNP.2017.8117530(1-10)Online publication date: Oct-2017
https://doi.org/10.1109/ICNP.2017.8117530
SUN YZHANG YFANG BZHANG H(2016)SNGR: Scalable Name-Based Geometric Routing for ICNIEICE Transactions on Communications10.1587/transcom.2015EBP3513E99.B:8(1835-1845)Online publication date: 2016
https://doi.org/10.1587/transcom.2015EBP3513
Tan GYin ZJiang H(2016)Trap arrayIEEE/ACM Transactions on Networking10.1109/TNET.2014.236294324:1(328-341)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1109/TNET.2014.2362943
Guo CKarsten M(2016)On the feasibility of core-rooted path addressingNOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium10.1109/NOMS.2016.7502826(306-314)Online publication date: Apr-2016
https://doi.org/10.1109/NOMS.2016.7502826
Moradi MQian FXu QMao ZBethea DReiter MBrebner GBachmutsky ADas C(2015)CaesarProceedings of the Eleventh ACM/IEEE Symposium on Architectures for networking and communications systems10.5555/2772722.2772745(171-182)Online publication date: 7-May-2015
https://dl.acm.org/doi/10.5555/2772722.2772745
Gulyás ARétvári GHeszberger ZAgarwal R(2015)On the scalability of routing with policiesIEEE/ACM Transactions on Networking10.1109/TNET.2014.234583923:5(1610-1618)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1109/TNET.2014.2345839
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten