Abstract
We consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit size and arrive from the exterior according to independent batch Bernoulli arrival processes. The service discipline of each node is work-conserving and the service discipline of node 0 has to be HoL-based, which is an additional assumption that is satisfied by, a.o., m i -limited service, exhaustive service, and priority disciplines.
Let a type i packet be a packet that visits queue i of node 0. We establish a distributional relation between the number of type i packets in the network and in a single station system, and we show equality of the mean end-to-end delay of type i packets in the two systems. Essentially this reduces an arbitrary tree network to a much simpler system of one node, while preserving the mean end-to-end delay of type i packets.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Avi-Itzhak, B.: A sequence of service stations with arbitrary input and regular service times. Manag. Sci. 11(5), 565–571 (1965)
Dally, W.J., Towles, B.: Route packets, not wires: on-chip interconnection networks. In: Proc. of the 38th Design Automation Conference, pp. 684–689 (2001)
Friedman, H.D.: Reduction methods for tandem queueing systems. Oper. Res. 13, 121–131 (1965)
Mandjes, M., van Uitert, M.: Sample-path large deviations for tandem and priority queues with Gaussian inputs. Ann. Appl. Probab. 15(2), 1193–1226 (2005)
Morrison, J.A.: A combinatorial lemma and its application to concentrating trees of discrete-time queues. Bell Syst. Tech. J. 57(5), 1645–1652 (1978)
Neely, M.J., Rohrs, C.E., Modiano, E.: Equivalent models for queueing analysis of deterministic service time tree networks. IEEE Trans. Inf. Theory 51(10), 1–10 (2005)
Reiman, M.I., Wein, L.M.: Heavy traffic analysis of polling systems in tandem. Oper. Res. 47(4), 524–534 (1999)
Rubin, I.: Communication networks: Message path delays. IEEE Trans. Inf. Theory 20(6), 738–745 (1974)
Rubin, I.: Message path delays in packet-switching communication networks. IEEE Trans. Commun. 23(2), 186–192 (1975)
Rubin, I.: An approximate time-delay analysis for packet-switching communication networks. IEEE Trans. Commun. 24(2), 210–222 (1976)
Shalmon, M.S.: Exact delay analysis of packet-switching concentrating networks. IEEE Trans. Commun. 35(12), 1265–1271 (1987)
Shalmon, M.S., Kaplan, M.A.: A tandem network of queues with deterministic service and intermediate arrivals. Oper. Res. 23(4), 753–773 (1984)
Vishnevskii, V.M., Semenova, O.V.: Mathematical methods to study the polling systems. Autom. Remote Control 67(2), 173–220 (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Beekhuizen, P., Denteneer, D. & Resing, J. Reduction of a polling network to a single node. Queueing Syst 58, 303–319 (2008). https://doi.org/10.1007/s11134-008-9071-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-008-9071-z