Busy period of a single-server Poisson queueing system with splitting and batch delayed-feedback
by Aliakbar Montazer Haghighi; Dimitar P. Mishev
International Journal of Mathematics in Operational Research (IJMOR), Vol. 8, No. 2, 2016

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.

Online publication date: Sun, 21-Feb-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com