skip to main content
10.1145/1159913.1159955acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free access

ROFL: routing on flat labels

Published: 11 August 2006 Publication History

Abstract

It is accepted wisdom that the current Internet architecture conflates network locations and host identities, but there is no agreement on how a future architecture should distinguish the two. One could sidestep this quandary by routing directly on host identities themselves, and eliminating the need for network-layer protocols to include any mention of network location. The key to achieving this is the ability to route on flat labels. In this paper we take an initial stab at this challenge, proposing and analyzing our ROFL routing algorithm. While its scaling and efficiency properties are far from ideal, our results suggest that the idea of routing on flat labels cannot be immediately dismissed.

References

[1]
I. Abraham, A. Badola, D. Bickson, D. Malkhi, S. Maloo, S. Ron, "Practical locality-awareness for large scale information sharing," IPTPS, February 2005.]]
[2]
T. Anderson, T. Roscoe, D. Wetherall, "Preventing Internet denial-of-service with capabilities," SIGCOMM Comput.Commun. Rev., 34(1):39--44, 2004.]]
[3]
H. Balakrishnan, K. Lakshminarayanan, S. Ratnasamy, S. Shenker, I. Stoica, M. Walfish, "A layered naming architecture for the Internet," ACM SIGCOMM, August 2004.]]
[4]
H. Ballani, Y. Chawathe, S. Ratnasamy, T. Roscoe, and S. Shenker, "'Off by Default!," HotNets, 2005.]]
[5]
H. Ballani, P. Francis. "Towards a Global IP Anycast Service," ACM SIGCOMM, Aug 2005]]
[6]
B. Bloom, "Space/time trade-offs in hash coding with allowable errors," Commun. ACM, vol. 13, no. 7, pp. 422--426, July 1970.]]
[7]
M. Caesar, M. Castro, E. Nightingale, G. O'Shea, A. Rowstron, "Virtual ring routing: network routing inspired by DHTs," ACM SIGCOMM, September 2006.]]
[8]
M. Castro, P. Drushel, A. Ganesh, A. Rowstron, and D. Wallach, "Secure routing for structured peer-to-peer overlay networks" OSDI, December 2002.]]
[9]
M. Castro, P. Druschel, Y. Charlie Hu, A. Rowstron, "Exploiting network proximity in peer-to-peer overlay networks," Microsoft Research technical report MSR-TR-2002-82, 2002.]]
[10]
D. Cheriton, M. Gritter, "TRIAD: a scalable deployable NAT-based Internet architecture," Technical report, January 2000.]]
[11]
D. Clark, R. Braden, A. Falk, V. Pingali, "FARA: reorganizing the addressing architecture," SIGCOMM FDNA Workshop, August 2003.]]
[12]
S. Deering, D. Cheriton. "Multicast Routing in Datagram Internetworks and Extended LANs," ACM TOCS, 1990.]]
[13]
J. Douceur, "The Sybil Attack" IPTPS, March 2002.]]
[14]
A. Feldmann, O. Maennel, Z. Mao, A. Berger, B. Maggs, "Locating Internet routing instabilities," ACM SIGCOMM, August 2004.]]
[15]
B. Ford, "Unmanaged internet protocol: taming the edge network management crisis," HotNets, Cambridge, MA, Nov. 2003.]]
[16]
P. Francis, R. Gummadi, "IPNL: a NAT-extended Internet architecture," ACM SIGCOMM, August 2002.]]
[17]
P. Ganesan, K. Gummadi, H. Garcia-Molina, "Canon in G major: designing DHTs with hierarchical structure," ICDCS, March 2004.]]
[18]
M. Gritter and D. Cheriton, "An Architecture for Content Routing Support in the Internet," In the USENIX Symposium on Internet Technologies and Systems, March 2001.]]
[19]
M. Handley and A. Greenhalgh, "Steps towards a DoS-resistant internet architecture," FDNA, 2004.]]
[20]
J. Jannotti, "Network layer support for overlay networks," PhD thesis, MIT, August 2002.]]
[21]
J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, J. W. O'Toole Jr, "Overcast: Reliable Multicasting with an Overlay Network," OSDI, October 2000.]]
[22]
P. Jokela, P. Nikander, J. Melen, J. Ylitalo, J. Wall, "Host identity protocol-extended abstract," in Wireless World Research Forum, February 2004.]]
[23]
A. Jonsson, M. Folke, B. Ahlgren, "The split naming/forwarding network architecture," Proc. Swedish National Computer Networking Workshop (SNCNW), September 2003.]]
[24]
D. Krioukov, kc claffy, "Toward compact interdomain routing," Unpublished draft, http://www.krioukov.net/~dima/pub/cir.pdf]]
[25]
D. Krioukov, K. Fall, X. Yang, "Compact routing on Internet-like graphs," IEEE Infocom, March 2004.]]
[26]
D. Mazieres, "Self-certifying file system," PhD thesis, MIT, May 2000.]]
[27]
A. Myers, E. Ng, H. Zhang, "Rethinking the service model: scaling ethernet to a million nodes," HotNets, November 2004.]]
[28]
M. O'Dell, "GSE - an alternate addressing architecture for IPv6," ftp://ds.internic.net/internetdrafts/draftietfipngwg-gseaddr-00.txt, 1997.]]
[29]
L. Peterson, S. Shenker, J. Turner, "Overcoming the Internet impasse through virtualization," HotNets, November 2004.]]
[30]
A. Rowstron, P. Druschel, "Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems," IFIP/ACM Middleware, November 2001.]]
[31]
J. Saltzer, "On the naming and binding of network destinations," RFC 1498, August 1993.]]
[32]
N. Spring, R. Mahajan, D. Wetherall, "Measuring ISP topologies with Rocketfuel," ACM SIGCOMM, August 2002.]]
[33]
I. Stoica, D. Adkins, S. Zhuang, S. Shenker, S. Surana, "Internet indirection infrastructure," ACM SIGCOMM, August 2002.]]
[34]
I. Stoica, R. Morris, D. Lieben-Nowell, D. Karger, M. Kaashoek, F. Dabek, H. Balakrishnan, "Chord: a scalable peer-to-peer lookup protocol for Internet applications," IEEE Transactions on Networks, 11(1) 17--32, 2003.]]
[35]
L. Subramanian, S. Agarwal, J. Rexford, R. Katz,"Characterizing the Internet Hierarchy from Multiple Vantage Points," in IEEE Infocom 2002, June 2002.]]
[36]
L. Subramanian, M. Caesar, C. Ee, M. Handley, M. Mao, S. Shenker, I. Stoica, "HLP: a next-generation interdomain routing protocol," ACM SIGCOMM, August 2005.]]
[37]
M. Walfish, H. Balakrishnan, S. Shenker, "Untangling the web from DNS," NSDI March 2004.]]
[38]
M. Walfish, J. Stribling, M. Krohn, H. Balakrishnan, R. Morris, S. Shenker, "Middleboxes no longer considered harmful," OSDI, December 2004.]]
[39]
F. Wang, L. Gao, "Inferring and characterizing Internet routing policies," Proc. Internet Measurement Conference, October 2003.]]
[40]
Abraham Yaar, Adrian Perrig, Dawn Song, "Pi: A Path Identification Mechanism to Defend against DDoS Attacks," IEEE Symposium on Security and Privacy, 2003.]]
[41]
X. Yang, "NIRA: a new Internet routing architecture," SIGCOMM Workshop on Future Directions in Network Architecture (FDNA), August 2003.]]
[42]
X. Yang, D. Wetherall, and T. Anderson, "A DoS-limiting Network Architecture," ACM SIGCOMM 2005, August 2005.]]
[43]
CAIDA, "Skitter," http://www.caida.org/tools/measurement/skitter.]]
[44]
"FIND: future Internet network design," http://find.isi.edu, December 2005.]]
[45]
"GENI: global environment for network innovations," http://www.geni.net]]
[46]
Internet Systems Consortium, "Domain survey host count," http://www.isc.org/index.pl?/ops/ds/, July 2005.]]
[47]
"NewArch project: future-generation Internet architecture," http://www.isi.edu/newarch/]]
[48]
"Route Views Project," http://www.routeviews.org.]]

Cited By

View all
  • (2024)Internet Identifiers: A Survey of History, Challenges, and Future PerspectivesIEEE Access10.1109/ACCESS.2024.338211512(51919-51941)Online publication date: 2024
  • (2022)Weighted NSFIB Aggregation With Generalized Next Hop of Strict Partial OrderIEEE Transactions on Network and Service Management10.1109/TNSM.2022.315038919:2(890-904)Online publication date: 10-Feb-2022
  • (2021)The ties that un-bindProceedings of the 2021 ACM SIGCOMM 2021 Conference10.1145/3452296.3472922(433-446)Online publication date: 9-Aug-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGCOMM '06: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
September 2006
458 pages
ISBN:1595933085
DOI:10.1145/1159913
  • cover image ACM SIGCOMM Computer Communication Review
    ACM SIGCOMM Computer Communication Review  Volume 36, Issue 4
    Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
    October 2006
    445 pages
    ISSN:0146-4833
    DOI:10.1145/1151659
    Issue’s Table of Contents
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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 August 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. internet architecture
  2. naming
  3. routing

Qualifiers

  • Article

Conference

SIGCOMM06
Sponsor:
SIGCOMM06: ACM SIGCOMM 2006 Conference
September 11 - 15, 2006
Pisa, Italy

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)69
  • Downloads (Last 6 weeks)10
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Internet Identifiers: A Survey of History, Challenges, and Future PerspectivesIEEE Access10.1109/ACCESS.2024.338211512(51919-51941)Online publication date: 2024
  • (2022)Weighted NSFIB Aggregation With Generalized Next Hop of Strict Partial OrderIEEE Transactions on Network and Service Management10.1109/TNSM.2022.315038919:2(890-904)Online publication date: 10-Feb-2022
  • (2021)The ties that un-bindProceedings of the 2021 ACM SIGCOMM 2021 Conference10.1145/3452296.3472922(433-446)Online publication date: 9-Aug-2021
  • (2020)A Hybrid SWIM Data Naming Scheme Based on TLC StructureFuture Internet10.3390/fi1209014212:9(142)Online publication date: 25-Aug-2020
  • (2020)Achieving High Throughput for Heterogeneous Networks With Consecutive Caching and Adaptive RetrievalIEEE Transactions on Network Science and Engineering10.1109/TNSE.2020.30109397:4(2443-2455)Online publication date: 1-Oct-2020
  • (2018)APTFog Computing10.4018/978-1-5225-5649-7.ch007(158-182)Online publication date: 2018
  • (2018)Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello HashingIEEE/ACM Transactions on Networking10.1109/TNET.2018.282006726:3(1151-1164)Online publication date: 1-Jun-2018
  • (2018)Utility-Centric NetworkingIEEE/ACM Transactions on Networking10.1109/TNET.2017.278025726:1(245-258)Online publication date: 1-Feb-2018
  • (2017)Economic Levers for Mitigating Interest Flooding Attack in Named Data NetworkingMathematical Problems in Engineering10.1155/2017/45419752017:1Online publication date: 7-Jun-2017
  • (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
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media