Abstract
Virtual paths (VPs) are an integral part of the resource management and control hierarchy of ATM (asynchronous transfer mode) networks. To improve the utilization of network resources and facilitate management and control, source types are organized into traffic classes. Each traffic class is transported by its own virtual path subnetwork. In this paper, we consider issues related to the design of traffic classes. We consider an ATM switch node to which cells arrive from a diverse set of source types. Traffic classes are assumed to be served according to a weighted round robin policy, while cells belonging to a given traffic class are served in first-come-first-served order. We consider the problem of determining the optimal set of traffic classes. Under suitable simplifying assumptions, it is shown that the above problem can be modeled as a set-partitioning problem. The structure of the problem at hand is then exploited to develop an efficient heuristic. Several examples are given to illustrate the developed methodology.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
J.J. Bae, T. Suda and R. Simha, Analysis of a finite buffer queue with heterogeneous Markov modulated arrival process: A study of the effects of traffic burstiness on individual packet loss, in:Proc. IEEE INFOCOM (1992) pp. 219–230.
M.L. Fisher and P. Kedia, Optimal solution set covering/partitioning problems with dual heuristics, Manag. Sci. 36(1988)674–688.
D.P. Gaver, P.A. Jacobs and G. Latouche, Finite birth and death models in randomly changing environments, Adv. Appl. Prob. 14(1984)715–731.
R. Guerin, H. Ahmadi and M. Naghshineh, Equivalent capacity and its application to bandwidth allocation in high-speed networks, IEEE J. Select. Areas Commun. 9(1991)968–981.
S. Gupta, Performance modeling and management of high-speed networks, Ph.D. Thesis, University of Pennsylvania, Philadelphia (1993).
J.Y. Hui, M.B. Gursoy, N. Moayeri and R.D. Yates, A layered broadband switching architecture with physical or virtual path networks, IEEE J. Select. Areas Commun. 9(1991)1416–1426.
J.M. Hyman, A.A. Lazar and G. Pacifici, Real-time scheduling with quality of service constraints, IEEE J. Select. Areas Commun. 9(1991)1052–1063.
A.K. Jain and R.C. Dubes,Algorithms for Clustering Data (Prentice-Hall, Engelwood Cliffs, NJ, 1984).
M. Minoux, A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations, RAIRO Oper. Res. 21(1988)105–134.
J.A.S. Monterio, M. Gerla and L. Fratta, Statistical multiplexing in ATM networks, Perform. Eval. 12(1991)157–167.
G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988).
H. Saito, Optimal queueing discipline for real time traffic at ATM switching nodes, IEEE Trans. Commun. 38(1990)2131–2136.
M. Schwartz,Telecommunication Networks: Protocols, Modeling and Analysis (Addison-Wesley, Reading, MA, 1987).
Y. Takagi, S. Hino and T. Takahashu, Priority assignment constrol of ATM line buffers with multiple QOS classes, IEEE J. Select Areas Commun. 9(1992)1078–1092.
C.J. Weinstein, M.C. Malpass and M.J. Fischer, Data traffic performance on an integrated circuit and packet switched multiplexed architecture, IEEE Trans. Commun. 28(1980)873–877.
Author information
Authors and Affiliations
Additional information
Supported partially through NSF Grant NCR-891447 and AT&T Grant 5-23690.
Rights and permissions
About this article
Cite this article
Gupta, S., El Zarki, M. Traffic classification and scheduling in ATM networks. Telecommunication Systems 2, 51–69 (1993). https://doi.org/10.1007/BF02109850
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02109850