Efficient On-Line Traffic Policing for Confidence Level based Traffic Model
AbstractOn-line traffic, such as conversational call, live video, serves a large group of applications in the internet now days. An important feature of on-line traffic is that they are not pre-recorded and no exact information about each session’s traffic is known before the traffic happens. S-BIND (Confidence-level-based Statistical Bounding Interval-length Dependent) traffic model was proposed to characterize such traffic for QoS admission (GammaH-BIND) and policing purpose. A state-dependent token bucket based statistical regulator was proposed to police the traffic using S-BIND parameters. However, the proposed regulator can output traffic within the expected S-BIND parameters if the input traffic is random or is just trying to transmit large amount of traffic without exploiting the regulator’s token bucket design. In this paper, the author shows that if the source of the traffic understands the bucket’s behavior, it can tune the traffic and cause significant violations in the regulator’s output traffic. A new design of state-dependent token bucket for the regulator is proposed in this paper to remove such potential problem and an optimization algorithm is given to improve the regulator’s efficiency by removing redundant token buckets in the regulator.
(1) Lie Qian, Anard Krishnamurthy, Yuke Wang, Yiyan Tang, P. Dauchy, and Albert Conte, A New Traffic Model and Statistical Admission Control Algorithm for Providing QoS Guarantees to On-Line Traffic. Proceedings of IEEE Global Telecommunications Conference, 2004, GLOBECOM, vol. 3, pp. 1401-1405.
(2) Lie Qian, Yuke Wang, and Hong Shen, Token Bucket Based Statistical Regulator for S-BIND Modeled On-Line Traffic. Proceedings of IEEE International Conference on Communications, 2005, ICC, vol. 1, pp. 125-129.
(3) J. Qiu and E. W. Knightly, Measurement-based admission control with aggregate traffic envelopes, IEEE/ACM Transactions on Networking, vol. 9, no. 2, pp. 199-210, April 2001.
(4) B. Statovci-Halimi, Adaptive admission control for supporting class-based QoS, 2010 6th EURO-NF Conference on Next Generation Internet (NGI), pp. 1-8, 2010.
(5) L. Breslau, E. W. Knightly, S. Shenker, I. Stoica, and H. Zhang, Endpoint admission control: architectural issues and performance, Proc. Of ACM SIGCOMM’00, pp. 57-69, September 2000.
(6) V. Elek, G. Karlsson, and R. Ronngre, Admission control based on end-to-end measurements, Proc. Of IEEE INFOCOM, March 2000.
(7) D. Ferrari and D. C. Verma, A scheme for real-time channel establishment in wide-area networks, IEEE Journal on Selected Areas in Communications, vol. 8, Issue 3, pp. 368-379, April 1990.
(8) E. W. Knightly, H-BIND: a new approach to providing statistical performance guarantees to VBR traffic, Proc. Of IEEE INFOCOM '96, pp. 1091--1099, March 1996.
(9) E. W. Knightly and N. B. Shroff, Admission control for statistical QoS: theory and practice, IEEE Network, vol. 13, Issue 2, pp. 20--29, 1999.
(10) George Kesidis, Jean Walrand and Cheng-Shang Chang, Effective bandwidths for multiclass Markov fluids and other ATM sources, IEEE/ACM Transactions on Networking, vol. 1, pp. 424-428, 1993.
(11) H. A. Harhira, and S. Pierre, A Mathematical Model for the Admission Control Problem in MPLS Networks with End-to-End delay guarantees, Proc. Of 16th International Conference on Computer Communications and Networks, pp. 1193-1197, 2007.
(12) S. Alwakeel, and A. Prasetijo, Probability admission control in class-based Video-on-Demand system, 2011 International Conference on Multimedia Computing and Systems (ICMCS), pp. 1-6, 2011.
(13) S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, An architecture for differential services, IETF, RFC 2475, December 1998.
(14) Z.-L. Zhang, Z. Duan, L. Gao, and Y. Hou, Decoupling QoS control from core routers: a novel bandwidth broker architecture for scalable support of guaranteed services, ACM SIGCOMM Computer
Communication Review, vol. 30, Issue 4, 2000.
(15) A. Terzis, L. Wang, J. Ogawa, and L. Zhang, A two tier resource management model for the Internet, Proc. Of GLOBECOM '99, vol. 3 , pp. 1779 -1791, 1999.
(16) E. W. Knightly and H. Zhang, D-BIND: an accurate traffic model for providing QoS guarantees to VBR traffic, IEEE ACM Transactions on Networking, vol. 5, Issue 2, pp. 219-231, April 1997.
(17) H. P. Stern, S. A. Mahmoud, and K. K. Wong, A comprehensive model for voice activity in conversational speech-development and application to performance analysis of new-generation wireless communications system, Wireless Networks, vol. 2, no. 4, pp. 359-367, December 1996.
(18) F. Beritelli, A. Lombardo, S. Palazzo, and G. Schembra, Performance analysis of an ATM multiplexer loaded with VBR traffic generated by multimode speech coders, IEEE Journal on Selected Areas in Communications, vol. 17, no. 1, pp. 63-81, January 1999.
(19) P. R. Jelenkovic, A. A. Lazar, and N. Semret, The effect of multiple time scales and subexponentiality in MPEG video streams on queueing behavior, IEEE Journal on Selected Areas in Communications, vol. 15, no. 6, pp. 1052-1071, August 1997.
(20) A. Lombardo, G. Morabito, and G. Schembra, An accurate and treatable markov model of MPEG-video traffic, IEEE INFOCOM, pp. 217-224, March 1998.
(21) R. Cruz, A calculus for network delay, part I: Network elements in isolation, IEEE Transactions on Information Theory, vol. 37, Issue 1, pp. 114-121, January 1991.
(22) S. Chong and S. Li, Probabilistic burstiness-curve-based connection control for real-time multimedia services in ATM networks, IEEE Journal on Selected Areas in Communications, vol. 15, no. 6, pp. 1072-1086, August 1997.
(23) J. Kurose, On computing per-session performance bounds in high-speed multi-hop computer networks, ACM Sigmetrics’92, vol. 20, Issue 1, 1992.
(24) H. Zhang and E. Knightly, Providing end-to-end statistical performance guarantees with interval dependent stochastic models, ACM Sigmetrics’94, vol. 22, Issue 1, 1994.
(25) E. P. Rathgeb, Modeling and performance comparison of policing mechanisms for ATM networks, IEEE Journal on Selected Areas in Communications, vol. 9, Issue 3, pp. 325-334, April 1991.
(26) J. Turner, New directions in communications (or which way to the information age), IEEE Communication Magazine, vol. 24, Issue 10, pp. 8-15, October 1986.
(27) M. Salamah and H. Lababidi, BLLB: a novel traffic policing mechanism for ATM networks, 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 411-415, August 2000.
(28) M. Salamah and H. Lababidi, FBLLB: a fuzzy-based traffic policing mechanism for ATM networks, ACS/IEEE International Conference on Computer Systems and Applications, pp. 31-35, June 2001.
Authors wishing to include figures, tables, or text passages that have already been published elsewhere are required to obtain permission from the copyright owner(s) for both the print and online format and to include evidence that such permission has been granted when submitting their papers. Any material received without such evidence will be assumed to originate from the authors.
All authors of manuscripts accepted for publication in the journal Transactions on Networks and Communications are required to license the Scholar Publishing to publish the manuscript. Each author should sign one of the following forms, as appropriate:
License to publish; to be used by most authors. This grants the publisher a license of copyright. Download forms (MS Word formats) - (doc)
Publication agreement — Crown copyright; to be used by authors who are public servants in a Commonwealth country, such as Canada, U.K., Australia. Download forms (Adobe or MS Word formats) - (doc)
License to publish — U.S. official; to be used by authors who are officials of the U.S. government. Download forms (Adobe or MS Word formats) – (doc)
The preferred method to submit a completed, signed copyright form is to upload it within the task assigned to you in the Manuscript submission system, after the submission of your manuscript. Alternatively, you can submit it by email firstname.lastname@example.org