Abstract
It is frequently the case in communications systems that transmission facilities are shared among a number of different sources. In Chapter 5, for example, time-division multiplexing is used to distribute transmission capacity among the sources sharing the same line. The allocation of resources in this case is fixed and is therefore unresponsive to the instantaneous needs of users. In this and in subsequent chapters we shall be examining techniques for sharing resources that respond to variations in instantaneous traffic levels. In this chapter sharing will be effected by granting priority to one class of users over another. As we shall see presently, this mechanism does not necessarily mean inequitable service.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. K. Jaiswal, Priority Queues, Academic Press, New York (1968).
J. W. Cohen, The Single-Server Queue, North-Holland, Amsterdam (1969).
D. R. Cox and W. L. Smith, Queues, Methuen, New York (1961).
B. Avi-Itzhak and P. Naor, “Some Queueing Problems with the Service Station Subject to Breakdown,” Operations Research, 11(3), 303–320 (1963).
L. Takâcs, Combinatorial Methods in the Theory of Stochastic Processes, John Wiley, New York (1967).
L. Kleinrock, Queueing Systems, Vol. 1: Theory, John Wiley, New York (1975).
J. F. Hayes and D. N. Sherman, “Traffic Analysis of a Ring-Switched Data Transmission System,” Bell System Technical journal, 50(9), 2947–2978, November (1971).
R. R. Anderson, J. F. Hayes, and D. N. Sherman, “Simulated Performance of a Ring-Switched Data Network,” IEEE Transactions on Communications, Com-20(3), 516–591, June (1972).
J. D. Spragins, “Simple Derivation of Queueing Formulas for Loop Systems,” IEEE Transactions on Communications, Com-23, 446–448, April (1977).
E. R. Hafner, Z. Nenadal, and M. Tschanz, “A Digital Loop Communication System,” IEEE Transactions on Communications, Com-22(6), 877–881, June (1974).
W. Bux and M. Schlatter, “An Approximate Method for the Performance Analysis of Buffer Insertion Rings,” IEEE Transactions on Communications, Com-31(1), 50–55, January (1983).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Plenum Press, New York
About this chapter
Cite this chapter
Hayes, J.F. (1984). Intermittently Available Server, Priority Queues. In: Modeling and Analysis of Computer Communications Networks. Applications of Communications Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-4841-2_6
Download citation
DOI: https://doi.org/10.1007/978-1-4684-4841-2_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-4843-6
Online ISBN: 978-1-4684-4841-2
eBook Packages: Springer Book Archive