buffer overflow period in a map queue缓冲区溢出的时期地图队列.pdfVIP

Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2007, Article ID 34631, 18 pages doi:10.1155/2007/34631 Research Article Buffer Overflow Period in a MAP Queue Andrzej Chydzinski Received 27 April 2006; Revised 23 October 2006; Accepted 20 November 2006 Recommended by Nahum Shimkin The buffer overflow period in a queue with Markovian arrival process (MAP) and general service time distribution is investigated. The results include distribution of the overflow period in transient and stationary regimes and the distribution of the number of cells lost during the overflow interval. All theorems are illustrated via numerical calculations. Copyright © 2007 Andrzej Chydzinski. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 1. Introduction One of the crucial performance issues of the single-server queue with finite buffer (wait- ing room) is losses, namely, customers (packets, cells, jobs) that were not allowed to enter the system due to the buffer overflow. This issue is especially important in the analysis of telecommunication networks. Sample evolution of the queue length process in a finite-buffer system is depicted in Figure 1.1. In a time interval, where the number of customers in the system is equal to its capacity, all arrivals are blocked and lost. We call this interval buff er overflow period and it is equivalent to the remaining service time upon reaching a full buffer. Obviously, the duration of the buffer overflow period is responsible for the number of losses that occur consecutively. Distribution of the buffer overflow period deserves our attention for many practical and theoretical reasons and these motivations can be found by the reader in the literature (e.g. [1, 2]). Herein, we add just one more argument that makes the overflow interval an inter