
doi: 10.1007/bf01916912
We study a new class of networks of queues whose nodes operate in round-robin fashion and other ways of interest to computer science. We compute a stationary law of product form for the Markov process describing the state of the network. Moreover, we obtain the conditional expected travel time of a job given the job's requested processing times at particular nodes along its route.
stationary law of product form, Deterministic network models in operations research, round-robin operation, discrete time, networks of queues, conditional expected travel time, Queues and service in operations research, Queueing theory (aspects of probability theory), Performance evaluation, queueing, and scheduling in the context of computer systems
stationary law of product form, Deterministic network models in operations research, round-robin operation, discrete time, networks of queues, conditional expected travel time, Queues and service in operations research, Queueing theory (aspects of probability theory), Performance evaluation, queueing, and scheduling in the context of computer systems
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
