Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Assad, A.A.: Multicommodity Network Flows – a Survey. Networks 8, 37–91 (1978)
Akbar, M.M.: The distributed Utility Model Applied to Optimal Admission Control & QoS Adaptation in Multimedia System and Enterprise Networks, Ph.D. dissertation, Department of Computer Science, University of Victoria (2002)
Borodin, A., El-Yaniv, R.: Online Computation & Competitive Analysis. Cambridge University Press, Cambridge (1998)
Chang, E., Zakhor, A.: Cost Analysis for VBR video servers. IEEE Multimedia, 56–71 (Winter 1996)
Gowland, E.: Performance Evaluation of an Utility Model Based Network Admission Controller, M.A.Sc. thesis, ECE, University of Victoria (2004)
Johnson, D.B.: A Note on Dijkstra’s Shortest Path Algorithm. Journal of ACM (JACM) 20(3), 385–388 (1973)
Klein, P., Plotkin, S.A., Stein, C., Tardos, E.: Fast Approximation Algorithms for the Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. In: Proceeding of the 22nd Annual ACM Symposium on Theory of Computing, pp. 310–321 (1990)
Khan, S., Li, K.F., Manning, E.: The Utility Model for Adaptive Multimedia Systems. In: Proceeding of the International Conference on Multimedia Modeling (MMM 1997), January 1998, pp. 111–126. World Scientific Publishing Ltd., Singapore (1998), ISBN 981 - 02 -3351 - 5
Khan, S., Li, K.F., Manning, E., Watson, R., Shoja, G.C.: Optimal Quality of Service Routing and Admission Control Using the Utility Model. Future Generation Computing systems 19(7), 1063–1073 (2003)
Kolliopoulos, S.G., Stein, C.: Improved Approximation Algorithm for Unsplittable Flow Problems. In: Proceeding of the 38th Annual Symposium on Foundation of Computer Science (FOCS 1997), pp. 426–430 (1997)
Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, E., Tragondas, S.: Fast Approximation Algorithms For Multicommodity Flow Programming. In: Proceeding of the 23rd Annual ACM Symposium on Theory of Computing, pp. 101–111 (1991)
Raghavan, P., Thompson, C.: Randomized Rounding. In Combinatorica 7, 365–374 (1987)
Sahni, S.: Approximate Algorithms for the 0/1 Knapsack Problem. Journal of the ACM (JACM) 22(1), 115–124 (1975)
Trienekens, J.M., Bouman, J., Zwan, M.V.: Specification of Service Level Agreements: Problems, Principles and Practices. Software Quality Control 12(1) (March 2004)
Watson, R.K.: Packet Networks and Optimal Admission and Upgrade of Service Level Agreements: Applying the Utility Model, M.A.Sc. thesis, ECE, University of Victoria (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, L.L., Manning, E.G., Li, K.F. (2005). Heuristic Approaches to Service Level Agreements in Packet Networks. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_101
Download citation
DOI: https://doi.org/10.1007/11600930_101
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)