On the advantages of optimal end-to-end QoS budget partitioning

Abstract We investigate the optimal partitioning of the end-to-end network QoS budget to quantify the advantage of having a non-uniform allocation of the budget over the links in a path. We formulate an optimization problem that provides a unified framework to study QoS budget allocation. We examine the underlying mathematical structure for the optimal partitioning and dimensioning equations. In the context of network dimensioning, we then show that optimal partitioning can bring large cost reductions as compared with equal partitioning based on the results on small networks. More importantly, we also find that optimal partitioning gives significant improvements in robustness in the presence of failed components and in fairness when the traffic demand is different from the forecast, two effects that had not been observed in previous work and that can have a significant effect on network operations.

[1]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, IEEE/ACM Trans. Netw..

[2]  Anurag Kumar,et al.  Optimal per-node rate allocation to provide per-flow end-to-end delay guarantees in a network of routers supporting guaranteed service class , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[3]  Fotios C. Harmantzis,et al.  Effective bandwidths and tail probabilities for Gaussian and stable self-similar traffic , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[4]  André Girard,et al.  Revenue optimization of B-ISDN networks , 1995, IEEE Trans. Commun..

[5]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[6]  Ward Whitt,et al.  Tail probabilities with statistical multiplexing and effective bandwidths in multi-class queues , 1993, Telecommun. Syst..

[7]  Cheng-Shang Chang,et al.  Performance guarantees in communication networks , 2000, Eur. Trans. Telecommun..

[8]  Nikolas Mitrou,et al.  Effective bandwidths for a class of non Markovian fluid sources , 1997, SIGCOMM '97.

[9]  Donald F. Towsley,et al.  Call admission and resource reservation for multicast sessions , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[10]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[11]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[12]  Alberto Leon-Garcia,et al.  Call admission and resource reservation for guaranteed quality of service (GQoS) services in internet , 1998, Comput. Commun..

[13]  Donald F. Towsley,et al.  Local Allocation of End-to-End Quality-of-Service in High-Speed Networks , 1993, Modelling and Evaluation of ATM Networks.

[14]  Ariel Orda,et al.  A scalable approach to the partition of QoS requirements in unicast and multicast , 2002, IEEE/ACM Transactions on Networking.

[15]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[16]  François Théberge,et al.  Providing QoS in Large Networks: Statistical Multiplexing and Admission Control , 2005 .

[17]  Ariel Orda,et al.  Optimal partition of QoS requirements on unicast paths and multicast trees , 2002, TNET.

[18]  Sally Floyd,et al.  Dynamics of TCP Traffic over ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[19]  Jean C. Walrand,et al.  Effective bandwidths: Call admission, traffic policing and filtering for ATM networks , 1995, Queueing Syst. Theory Appl..

[20]  Tzi-cker Chiueh,et al.  Delay budget partitioning to maximize network resource usage efficiency , 2004, IEEE INFOCOM 2004.

[21]  P. P. White,et al.  RSVP and integrated services in the Internet: a tutorial , 1997, IEEE Commun. Mag..

[22]  Ariel Orda,et al.  Efficient QoS partition and routing of unicast and multicast , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[23]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[24]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[25]  John Evans,et al.  Engineering a multiservice IP backbone to support tight SLAs , 2002, Comput. Networks.

[26]  Roland P. Malhamé,et al.  Analysis, Control and Optimization of Complex Dynamic Systems , 2005 .

[27]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[28]  Frank P. Kelly,et al.  Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..

[29]  Edward W. Knightly,et al.  Buffering vs. smoothing for end-to-end QoS: fundamental issues and comparison , 2000 .

[30]  Ariel Orda,et al.  Optimal partition of QoS requirements for many-to-many connections , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[31]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[32]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[33]  David E. McDysan,et al.  ATM: Theory and Application , 1994 .

[34]  André Girard,et al.  A fast numerical algorithm for multi‐rate network synthesis , 1998, Telecommun. Syst..

[35]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[36]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[37]  Khaled M. F. Elsayed,et al.  A framework for end-to-end deterministic-delay service provisioning in multiservice packet networks , 2005, IEEE Transactions on Multimedia.

[38]  Brunilde Sansò,et al.  Telecommunications Network Planning , 1998 .

[39]  André Girard,et al.  The Common Structure of Packet - and Circuit-Switched Network Synthesis , 1999 .

[40]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[41]  André Girard,et al.  Revenue optimization of telecommunication networks , 1993, IEEE Trans. Commun..

[42]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[43]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

[44]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[45]  Henning Schulzrinne,et al.  The IETF Internet telephony architecture and protocols , 1999, IEEE Netw..

[46]  F. Kelly,et al.  Stochastic networks : theory and applications , 1996 .

[47]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[48]  Frank Yeong-Sung Lin.  Allocation of end-to-end delay objectives for networks supporting SMDS , 1993 .