An Erlang Loss Queue with Time-Phased Batch Arrivals as a Model for Traffic Control in Communication Networks

Moon Ho Lee and Sergey A. Dudin

Mathematical Problems in Engineering, 2008, vol. 2008, 1-14

Abstract:

A multiserver queueing model that does not have a buffer but has batch arrival of customers is considered. In contrast to the standard batch arrival, in which the entire batch arrives at the system during a single epoch, we assume that the customers of a batch (flow) arrive individually in exponentially distributed times. The service time is exponentially distributed. Flows arrive according to a stationary Poisson arrival process. The flow size distribution is geometric. The number of flows that can be simultaneously admitted to the system is under control. The loss of any customer from an admitted flow, with a fixed probability, implies termination of the flow arrival. Analysis of the sojourn time and loss probability of an arbitrary flow is performed.

Date: 2008
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2008/814740.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2008/814740.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:814740

DOI: 10.1155/2008/814740

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().