article

Admission control of multi-class traffic with service priorities in high-speed networks

Authors:

V. G. Kulkarni and

N. GautamAuthors Info & Claims

Queueing Systems: Theory and Applications, Volume 27, Issue 1/2

Pages 79 - 97

https://doi.org/10.1023/A:1019153812927

Published: 14 December 1997 Publication History

Abstract

We consider a fluid model of a system that handles multiple classes of traffic. The delay and cell-loss requirements of the different classes of traffic are generally widely different and are achieved by assigning different buffers for different classes, and serving them in a strict priority order. We use results from the effective bandwidth of the output processes (see Chang and Thomas (1995)) to derive simple and asymptotically exact call-admission policies for such a system to guarantee the cell-loss requirements for the different classes assuming that each source produces a single class traffic. We compare the admission-control policies developed here with the approximate policy studied by Elwalid and Mitra (1995) for the case of two-class traffic.

References

[1]

{1} C.S. Chang and J.A. Thomas, Effective bandwidth in high-speed digital networks, IEEE Journal on Selected Areas in Communications 13(6) (1995) 1091-1100.

Digital Library

[2]

{2} C.S. Chang and T. Zajic, Effective bandwidths of departure processes from queues with time varying capacities, in: INFOCOM '95 (1995) pp. 1001-1009.

Digital Library

[3]

{3} G.L. Choudhury, D.M. Lucantoni and W. Whitt, On the effectiveness of effective bandwidths for admission control in ATM networks, in: Proceedings of ITC-14 (Elsevier Science, B.V., 1994) pp. 411-420.

[4]

{4} I. Çidon, R. Guérin and A. Khamisy, On protective buffer policies, Technical Report RC 18113, IBM Research Division (1992).

[5]

{5} I. Çidon, L. Georgiadis, R. Guérin and A. Khamisy, Optimal buffer sharing, IEEE Journal on Selected Areas in Communications 13(7) (1995) 1229-1240.

Digital Library

[6]

{6} G. de Veciana, C. Courcoubetis and J. Walrand, Decoupling bandwidths for networks: A decomposition approach to resource management, in: INFOCOM '94 (1994) pp. 466-473.

[7]

{7} A.I. Elwalid and D. Mitra, Fluid models for the analysis and design of statistical multiplexing with loss priorities on multiple classes of bursty traffic, IEEE Trans. Communications 42(11) (1992) 2989-3002.

[8]

{8} A.I. Elwalid and D. Mitra, Effective bandwidth of general Markovian traffic sources and admission control of high-speed networks, IEEE/ACM Trans. on Networking 1(3) (1993) 329-343.

Digital Library

[9]

{9} A.I. Elwalid and D. Mitra, Analysis, approximations and admission control of a multi-service multiplexing system with priorities, in: INFOCOM '95 (1995) pp. 463-472.

Digital Library

[10]

{10} A.I. Elwalid, D. Heyman, T.V. Lakshman, D. Mitra and A. Weiss, Fundamental bounds and approximations for ATM multiplexers with applications to video teleconferencing, IEEE Journal on Selected Areas in Communications 13(6) (1995) 1004-1016.

Digital Library

[11]

{11} R.J. Gibbens and P.J. Hunt, Effective bandwidths for the multi-type UAS channel, Queueing Systems 9 (1991) 17-28.

Digital Library

[12]

{12} G. Kesidis, J. Walrand and C.S. Chang, Effective bandwidths for multiclass Markov fluids and other ATM sources, IEEE/ACM Trans. on Networking 1(4) (1993) 424-428.

Digital Library

[13]

{13} V.G. Kulkarni, Effective bandwidths for Markov regenerative sources, Queueing Systems 24 (1996) 137-154.

[14]

{14} V.G. Kulkarni and T. Rolski, Fluid model driven by an Ornstein- Ühlenbeck Process, Probab. Engrg. Inform. Sci. 8 (1994) 403-417.

[15]

{15} V.G. Kulkarni, L. Gün and P.F. Chimento, Effective bandwidth vectors for multiclass traffic multiplexed in a partitioned buffer, IEEE Journal on Selected Areas in Communications 13(6) (1995) 1039-1047.

Digital Library

[16]

{16} A.Y.-M. Lin and J.A. Silvester, Priority queueing strategies and buffer allocation protocols for traffic control at an ATM integrated broadband switching system, IEEE Journal on Selected Areas in Communications 9(9) (1991) 1524-1536.

[17]

{17} A. Narayanan and V.G. Kulkarni, First passage times in fluid models with an application to two-priority fluid systems, in: Proceedings of IPDS '96 (1996).

Digital Library

[18]

{18} W. Whitt, Tail probabilities with statistical multiplexing and effective bandwidths for multiclass queues, Telecommun. Syst. 2 (1993) 71-107.

Digital Library

[19]

{19} J. Zhang, Performance study of Markov-modulated fluid flow models with priority traffic, in: INFOCOM '93 (1993) pp. 10-17.

[20]

{20} Z.L. Zhang, D. Towsley and J. Kurose, Statistical analysis of generalized processor sharing scheduling discipline, IEEE Journal on Selected Areas in Communications 13(6) (1995) 1071-80.

Digital Library

[21]

{21} Z.L. Zhang, D. Towsley and J. Kurose, Call admission control scheme under the generalized processor sharing scheduling discipline, Technical Report UM-CS-95-10, University of Massachusetts (1995).

Cited By

Polansky RSethuraman SGautam N(2015)Obtaining Optimal Thresholds for Processors with Speed-ScalingElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2014.12.016310:C(135-155)Online publication date: 5-Jan-2015
https://dl.acm.org/doi/10.1016/j.entcs.2014.12.016
Gautam NKulkarni V(2000)Applications of SMP Bounds to Multi-class Traffic in High-speed NetworksQueueing Systems: Theory and Applications10.1023/A:101108940369436:4(351-379)Online publication date: 1-Dec-2000
https://dl.acm.org/doi/10.1023/A%3A1011089403694
Majewski K(1999)Chernoff bounds for mean overflow ratesQueueing Systems: Theory and Applications10.1023/A:101916942238134:1/4(301-326)Online publication date: 14-Jun-1999
https://dl.acm.org/doi/10.1023/A%3A1019169422381
Show More Cited By

Recommendations

Applications of SMP Bounds to Multi-class Traffic in High-speed Networks

In this paper, we consider the stochastic fluid-flow model of a single node in a high-speed telecommunication network handling multi-class traffic. The node has multiple buffers, one for each class of traffic. The contents of these buffers are ...
Read More
Performability of an Algorithm for Connection Admission Control

Connection admission control (CAC) in broadband, ATM-based telecommunication networks is a problem of recognized importance. Its solution calls for real-time algorithms that can accurately decide whether a connection request may be granted without ...
Read More
A unified bandwidth reservation and admission control mechanism for QoS provisioning in cellular networks: Research Articles
Performance Evaluation of Wireless Networks

We propose a unified framework consisting of a differential bandwidth reservation (DBR) algorithm and a Quality of Service (QoS)-aware admission control scheme to provide QoS guarantees to on-going connections in cellular networks. The differential ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Queueing Systems: Theory and Applications

Queueing Systems: Theory and Applications Volume 27, Issue 1/2

1997

199 pages

ISSN:0257-0130

Issue’s Table of Contents

Copyright © Copyright © 1997 Kluwer Academic Publishers.

Publisher

J. C. Baltzer AG, Science Publishers

United States

Publication History

Published: 14 December 1997

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Polansky RSethuraman SGautam N(2015)Obtaining Optimal Thresholds for Processors with Speed-ScalingElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2014.12.016310:C(135-155)Online publication date: 5-Jan-2015
https://dl.acm.org/doi/10.1016/j.entcs.2014.12.016
Gautam NKulkarni V(2000)Applications of SMP Bounds to Multi-class Traffic in High-speed NetworksQueueing Systems: Theory and Applications10.1023/A:101108940369436:4(351-379)Online publication date: 1-Dec-2000
https://dl.acm.org/doi/10.1023/A%3A1011089403694
Majewski K(1999)Chernoff bounds for mean overflow ratesQueueing Systems: Theory and Applications10.1023/A:101916942238134:1/4(301-326)Online publication date: 14-Jun-1999
https://dl.acm.org/doi/10.1023/A%3A1019169422381
Gautam NKulkarni VPalmowski ZRolski T(1999)BOUNDS FOR FLUID MODELS DRIVEN BY SEMI-MARKOV INPUTSProbability in the Engineering and Informational Sciences10.1017/S026996489913403X13:4(429-475)Online publication date: 1-Oct-1999
https://dl.acm.org/doi/10.1017/S026996489913403X
Berger AWhitt W(1998)Effective bandwidths with prioritiesIEEE/ACM Transactions on Networking10.1109/90.7208876:4(447-460)Online publication date: 1-Aug-1998
https://dl.acm.org/doi/10.1109/90.720887

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents