An architecture for noncooperative QoS provision in many-switch systems

With the proliferation of high-speed networks and networked services, provisioning differentiated services to a diverse user base with heterogeneous QoS requirements has become an important problem. The traditional approach of resource reservation and admission control provides both guarantees and graded services, however, at the cost of potentially underutilized resources and limited scalability. We describe a WAN QoS provision architecture that adaptively organizes best-effort bandwidth into stratified services with graded QoS properties such that the QoS needs of a diverse user base can be effectively met. This architecture-SBS (stratified best-effort service)-promotes a simple user/simple network realization where neither the user nor the network is burdened with complex computational responsibilities. SBS is scalable, efficient, and adaptive, and it complements the guaranteed service architecture, sharing a common network substrate comprised of GPS routers. It is also a functional complement, provisioning QoS efficiently commensurate with user needs, albeit at the cost of weaker protection. SBS is suited to noncooperative network environments where users behave selfishly and resource contention resolution is mediated by the principle of competitive interaction. A principal feature of SBS is the transformation of user-centric QoS provision mechanisms-a defining characteristic of competitive interaction entailing intimate user control of internal network resources-into network-centric mechanisms while preserving the former's resource allocation paradigm. End-to-end QoS control is facilitated by decentralized control based on Lagrangian optimization-achieve a target end-to-end QoS at minimum cost or resource usage-which, in turn, is amenable to distributed implementation. SBS achieves per-flow QoS control with zero per-flow state at routers and a packet header whose size is independent of hop count. SBS, in spite of foregoing both resource reservation and admission control, is able to provision stable, graded QoS.

[1]  Harvey J. Everett Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[2]  Donald F. Ferguson,et al.  Microeconomic algorithms for load balancing in distributed computer systems , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[3]  Rahul Simha,et al.  A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems , 1989, IEEE Trans. Computers.

[4]  Donald F. Ferguson,et al.  An economy for flow control in computer networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[6]  Tad Hogg,et al.  Spawn: A Distributed Computational Economy , 1992, IEEE Trans. Software Eng..

[7]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[8]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[9]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[10]  Deborah Estrin,et al.  Pricing in computer networks: motivation, formulation, and example , 1993, TNET.

[11]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[12]  Pravin Varaiya,et al.  An algorithm for optimal service provisioning using resource pricing , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[13]  Pravin Varaiya,et al.  Correction to "A new approach to service provisioning in ATM networks" , 1993, TNET.

[14]  S. Shenker Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1994, SIGCOMM.

[15]  Donald F. Ferguson,et al.  An approach to pricing, optimal allocation and quality of service provisioning in high-speed packet networks , 1995, Proceedings of INFOCOM'95.

[16]  Jeffrey K. MacKie-Mason,et al.  Economic FAQs About the Internet , 1994 .

[17]  Debasis Mitra,et al.  Analysis, approximations and admission control of a multi-service multiplexing system with priorities , 1995, Proceedings of INFOCOM'95.

[18]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[19]  Aurel A. Lazar,et al.  On the existence of equilibria in noncooperative optimal flow control , 1995, JACM.

[20]  Scott Shenker,et al.  Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1995, TNET.

[21]  Kihong Park,et al.  On the relationship between file sizes, transport protocols, and self-similar network traffic , 1996, Proceedings of 1996 International Conference on Network Protocols (ICNP-96).

[22]  Kihong Park,et al.  Ordering properties of GPS routers for multiclass QoS provision , 1998, Other Conferences.

[23]  Meera Sitharam,et al.  On the ordering properties of GPS routers for multi-class QoS provision , 1998 .

[24]  Kihong Park,et al.  A distributed protocol for multi-class QoS provision in noncooperative many-switch systems , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

[25]  David D. Clark,et al.  Explicit allocation of best-effort packet delivery service , 1998, TNET.

[26]  Kihong Park,et al.  Quality of service provision in noncooperative networks: heterogenous preferences, multi-dimensional QoS vectors, and burstiness , 1998, ICE '98.

[27]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.