Heuristic Approaches to Service Level Agreements in Packet Networks

Real-time multimedia applications on the Internet such as video and audio streaming, video conferencing, and online collaborations are expected to become increasingly popular. In order to guarantee effective support of these applications, we must be able to provide Quality of Service (QoS) guarantees such as network bandwidth and end-to-end delay, by incorporating session routing and resource reservation in admission control. In this work, we present the Utility Model, which provides an optimal allocation of resources for admission control while meeting the QoS requirements of admitted users’ sessions. We describe previous heuristics to solve the Utility Model. These heuristics, though, are not suitable for larger networks due to their computation complexity, resulting in real-time decision-making and scalability issues. We are proposing a new concept to solve the Utility Model problem using a modified version of the Multicommodity Flow algorithm. This heuristic has improved computational complexity, and hence is capable of solving the Utility Model problem in lower overall execution time. This implies that admission control, which requires real-time solution of the Model, can be extended to larger networks.

[1]  Fillia Makedon,et al.  Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.

[2]  Kin F. Li,et al.  Optimal Quality of Service routing and admission control using the Utility Model , 2003, Future Gener. Comput. Syst..

[3]  Jos J. M. Trienekens,et al.  Specification of Service Level Agreements: Problems, Principles and Practices , 2004, Software Quality Journal.

[4]  Donald B. Johnson,et al.  A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.

[5]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[6]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[7]  Edward Y. Chang,et al.  Cost Analyses for VBR Video Servers , 1996, IEEE Multim..

[8]  Arjang A. Assad,et al.  Multicommodity network flows - A survey , 1978, Networks.

[9]  Edward Y. Chang,et al.  Cost analysis for VBR video servers , 1996, Electronic Imaging.

[10]  Sartaj Sahni,et al.  Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.

[11]  Md. Mostofa Akbar,et al.  The distributed utility model applied to optimal admission control and qos adaptation in multimedia systems and enterprise networks , 2002 .

[12]  Philip N. Klein,et al.  Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities , 1990, STOC '90.

[13]  Clifford Stein,et al.  Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.