Abstract
We study a discrete-time, single-server queue with partial buffer sharing. There are two priority classes of jobs. Though class 1 jobs in the queue have higher priority for the next service than any of class 2 jobs, class 2 jobs are allowed to occupy their own part of buffer when the shared part of buffer is full. We characterize a bursty arrival process using bursts which consist of the same class of jobs. Once the first job of a burst arrives at the queue, the successive jobs will arrive on every time slot until the last job of the burst arrives. The numbers of jobs of a burst and the inter-arrival times of bursts are assumed to be i.i.d., respectively, and the service time is assumed to be equal to one slot. This model targets the buffer management to meet the quality of service requirments of different traffic types as video, voice and data in ATM multiplexer. In particular, class 1 jobs may correspond to cells with the strict delay requirments. On the other hand, class 2 jobs may correspond to cells with the strict cell loss requirments. We propose an efficient numerical method to exactly obtain the job loss probability, the waiting time distribution and the mean queue length. Some numerical examples are also given.
Chapter PDF
Similar content being viewed by others
keywords
References
Brandt,A., Brandt,M. and Sulanke,H. (1990) A Single Server Model for Packetwise Transmission of Messages. Queueing Systems. 6, 287–310.
Devault,M., Cochennec,J.-Y. and Servel,M. (1988) The ‘Prelude’ ATD Exper- iment: Assessments and Future Prospects. IEEE J. SAC 6, 1528–1537.
Gravey,A. and Hebuterne,G. (1991) Mixing Time and Priorities in a Single Server Queue, in Proc. of ITC-13, Copenhagen, Denmark, 47–52.
Händel,H. and Huber,M.N. (1991) Integrated Broadband Networks,Addison-Wesley.
Hashida,O. and Takahashi,Y. (1991) A Discrete-time Priority Queue with Switched Batch Bernoulli Process Inputs and Constant Service Time, in Proc. of ITC-13, Copenhagen, Denmark, 521–526.
Hashida,O., Takahashi,Y. and Shimogawa,S. (1991) Switched Batch Bernoulli Process(SBBP) and the Discrete-Time SBBP/G/1 Queue with Application to Statistical Multiplexer Performance. IEEE J. Select. Areas Commun., SAC-9 394–401.
Johnson,M.A. and Narayana,S. (1996) Descriptors of Arrival-Process Burstiness with Application to the Discrete Markovian Arrival Process. Queueing Systems, 23 107–130.
Kino,I. and Miyazawa,M. (1993) The Stationary Work in System of a G/G/1 Gradual Input Queue. J. Appl. Prob., 30 207–222.
Kröner,H. (1990) Comparative Performance Study of Space Priority Mechanisms for ATM Networks, in Proc. of INFOCOM’90, San Francisco, 1136–1143.
Miyazawa,M and Yamazaki,G. (1992) Loss Probability of a Burst Arrival Finite Queue with Synchronized Service. Probability in the Engineering and Informational Sciences, 6 201–216.
Morris,R. (1981) An Algorithmic Technique for a Class of Queueing Models with Packet Switching Applications, in Proc. IEEE ICC’81, 41.2.1–41. 2. 8.
Neuts,M.F. (1990) On Viterbi’s Formula for the Mean Delay in a Queue of Data Packets. Commun. Statist.-Stochastic Models, 6 87–98.
Takine,T., Sengupta,B. and Hasegawa,T. (1994) An Analysis of a Discrete-time Queue for Broadband ISDN with Priorities among Traffic Classes. IEEE Trans. Comm., 42 1837–1845.
Yamashita,H. (1994) Numerical Analysis of a Discrete-Time Finite Capacity Queue with a Burst Arrival. Annals of Operations Research 49 101–110.
Yamashita,H. (1994) Discrete-Time Analysis of a Classified Multi-server Queue with Burst Arrivals and a Shared Buffer. Queueing Systems, 18 167–182.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Yamashita, H. (1998). Delay and overflow of discrete-time priority queue with burst arrivals and partial buffer sharing. In: Hasegawa, T., Takagi, H., Takahashi, Y. (eds) Performance and Management of Complex Communication Networks. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35360-9_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-35360-9_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6162-7
Online ISBN: 978-0-387-35360-9
eBook Packages: Springer Book Archive