Admission control schemes for bursty multimedia traffic
Paper
Paper/Presentation Title | Admission control schemes for bursty multimedia traffic |
---|---|
Presentation Type | Paper |
Authors | Lee, Teck Kiong (Author), Zukerman, Moshe (Author) and Addie, Ronald G. (Author) |
Editors | Cruz, R. and Pacifici, G. |
Journal or Proceedings Title | Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001) |
Journal Citation | 1, pp. 478-487 |
Number of Pages | 10 |
Year | 2001 |
Place of Publication | Piscataway, NJ. United States |
ISBN | 0780370163 |
Digital Object Identifier (DOI) | https://doi.org/10.1109/INFCOM.2001.916739 |
Web Address (URL) of Paper | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=916739 |
Conference/Event | 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001) |
Event Details | 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001) Event Date 22 to end of 26 Apr 2001 Event Location Anchorage, United States |
Abstract | We introduce a new framework for various Measurement-based Connection Admission Control (MBCAC) schemes for a multiservice network. Then, using heterogeneous bursty multimedia traffic traces, efficiency and simplicity tradeoffs are obtained by simulations. For all our MBCAC schemes, we use a procedure of 'Available bandwidth' evaluation based on online measurements and an adaptive feedback mechanism. The online measurement concept is based on the use of different 'Traffic histograms' that maintain records of the aggregated traffic in a link over a range of time-scales. The most complex MBCAC scheme involves measuring and then storing of all traffic information for every connection, the use of a 'Warming up period' technique, and updating the histograms when a connection departs. However, for the other simpler MBCAC schemes, various aspects of the most complex scheme are eliminated or simplified. We also consider two model-based CAC schemes, i.e., Gaussian and Effective Bandwidth, where a priori statistical knowledge of the connections are known in advance. Given that the traffic is known beforehand, the performance of such schemes will be better than if the statistics are not exactly known. A comparison between such model-based CAC schemes with our MBCAC schemes provides a benchmark that gives the best efficiency and QoS a model-based CAC may achieve. Simulation results demonstrate that while the best efficiency achievable by the model-based gives efficiency of 80%, the most complex MBCAC schemes achieved 81% efficiency, and the simplest MBCAC schemes obtained 76% value. |
Keywords | bandwidth; computer simulation; congestion control (communication); mathematical models; multimedia systems; quality of service; statistical methods; telecommunication traffic |
ANZSRC Field of Research 2020 | 490510. Stochastic analysis and modelling |
490302. Numerical analysis | |
400604. Network engineering | |
Public Notes | © 2001 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
Byline Affiliations | University of Melbourne |
Department of Mathematics and Computing | |
Institution of Origin | University of Southern Queensland |
https://research.usq.edu.au/item/q0485/admission-control-schemes-for-bursty-multimedia-traffic
Download files
1716
total views1297
total downloads2
views this month1
downloads this month