×

Computer protocol and torus maps. (English) Zbl 0865.68005

Summary: We investigate the dynamics of maps and flows which arise from a class of models of closed queueing networks in computer science theory. The network consists of \(n+1\) servers, one of which is a central server with a queue of size \(n-1\). A protocol or scheduling discipline must be specified in this server to define the queueing network. The standard model gives rise to a flow on an \(n\)-torus. We consider the service protocols first in-first out (FIFO) and last in-first out (LIFO) in dimension three, for which the state spaces are modifications of a 3-torus. We present a sufficient condition on the time it takes each call to compete one cycle for the FIFO protocol which guarantees that the set of periodic orbits which involve no waiting in the queue is a global attractor for the associated semi-flow. We also investigate the dynamics for the LIFO service protocol via a return map derived from the associated area preserving flow.

MSC:

68M10 Network design and communication in computer systems
Full Text: DOI

References:

[1] DOI: 10.1145/378570.378633 · doi:10.1145/378570.378633
[2] Cornfeld I. P, Encyclopaedia of Mathematical Sciences-Dynamical Systems II pp 25– (1989)
[3] DOI: 10.1109/49.68444 · doi:10.1109/49.68444
[4] DOI: 10.1090/S0273-0979-1995-00555-0 · Zbl 0879.54023 · doi:10.1090/S0273-0979-1995-00555-0
[5] DOI: 10.2307/1971341 · Zbl 0497.28012 · doi:10.2307/1971341
[6] DOI: 10.2307/1971391 · Zbl 0486.28014 · doi:10.2307/1971391
[7] Wallström B, Teletraffic and Datatraffic in a Period of Change. ITC-13 pp 429– (1991)
[8] Walters P, An Introduction to Ergodic Theory (1982)
[9] Wolpert A.B, Proceedings of LASTED International Conference on Modeling and Simulation pp 215– (1994)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.