Busy period of a single-server Poisson queueing system with splitting and batch delayed-feedback

Aliakbar Montazer Haghighi and Dimitar P. Mishev

International Journal of Mathematics in Operational Research, 2016, vol. 8, issue 2, 239-257

Abstract: We consider a queueing system consisting of a service station, a splitter and a delay station. There are two types of arrivals to the service station. External tasks arrive according to a Poisson process while internal tasks arrive as batches from the delay station, also according to a Poisson process but with a different parameter. There is a single server at the service station and a processor at the delay station. Splitting is immediate. Each of the two stations has a buffer as its waiting room. The service distribution is exponential. Feedbacks occur exponentially with delay and in batches of certain sizes. We consider the busy period of the server and an algorithm for computing the expected number of busy periods in the service station, which is of Takács's renewal equation form. Some numerical examples are also offered.

Keywords: busy periods; batch delayed feedback; splitting; single-server Poisson queueing; service stations; queues; delay stations. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=74859 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijmore:v:8:y:2016:i:2:p:239-257

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().