Traffic classification for round-robin scheduling schemes in ATM networks

An asynchronous transfer mode (ATM) switch mode at which cell arrive from a diverse set of source types is considered. To improve the utilization of network resources and facilitate management and control, source types are organized into traffic classes. Cells belonging to different traffic classes are transported by separate virtual paths though the network. Approximations for the quality of service that should be maintained for each traffic class are developed. Approximations are then developed for estimating the bandwidth and buffer requirements of each traffic class and also for the switch node. The problem of assigning weights, given a set of traffic classes, is addressed. The set of traffic classes that require the least amount of resources is determined. The closely related problem of minimizing the number of traffic classes given a finite bandwidth is also discussed. The structure of the problem at hand is then exploited to develop an efficient heuristic.<<ETX>>

[1]  C. Weinstein,et al.  Data Traffic Performance of an Integrated Circuit- and Packet-Switched Multiplex Structure , 1980, IEEE Trans. Commun..

[2]  Luigi Fratta,et al.  Statistical Multiplexing in ATM Networks , 1991, Perform. Evaluation.

[3]  P. Jacobs,et al.  Finite birth-and-death models in randomly changing environments , 1984, Advances in Applied Probability.

[4]  Tatsuro Takahashi,et al.  Priority Assignment Control of ATM Line Buffers with Multiple QOS Classes , 1991, IEEE J. Sel. Areas Commun..

[5]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[6]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[7]  Roy D. Yates,et al.  A Layered Broadband Switching Architecture with Physical or Virtual Path Configurations , 1991, IEEE J. Sel. Areas Commun..

[8]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[9]  Aurel A. Lazar,et al.  Real-Time Scheduling with Quality of Service Constraints , 1991, IEEE J. Sel. Areas Commun..

[10]  Hiroshi Saito.  Optimal queueing discipline for real-time traffic at ATM switching nodes , 1990, IEEE Trans. Commun..

[11]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[12]  M. Minoux.  A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations , 1987 .