A 3-Queue Polling System with Join the Shortest -- Serve the Longest Policy
A 3-Queue Polling System with Join the Shortest -- Serve the Longest Policy
About this item
Full title
Author / Creator
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
In 1987, J.W. Cohen analyzed the so-called Serve the Longest Queue (SLQ) queueing system, where a single server attends two non-symmetric \(M/G/1\)-type queues, exercising a non-preemptive priority switching policy. Cohen further analyzed in 1998 a non-symmetric 2-queue Markovian system, where newly arriving customers follow the Join the Shortest Q...
Alternative Titles
Full title
A 3-Queue Polling System with Join the Shortest -- Serve the Longest Policy
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2652414750
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2652414750
Other Identifiers
E-ISSN
2331-8422
