QoS-Based Partitioning and Resource Allocation for Link Models with Variable Service Levels

We consider the problem of QoS-based partitioning of traffic streams for a link model with adjustable service levels. Specifically, we consider a link model with variable service levels which may be mapped to a finite number of MPLS Label- Switched-Paths (LSPs). Our target is to partition a set of traffic streams each with arbitrary local QoS-demand into a small number of classes and find the service level for each class while optimizing the residual-allocated-resources as a result of the traffic partitioning. The residual allocated resources will be measured by the service quantization overhead which is the summation of the differences between the required QoS and the offered service level for all traffic streams. We formulate the partitioning process as a Dynamic Programming problem. We then present two polynomial time algorithms to obtain the QoSbased optimal partition with bandwidth allocation. Our results indicate that using 4 or 5 service levels will accomplish the tradeoff between complexity and granularity irrespective of the distribution of the QoS requirements.

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

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

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Donald F. Towsley,et al.  Approximation Techniques for Computing Packet Loss in Finite-Buffered Voice Multiplexers , 1991, IEEE J. Sel. Areas Commun..

[5]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[6]  Giuseppe Bianchi,et al.  Per-flow QoS support over a stateless Differentiated Services IP domain , 2002, Comput. Networks.

[7]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[8]  Hussein M. Alnuweiri,et al.  Dynamic Programming QoS-based Classification for Links with Limited Service Levels , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[9]  Prasanna Chaporkar,et al.  A network architecture for providing per-flow delay guarantees with scalable core , 2003, J. High Speed Networks.

[10]  Mei Yang,et al.  An End-to-end QoS Framework with On-demand Bandwidth Reconfiguration , 2004, INFOCOM.

[11]  Min Sik Kim,et al.  Optimal partitioning of multicast receivers , 2000, Proceedings 2000 International Conference on Network Protocols.

[12]  Fayez Gebali.  Computer Communication Networks Analysis and Design , 2002 .

[13]  A. Mohamed,et al.  Optimal QoS-based classification for link models with predetermined service levels , 2005, Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005..

[14]  George N. Rouskas,et al.  Optimal granularity of MPLS tunnels , 2003 .