Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-09T09:28:32.771Z Has data issue: false hasContentIssue false

11 - Separating routing policy from mechanism in the network layer

from Part III - Protocols and practice

Published online by Cambridge University Press:  05 October 2012

James Griffioen
Affiliation:
University of Kentucky, USA
Kenneth L. Calvert
Affiliation:
University of Kentucky, USA
Onur Ascigil
Affiliation:
University of Kentucky, USA
Song Yuan
Affiliation:
University of Kentucky, USA
Byrav Ramamurthy
Affiliation:
University of Nebraska, Lincoln
George N. Rouskas
Affiliation:
North Carolina State University
Krishna Moorthy Sivalingam
Affiliation:
Indian Institute of Technology, Madras
Get access

Summary

Introduction

Despite the world-changing success of the Internet, shortcomings in its routing and forwarding system (i.e., the network layer) have become increasingly apparent. One symptom is an escalating “arms race” between users and providers: providers understandably want to control use of their infrastructure; users understandably want to maximize the utility of the best-effort connectivity that providers offer. The result is a growing accretion of hacks, layering violations and redundant overlay infrastructures, each intended to help one side or the other achieve its policies and service goals.

Consider the growing number of overlay networks being deployed by users. Many of these overlays are designed specifically to support network layer services that cannot be supported (well) by the current network layer. Examples include resilient overlays that route packets over multiple paths to withstand link failures, distributed hash table overlays that route packets to locations represented by the hash of some value, multicast and content distribution overlays that give users greater control of group membership and distribution trees, and other overlay services. In many of these examples, there is a “tussle” between users and providers over how packets will be routed and processed. By creating an overlay network, users are able to, in a sense, impose their own routing policies – possibly violating those of the provider – by implementing a “stealth” relay service.

The lack of support for flexible business relationships and policies is another problem area for the current network layer.

Type
Chapter
Information
Next-Generation Internet
Architectures and Protocols
, pp. 219 - 237
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

,FORCES Working Group. www.ietf.org/html.charters/forces-charter.html.
,Planetlab: An Open Platform for Developing, Deploying, and Accessing Planetary-scale Services. www.planet-lab.org.
,Universal TUN/TAP Device Driver. www.kernel.org/pub/linux/kernel/people/marcelo/linux-2.4/Documentation/networking/tuntap.txt.
D. G., Andersen, H., Balakrishnan, M. F., Kaashoek, and R., Morris. Resilient Overlay Networks. In Symposium on Operating Systems Principles, pages 131–145, 2001.Google Scholar
O., Ascigil, S., Yuan, J., Griffioen, and K., Calvert. Deconstructing the Network Layer. In Proceedings of the ICCCN 2008 Conference, August 2008.Google Scholar
B., Bhattacharjee, K., Calvert, J., Griffioen, N., Spring, and J. P. G., Sterbenz. Postmodern Internetwork Architecture, 2006. Technical Report ITTC-FY2006-TR-45030-01, University of Kansas.
I., Casteneyra, N., Chiappa, and M., Steenstrup. The Nimrod Routing Architecture. RFC 1992, August 1996.
M., Cesar, T., Condie, J., Kannan, et al. ROFL: Routing on Flat Labels. In Proceedings of ACM SIGCOMM 2006, Pisa, Italy, pages 363–374, August 2006.Google Scholar
D., Cheriton. Sirpent(tm): A High-Performance Internetworking Approach. In Proceedings of ACM SIGCOMM 1989, Austin, Texas, pages 158–169, September 1989.Google Scholar
Y., Chu, S., Rao, S., Seshan, and H., Zhang. Enabling Conferencing Applications on the Internet Using an Overlay Multicast Architecture. In Proceedings of the ACM SIGCOMM 2001 Conference, August 2001.Google Scholar
D., Clark, J., Wroclawski, K., Sollins, and R., Braden. Tussle in Cyberspace: Designing Tomorrow's Internet. IEEE/ACM Transactions on Networking, 13(3):462–475, June 2005.Google Scholar
R., Droms. Dynamic Host Configuration Protocol. RFC 2131, March 1997.
M., Dworkin. Recommendation for Block Cipher Modes of Operation: Galois/Counter Mode (GCM) and GMAC. National Institute of Standards and Technology Special Publication 800-38D, November 2007.
D., Pendarakis, S., Shi, D., Verma, and M., Waldvogel. ALMI: An Application Level Multicast Infrastructure. In Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems (USITS), pages 49–60, 2001.Google Scholar
B., Raghavan and A., Snoeren. A System for Authenticated Policy-Compliant Routing. In Proceedings of ACM SIGCOMM 2004, Portland, Oregon, August 2004.Google Scholar
S., Ratnasamy, P., Francis, M., Handley, R., Karp, and S., Schenker. A Scalable Content-addressable Network. In SIGCOMM '01: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pages 161–172, New York, 2001. ACM.Google Scholar
E., Rosen, A., Viswanathan, and R., Callon. Multiprotocol Label Switching Architecture. RFC 3031, January 2001.
J. M., Scott and I. G., Jones. The ATM Forum's Private Network/Network Interface. BT Technology Journal, 16(2):37–46, April 1998.Google Scholar
I., Stoica, R., Morris, D., Liben-Nowell, et al. Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. IEEE/ACM Transactions on Networking, 11:17–32, 2003.Google Scholar
J., Touch. Performance Analysis of MD5. In SIGCOMM '95: Proceedings of the 1995 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, New York, August 1995. ACM.Google Scholar
B., White, J., Lepreau, L., Stoller, et al. An Integrated Experimental Environment for Distributed Systems and Networks. In Proceedings of the Fifth Symposium on Operating Systems Design and Implementation, pages 255–270, Boston, MA, December 2002. USENIX Association.Google Scholar
Hong Yan, D., A., Maltz, T. S. E., Ng, et al. Tesseract: A 4D Network Control Plane. In Proceedings of USENIX Symposium on Networked Systems Design and Implementation (NSDI '07), April 2007.Google Scholar
X., Yang. NIRA: A New Internet Routing Architecture. In Proceedings of ACM SIGCOMM 2003 Workshop on Future Directions in Network Architecture (FDNA), Karlsruhe, Germany, pages 301–312, August 2003.Google Scholar
B. Y., ZhaoL., Huang, J., Stribling, et al. Tapestry: A Resilient Globalscale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications, 22:41–53, 2004.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×