Optimal network rate allocation under end-to-end quality-of-service requirements

We address the problem of allocating transmission rates to a set of network sessions with end-to-end bandwidth and delay requirements. We give a unified convex programming formulation that captures both average and probabilistic delay requirements. Moreover, we present a distributed algorithm and establish its convergence to the global optimum of the overall rate allocation problem. In our algorithm, session sources selfishly update their rates as to maximize their individual benefit (utility minus bandwidth cost), the network partitions end-to-end delay requirements into local per-link delays, and the links adjust their prices to coordinate the sources' and network's decisions, respectively. This algorithm relies on a network utility maximization (NUM) approach, and can be viewed as a generalization of TCP and active queue management (AQM) algorithms to handle end-to-end QoS. We extend our results to deterministic delay requirements when nodes employ Packet-level Generalized Processor Sharing (PGPS) schedulers.

[1]  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).

[2]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

[3]  Leandros Tassiulas,et al.  Fair distributed congestion control in multirate multicast networks , 2005, IEEE/ACM Transactions on Networking.

[4]  G. Anandalingam,et al.  Optimal pricing for multiple services in telecommunications networks offering quality-of-service guarantees , 2003, TNET.

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

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

[7]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[8]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[9]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[10]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[11]  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.

[12]  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.

[13]  S. Low,et al.  Understanding Vegas: a duality model , 2002 .

[14]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[15]  Steven H. Low,et al.  Understanding TCP Vegas: a duality model , 2002 .

[16]  Khaled M. F. Elsayed,et al.  Performance evaluation of resource reservation and call admission policies for deterministic services in PGPS-based packet networks , 2002, Comput. Commun..

[17]  Leonidas Georgiadis,et al.  Algorithms for precomputing constrained widest paths and multicast trees , 2005, IEEE/ACM Transactions on Networking.

[18]  Steven H. Low,et al.  REM: active queue management , 2001, IEEE Netw..

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

[20]  Piet Van Mieghem,et al.  Conditions that impact the complexity of QoS routing , 2005, IEEE/ACM Transactions on Networking.

[21]  Nan Jin,et al.  Dynamic congestion-based pricing of bandwidth and buffer , 2005, IEEE/ACM Transactions on Networking.

[22]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[23]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM.

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

[25]  Tim Roughgarden,et al.  Routers with Very Small Buffers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[27]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[28]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[29]  Kumar N. Sivarajan,et al.  Routing and rate allocation to provide end-to-end delay guarantees under PGPS scheduling , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[30]  Harrick M. Vin,et al.  Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.

[31]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

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

[33]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.