Providing Strict QoS Guaranties for Flows with Time-varying Capacity Requirements

Many distributed applications require bandwidth provisioning to implement their functionality. A prominent example is a remote real-time monitoring service in e-health system, where a special type of emergency requests require strict guaranties regarding provided transmission rates. We consider the problem of network capacity sharing between two types of flows: standard best-effort flows and QoS-constrained flows. We derive distributed control algorithms for dynamic capacity allocation allowing to serve the QoS-constrained flows by preempting the best-effort flows. Such solution minimizes the amount of unused capacity. We also present how to estimate the capacity needed to deploy QoS-based application in a way to minimize the number of flow preemptions. The presented solution is evaluated in a simulation environment.

[1]  Dariusz Gasior,et al.  QoS rate allocation in computer networks under uncertainty , 2008, Kybernetes.

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

[3]  Thomas Voice,et al.  Stability of end-to-end algorithms for joint routing and rate control , 2005, CCRV.

[4]  Piet Van Mieghem,et al.  Performance analysis of communications networks and systems , 2006 .

[5]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

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

[7]  G. Grimmett,et al.  Probability and random processes , 2002 .

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

[9]  Raouf Boutaba,et al.  A survey of network virtualization , 2010, Comput. Networks.

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

[11]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[12]  Piotr Rygielski,et al.  Dynamic Resources Allocation for Delivery of Personalized Services , 2010, I3E.

[13]  Daniel Pérez Palomar,et al.  A tutorial on decomposition methods for network utility maximization , 2006, IEEE Journal on Selected Areas in Communications.

[14]  Pawel Swiatek,et al.  PARALLEL PROCESSING OF CONNECTION STREAMS IN NODES OF PACKET-SWITCHED COMPUTER COMMUNICATION SYSTEMS , 2008, Cybern. Syst..