Priority queueing system with fixed-length packet-train arrivals

Author

Choi, B.D. ; Choi, D.I. ; Lee, Y. ; Sung, D.K.

Author_Institution

Dept. of Math., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea

Volume

145

Issue

5

fYear

1998

fDate

10/1/1998 12:00:00 AM

Firstpage

331

Lastpage

336

Abstract

A discrete-time priority queueing system is studied, in which two different classes of fixed-length packet-trains arrive according to independent batch geometric streams. The packets in each packet-train arrive at the rate of one packet per slot (train arrivals), resulting in a correlated arrival stream. The service time of one packet is deterministic of one slot. The motivation for the work comes from ATM networks with diverse traffic sources and correlated packet arrival stream. Using the probability generating function method, the joint distribution of queue lengths and the waiting time distribution are obtained for each class. Numerical results are presented. Comparison is made with the case of “batch arrivals”, where all packets of a packet-train arrive simultaneously at the buffer

Keywords

asynchronous transfer mode; correlation methods; discrete time systems; packet switching; probability; queueing theory; telecommunication networks; telecommunication traffic; ATM networks; batch arrivals; buffer; correlated packet arrival stream; deterministic service time; discrete-time priority queueing system; fixed-length packet-train arrivals; independent batch geometric streams; joint distribution; probability generating function method; queue lengths; traffic sources; waiting time distribution;

fLanguage

English

Journal_Title

Communications, IEE Proceedings-

Publisher

iet

ISSN

1350-2425

Type

jour

DOI

10.1049/ip-com:19982288

Filename

739694