Comments on a Two Queue Network
- Samantha Morin
- Myron Hlynka
- Shan Xu
Abstract
A special customer must complete service from two servers, each with an $M/M/1$ queueing system. It is assumed that the two queueing systems have initiial numbers of customers $a$ and $b$ at the instant when the special customer arrives, and subsequent interarrival times and service times are independent. We find the expected total time (ETT) for the special customer to complete service. We show that even if the interarrival and service time parameters of two queues are identical, there exist examples (specific values of the parameters and initial lengths a and b) for which the special customer surprisingly has a lower expected total time to completion by joining the longer queue first rather than the shorter one.- Full Text: PDF
- DOI:10.5539/ijsp.v6n6p43
This work is licensed under a Creative Commons Attribution 4.0 License.
Journal Metrics
- h-index (December 2021): 20
- i10-index (December 2021): 51
- h5-index (December 2021): N/A
- h5-median(December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- CNKI Scholar
- COPAC
- DTU Library
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Excellence in Research for Australia (ERA)
- Google Scholar
- Harvard Library
- Infotrieve
- JournalTOCs
- LOCKSS
- MIAR
- Mir@bel
- PKP Open Archives Harvester
- Publons
- ResearchGate
- SHERPA/RoMEO
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- UCR Library
- WorldCat
Contact
- Wendy SmithEditorial Assistant
- ijsp@ccsenet.org