Abstract
In this paper we present a queueing model for the performance analysis of Available Bit Rate (ABR) traffic in Asynchronous Transfer Mode (ATM) networks. We consider a multi-channel service station with two types of customers, denoted by high priority and low priority customers. In principle, high priority customers have preemptive priority over low priority customers, except on a fixed number of channels that are reserved for low priority traffic. The arrivals occur according to two independent Poisson processes, and service times are assumed to be exponentially distributed. Each high priority customer requires a single server, whereas low priority customers are served in processor sharing fashion. We derive the joint distribution of the numbers of customers (of both types) in the system in steady state. Numerical results illustrate the effect of high priority traffic on the service performance of low priority traffic.
Highlights
It is our pleasure to contribute this paper to the special issue in honor of Ryszard Syski
In this paper we present a queueing model for the performance analysis of Available Bit Rate (ABR) tm i Asynchronous Transfer Mode (ATM)
The diverse characteristics and service requirements of the different traffic types that are carried by ATM (Asynchronous Transfer Mode) networks have led to the definition of different service categories that should be offered to users of such a network
Summary
Our model is basically a multi-server queue with two types of customers: (i) high priority customers (real-time VBR traffic); and (ii)low priority customers (ABR traffic). We present the model in the context of (future) ABR traffic, it can just as be seen in the context of existing situations, where real-time VBR has priority over non real-time VBR In this case, the processor sharing discipline for the low priority traffic should be. Related two-dimensional Markov models have been studied in a number of papers The case where both types of customers have an infinite waiting space, and within each customer type the service discipline is FCFS, was solved first by Mitrani and King [15], and later by Gail, Hantler, and Taylor [8].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
