Beyond best effort: router architectures for the differentiated services of tomorrow's Internet

With the transformation of the Internet into a commercial infrastructure, the ability to provide differentiated services to users with widely varying requirements is rapidly becoming as important as meeting the massive increases in bandwidth demand. Hence, while deploying routers, switches, and transmission systems of ever increasing capacity, Internet service providers would also like to provide customer-specific differentiated services using the same shared network infrastructure. We describe router architectures that can support the two trends of rising bandwidth demand and rising demand for differentiated services. We focus on router mechanisms that can support differentiated services at a level not contemplated in proposals currently under consideration due to concern regarding their implementability at high speeds. We consider the types of differentiated services that service providers may want to offer and then discuss the mechanisms needed in routers to support them. We describe plausible implementations of these mechanisms (the scalability and performance of which have been demonstrated by implementation in a prototype system) and argue that it is technologically possible to considerably raise the level of differentiated services which service providers can offer their customers, and that it is not necessary to restrict differentiated services to rudimentary offerings even in very-high-speed networks.

[1]  Svante Carlsson,et al.  Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.

[2]  Bernard Chazelle,et al.  How to Search in History , 1983, Inf. Control..

[3]  VargheseGeorge,et al.  Scalable high speed IP routing lookups , 1997 .

[4]  Raj Jain,et al.  Packet Trains-Measurements and a New Model for Computer Network Traffic , 1986, IEEE J. Sel. Areas Commun..

[5]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[6]  Anujan Varma.  A General Methodology for Designing Eecient Traac Scheduling and Shaping Algorithms , 1997 .

[7]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[8]  J. Boyle,et al.  Rsvp extensions for cidr aggregated data flows , 1997 .

[9]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 1993, IEEE Communications Magazine.

[10]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[11]  Bernard Chazelle,et al.  Point Location Among Hyperplanes and Unidirectional Ray-shooting , 1994, Comput. Geom..

[12]  Kimberly Claffy,et al.  Internet traffic characterization , 1994 .

[13]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

[14]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

[15]  T. V. Lakshman,et al.  Window-based error recovery and flow control with a slow acknowledgement channel: a study of TCP/IP performance , 1997, Proceedings of INFOCOM '97.

[16]  Mark de Berg,et al.  Two- and Three-Dimensional Point Location in Rectangular Subdivisions , 1995, J. Algorithms.

[17]  V. Jacobson,et al.  Protocol Independent Multicast (PIM), Sparse Mode Protocol Specification , 1994 .

[18]  T. V. Lakshman,et al.  Design considerations for supporting TCP with per-flow queueing , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[19]  Kenneth L. Clarkson,et al.  New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

[20]  Anujan Varma,et al.  Design and analysis of frame-based fair queueing: a new traffic scheduling algorithm for packet-switched networks , 1996, SIGMETRICS '96.

[21]  Peter van Emde Boas,et al.  Preserving order in a forest in less than logarithmic time , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[22]  D. C. Feldmeier,et al.  Improving gateway performance with a routing-table cache , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[23]  Henry Hong-Yi Tzeng.  Longest Prefix Search Using Compressed Trees , 1998 .

[24]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.

[25]  Scott Shenker,et al.  Some observations on the dynamics of a congestion control algorithm , 1990, CCRV.

[26]  Matthew Mathis,et al.  The stationary behavior of ideal TCP congestion avoidance , 1996 .

[27]  T. V. Lakshman,et al.  The drop from front strategy in TCP and in TCP over ATM , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[28]  Mark H. Overmars,et al.  Range Searching and Point Location among Fat Objects , 1996, J. Algorithms.

[29]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[30]  Greg Minshall,et al.  Flow labelled IP: a connectionless approach to ATM , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[31]  T. V. Lakshman,et al.  Efficient Active Queue Management for Internet Routers , 1997 .

[32]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[33]  Kathleen Nichols,et al.  Differentiated Services Operational Model and Definitions , 1998 .

[34]  T. V. Lakshman,et al.  Parallel architectures for processing high speed network signaling protocols , 1995, TNET.

[35]  T. V. Lakshman,et al.  The performance of TCP/IP for networks with high bandwidth-delay products and random loss , 1997, TNET.

[36]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

[37]  Anujan Varma,et al.  Providing bandwidth guarantees in an input-buffered crossbar switch , 1995, Proceedings of INFOCOM'95.

[38]  Anujan Varma,et al.  A general methodology for designing efficient traffic scheduling and shaping algorithms , 1997, Proceedings of INFOCOM '97.

[39]  Yakov Rekhter,et al.  A Provider Architecture for Differentiated Services and Traffic Engineering (PASTE) , 1998, RFC.

[40]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[41]  H. V. Jagadish,et al.  Towards a Gigabit IP Router , 1992, J. High Speed Networks.

[42]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[43]  Fouad A. Tobagi,et al.  Fast packet switch architectures for broadband integrated services digital networks , 1990, Proc. IEEE.

[44]  D. Stiliadis,et al.  Rate-proportional servers: a design methodology for fair queueing algorithms , 1998, TNET.

[45]  Lixia Zhang,et al.  A new architecture for packet switching network protocols , 1989 .

[46]  F. M. Chiussi,et al.  Low-cost scalable switching solutions for broadband networking: the ATLANTA architecture and chipset , 1997 .

[47]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[48]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[49]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[50]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[51]  George C. Polyzos,et al.  Application of sampling methodologies to network traffic characterization , 1993, SIGCOMM '93.

[52]  Günter Karjoth,et al.  Routing on longest-matching prefixes , 1996, TNET.

[53]  Thomas E. Anderson,et al.  High speed switch scheduling for local area networks , 1992, ASPLOS V.

[54]  David Clark,et al.  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism , 1992, SIGCOMM.

[55]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.