Time to Reach Buffer Capacity in a BMAP Queue

In this paper a detailed study is presented on the first time to reach buffer capacity in a queue with batch arrivals and general service time distribution. A flexible analytical model of the input stream, which is the Batch Markovian Arrival Process (BMAP), is assumed. The results include the expli...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Stochastic models Ročník 23; číslo 2; s. 195 - 209
Hlavní autor: Chydzinski, Andrzej
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia, PA Taylor & Francis Group 08.05.2007
Taylor & Francis
Témata:
ISSN:1532-6349, 1532-4214
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper a detailed study is presented on the first time to reach buffer capacity in a queue with batch arrivals and general service time distribution. A flexible analytical model of the input stream, which is the Batch Markovian Arrival Process (BMAP), is assumed. The results include the explicit formula for the Laplace transform of the distribution of the first buffer overflow time and discussion of its computational aspects. In addition, the popular special case of the BMAP queue, which is the batch Poisson arrival queue, is studied. Theoretical results are illustrated via numerical calculations based on IP traffic data.
ISSN:1532-6349
1532-4214
DOI:10.1080/15326340701300746