An M/M/1-Type queue with an individual deterministic retrial rate

Yair Y. Shaki, Moshe Haviv, Uri Yechieli

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Consider a system where customers arrive to a single-server queue according to a Poisson process with rate λ. The service times are independent and exponential distributed with rate μ. A customer who arrives when the server is busy is blocked and goes to orbit. Each orbit customer then every T units of time to re-enter the system. If he is blocked again, he will keep trying every T units of time. Balking is not allowed. In this paper, we consider retrial policy with deterministic T and we calculate the expected number of customers in orbit (without using balance equations).

Original languageEnglish
Title of host publicationProceedings - 2nd International Symposium on Stochastic Models in Reliability Engineering, Life Science, and Operations Management, SMRLO 2016
EditorsAnatoly Lisnianski, Ilia Frenkel
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages630-632
Number of pages3
ISBN (Electronic)9781467399418
DOIs
StatePublished - 11 Mar 2016
Event2nd International Symposium on Stochastic Models in Reliability Engineering, Life Science, and Operations Management, SMRLO 2016 - Beer Sheva, Israel
Duration: 15 Feb 201618 Feb 2016

Publication series

NameProceedings - 2nd International Symposium on Stochastic Models in Reliability Engineering, Life Science, and Operations Management, SMRLO 2016

Conference

Conference2nd International Symposium on Stochastic Models in Reliability Engineering, Life Science, and Operations Management, SMRLO 2016
Country/TerritoryIsrael
CityBeer Sheva
Period15/02/1618/02/16

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

Keywords

  • Deterministic retrial rate
  • Queueing system

Fingerprint

Dive into the research topics of 'An M/M/1-Type queue with an individual deterministic retrial rate'. Together they form a unique fingerprint.

Cite this