Skip to main content

The Protean Programmable Network Architecture: Design and Initial Experience

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1653))

Abstract

This paper presents Protean, a programmable network architecture for future networks. Protean is an event-driven network architecture that allows service providers, applications, and even individual flows to customize the network services, while at the same time providing efficient data paths for flows that use default services. A key feature of Protean is the support for state management. A service that is invoked at one node has the ability to access and update non-local state, and the management of distributed network state is achieved by a core-based self-configuring infrastructure in Protean.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tennenhouse, D.L., Wetherall, D.J.: Towards an Active Network Architecture. Computer Communication Review 26(2) (April 1996)

    Google Scholar 

  2. Smith, J.M., et al.: The Switch Ware Active Network Architecture. IEEE Network Special Issue on Active and Controllable Networks 12(3), 29–36

    Google Scholar 

  3. Sivakumar, R., Venkitaraman, N., Bharghavan, V.: A Scalable Architecture for Active Networks. TIMELY Group Research Report (1999)

    Google Scholar 

  4. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Tech. Rep. 3660, Inst. for Adv. Computer Studies, Dept. of Computer Science. Univ. of Maryland, College Park (June 1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sivakumar, R., Venkitaraman, N., Bharghavan, V. (1999). The Protean Programmable Network Architecture: Design and Initial Experience. In: Covaci, S. (eds) Active Networks. IWAN 1999. Lecture Notes in Computer Science, vol 1653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48507-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48507-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66238-9

  • Online ISBN: 978-3-540-48507-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics