A finite buffer queue

Author

Sharma, Vinod ; Virtamo, Jorma T.

Author_Institution

Lab. of Telecommun., Helsinki Univ. of Technol., Espoo, Finland

fYear

1999

fDate

6/21/1905 12:00:00 AM

Firstpage

1053

Abstract

We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are i.i.d. with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K queue which restricts the number of packets in the buffer rather than the buffer content (the number of bits). We obtain the stability, the rates of convergence to the stationary distribution and functional limit theorems for this system. In addition we also obtain algorithms to compute the stationary density of the workload process, the waiting times and the probability of packet loss

Keywords

Internet; Markov processes; Poisson distribution; buffer storage; convergence of numerical methods; numerical stability; packet switching; queueing theory; Internet; M/GI/1/K queue; MMPP arrivals; Markov modulated Poisson process; Poisson process; algorithms; arrival process; buffer content; buffer size; convergence rates; finite buffer queue; functional limit theorems; general distribution; i.i.d. service times; packet lengths; packet loss probability; stability; stationary density; stationary distribution; waiting times; workload process; Buffer storage; Convergence; Equations; Internet; Laboratories; Queueing analysis; Stability; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1999. GLOBECOM '99

Conference_Location

Rio de Janeireo

Print_ISBN

0-7803-5796-5

Type

conf

DOI

10.1109/GLOCOM.1999.830277

Filename

830277