Letter to the Editor---Priority Traffic with at Most One Queuing Class

Paul J. Burke
Additional contact information
Paul J. Burke: Bell Telephone Laboratories, New York, New York

Operations Research, 1962, vol. 10, issue 4, 567-569

Abstract: Load-service relations are derived for three types of preemptive priority traffic, in which a call of any class displaces a call of a lower class (the lowest one present, if any) with the single exception in ( b ) below. These may be briefly characterized as follows ( a ) calls of all classes are cleared when blocked, ( b ) calls of the highest class queue, calls of all other classes are cleared, and calls of the second highest class are not displaced by preemption, and ( c ) calls of the highest class queue and those of all lower classes are cleared. [Doctrine ( b ) without its last condition ]

Date: 1962
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.10.4.567 (application/pdf)

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:inm:oropre:v:10:y:1962:i:4:p:567-569

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().