Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-5cf477f64f-h6p2m Total loading time: 0 Render date: 2025-04-05T20:59:00.639Z Has data issue: false hasContentIssue false

9 - Customizable in-network services

from Part II - Network architectures

Published online by Cambridge University Press:  05 October 2012

By
Tilman Wolf
Edited by
Byrav Ramamurthy ,
George N. Rouskas  and
Krishna Moorthy Sivalingam
Tilman Wolf
Affiliation:
University of Massachusetts Amherst, 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

One of the key characteristics of the next-generation Internet architecture is its ability to adapt to novel protocols and communication paradigms. This adaptability can be achieved through custom processing functionality inside the network. In this chapter, we discuss the design of a network service architecture that can provide custom in-network processing.

Background

Support for innovation is an essential aspect of the next-generation Internet architecture. With the growing diversity of systems connected to the Internet (e.g., cell phones, sensors, etc.) and the adoption of new communication paradigms (e.g., content distribution, peer-to-peer, etc.), it is essential that not only existing data communication protocols are supported but that emerging protocols can be deployed, too.

Internet architecture

The existing Internet architecture is based on the layered protocol stack, where application and transport layer protocols processing occurs on end-systems and physical, link, and network layer processing occurs inside the network. This design has been very successful in limiting the complexity of operations that need to be performed by network routers. In turn, modern routers can support link speeds to tens of Gigabits per second and aggregate bandwidths of Terabits per second.

However, the existing Internet architecture also poses limitations on deploying functionality that does not adhere to the layered protocol stack model. In particular, functionality that crosses protocol layers cannot be accommodated without violating the principles of the Internet architecture. But in practice, many such extensions to existing protocols are necessary.

Type
Chapter
Information
Next-Generation Internet
Architectures and Protocols
 , pp. 179 - 196
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

Tennenhouse, D. L., Wetherall, D. J.Towards an Active Network Architecture. ACM SIGCOMM Computer Communication Review. 1996 Apr;26(2): 5–18.CrossRefGoogle Scholar
Tennenhouse, D. L., Smith, J. M., Sincoskie, W. D., Wetherall, D. J., Minden, G. J.A Survey of Active Network Research. IEEE Communications Magazine. 1997 Jan;35(1):80–86.CrossRefGoogle Scholar
Campbell, A. T., De Meer, H. G., Kounavis, M. E., et al. A Survey of Programmable Networks. ACM SIGCOMM Computer Communication Review. 1999 Apr;29(2):7–23.CrossRefGoogle Scholar
Wolf, T.Design and Performance of Scalable High-Performance Programmable Routers. Department of Computer Science, Washington University. St. Louis, MO; 2002.
Ruf, L., Farkas, K., Hug, H., Plattner, B. Network Services on Service Extensible Routers. In: Proc. of Seventh Annual International Working Conference on Active Networking (IWAN 2005). Sophia Antipolis, France; 2005.
Anderson, T., Peterson, L., Shenker, S., Turner, J.Overcoming the Internet Impasse through Virtualization. Computer. 2005 Apr;38(4):34–41.CrossRefGoogle Scholar
Wolf, T.Challenges and Applications for Network-Processor-Based Programmable Routers. In: Proc. of IEEE Sarnoff Symposium. Princeton, NJ; 2006.
Hadzic, I., Marcus, W. S., Smith, J. M.On-the-fly Programmable Hardware for Networks. In: Proc. of IEEE Globecom 98. Sydney, Australia; 1998.
Taylor, D. E., Turner, J. S., Lockwood, J. W., Horta, E. L.Dynamic Hardware Plugins: Exploiting Reconfigurable Hardware for High-Performance Programmable Routers. Computer Networks. 2002 Feb;38(3):295–310.CrossRefGoogle Scholar
Crowley, P., Fiuczynski, M. E., Baer, J. L., Bershad, B. N.Workloads for Programmable Network Interfaces. In: IEEE Second Annual Workshop on Workload Characterization. Austin, TX; 1999.
Wolf, T., Franklin, M. A.CommBench – A Telecommunications Benchmark for Network Processors. In: Proc. of IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS). Austin, TX; 2000. pp. 154–162.
Wolf, T., Turner, J. S.Design Issues for High-Performance Active Routers. IEEE Journal on Selected Areas of Communication. 2001 Mar;19(3):404–409.CrossRefGoogle Scholar
Dutta, R., Rouskas, G. N., Baldine, I., Bragg, A., Stevenson, D.The SILO Architecture for Services Integration, controL, and Optimization for the Future Internet. In: Proc. of IEEE International Conference on Communications (ICC). Glasgow, Scotland; 2007. pp. 1899–1904.
Baldine, I., Vellala, M., Wang, A., et al. A Unified Software Architecture to Enable Cross-Layer Design in the Future Internet. In: Proc. of Sixteenth IEEE International Conference on Computer Communications and Networks (ICCCN). Honolulu, HI; 2007.
Calvert, K. L., Griffioen, J., Poutievski, L.Separating Routing and Forwarding: A Clean-Slate Network Layer Design. In: Proc. of Fourth International Conference on Broadband Communications, Networks, and Systems (BROADNETS). Raleigh, NC; 2007. pp. 261–270.
McKeown, N., Anderson, T., Balakrishnan, H., et al. OpenFlow: Enabling Innovation in Campus Networks. SIGCOMM Computer Communication Review. 2008 Apr;38(2):69–74.CrossRefGoogle Scholar
Keller, R., Ramamirtham, J., Wolf, T., Plattner, B.Active Pipes: Program Composition for Programmable Networks. In: Proc. of the 2001 IEEE Conference on Military Communications (MILCOM). McLean, VA; 2001. pp. 962–966.
Shanbhag, S., Wolf, T.Implementation of End-to-End Abstractions in a Network Service Architecture. In: Proc. of Fourth Conference on emerging Networking EXperiments and Technologies (CoNEXT). Madrid, Spain; 2008.
Shanbhag, S., Huang, X., Proddatoori, S., Wolf, T.Automated Service Composition in Next-Generation Networks. In: Proc. of the International Workshop on Next Generation Network Architecture (NGNA) held in conjunction with the IEEE 29th International Conference on Distributed Computing Systems (ICDCS). Montreal, Canada; 2009.
Vellala, M., Wang, A., Rouskas, G. N., et al. A Composition Algorithm for the SILO Cross-Layer Optimization Service Architecture. In: Proc. of the Advanced Networks and Telecommunications Systems Conference (ANTS). Mumbai, India; 2007.
Choi, S. Y., Turner, J. S., Wolf, T.Configuring Sessions in Programmable Networks. In: Proc. of the Twentieth IEEE Conference on Computer Communications (INFOCOM). Anchorage, AK; 2001. pp. 60–66.
Huang, X., Ganapathy, S., Wolf, T.A Scalable Distributed Routing Protocol for Networks with Data-Path Services. In: Proc. of 16th IEEE International Conference on Network Protocols (ICNP). Orlando, FL; 2008.
Huang, X., Ganapathy, S., Wolf, T.Evaluating Algorithms for Composable Service Placement in Computer Networks. In: Proc. of IEEE International Conference on Communications (ICC). Dresden, Germany; 2009.
Bellman, R.On a Routing Problem. Quarterly of Applied Mathematics. 1958 Jan;16(1):87–90.CrossRefGoogle Scholar
Wu, Q., Wolf, T.On Runtime Management in Multi-Core Packet Processing Systems. In: Proc. of ACM/IEEE Symposium on Architectures for Networking and Communication Systems (ANCS). San Jose, CA; 2008.
Kohler, E., Morris, R., Chen, B., Jannotti, J., Kaashoek, M. F.The Click Modular Router. ACM Transactions on Computer Systems. 2000 Aug;18(3):263–297.CrossRefGoogle Scholar
Johnson, D. S., Demers, A. J., Ullman, J. D., Garey, M. R., Graham, R. L.Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. SIAM Journal on Computing. 1974 Dec;3(4):299–325.CrossRefGoogle Scholar
Wu, Q., Wolf, T.Runtime Resource Allocation in Multi-Core Packet Processing Systems. In: Proc. of IEEE Workshop on High Performance Switching and Routing (HPSR). Paris, France; 2009.

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
×