skip to main content
article

ROFL: routing on flat labels

Published:11 August 2006Publication History
Skip Abstract Section

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

Index Terms

  1. ROFL: routing on flat labels

          Recommendations

          Comments

          Login options

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

          Sign in

          Full Access

          • Published in

            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
            • 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

            Copyright © 2006 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]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 11 August 2006

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader