Study on Optimal Queue-Length-Threshold Scheduling Policy for an ATM Multiplexer with Finite Buffers and Natch Poisson Arrivals

This paper studies an optimal queue-length-threshold (QLT) scheduling policy for an ATM multiplexer with two types of traffic: real-time and nonreal-time. The proposed QLT scheduling policy is that if the number of queued nonreal-time packets is greater than or equal to a threshold value α, c2 servers are allocated to the nonreal-time traffic and the rest c1(=c−c2) servers are scheduled with priority policy that the real-time are given higher priority over the nonreal-time; otherwise all the c servers are scheduled with priority policy. The arrival process for each type of traffic is assumed to be batch Poisson with arbitrarily positive integer-valued probability distributions so as to describe the different bandwidth-requirement traffic from narrowband (NB) to wideband (WB). The multiplexer is modeled as a multiple synchronous-server system with separate finite buffers for each type of traffic. Performance measures are exactly derived by using a two-dimensional imbedded Markov-chain approach and the transition probabilities are exactly obtained via the application of residue theorem in complex variable. A trade-off between the effective measures of the two types of traffic is discussed under different (c2, α). Some performance criteria are defined to intend to determine an optimal QLT scheduling policy. This optimal QLT policy can indeed improve the performance criterion above 2–3% over the priority policy.

[1]  L. Gimpelson Analysis of Mixtures of Wide- and Narrow-Band Traffic , 1965 .

[2]  Donald F. Towsley,et al.  Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  V. Ramaswami,et al.  Algorithmic Analysis of a Dynamic Priority Queue , 1982 .

[4]  Ward Whitt,et al.  Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data , 1986, IEEE J. Sel. Areas Commun..

[5]  Lorne G. Mason,et al.  A multiserver queue with narrow- and wide-band customers and wide-band restricted access , 1988, IEEE Trans. Commun..

[6]  Mischa Schwartz,et al.  Bandwidth Allocation Strategies in Wide-Band Integrated Networks , 1986, IEEE J. Sel. Areas Commun..

[7]  Bruce W. Irish,et al.  MAPCON: an expert system for configuration of MAP networks , 1988, IEEE J. Sel. Areas Commun..

[8]  Joseph D. Langford,et al.  Models for analysis of packet voice communications systems , 1986, IEEE J. Sel. Areas Commun..

[9]  Jin-Fu Chang,et al.  The effect of routing and buffer sharing on the behavior of a finite queue with batch poisson inputs and synchronous servers , 1987 .

[10]  Jin-Fu Chang,et al.  THE APPLICATION OF THE RESIDUE THEOREM TO THE STUDY OF A FINITE QUEUE WITH BATCH POISSON ARRIVALS AND SYNCHRONOUS SERVERS , 1984 .

[11]  David M. Lucantoni,et al.  A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance , 1986, IEEE J. Sel. Areas Commun..

[12]  Mischa Schwartz,et al.  Analysis of Traffic Access Control Strategies in Integrated Service Networks , 1985, IEEE Trans. Commun..