Reduction of a polling network to a single node

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., mi-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.

[1]  Lawrence M. Wein,et al.  Heavy Traffic Analysis of Polling Systems in Tandem , 2011, Oper. Res..

[2]  Izhak Rubin.  Message Path Delays in Packet-Switching Communication Networks , 1975, IEEE Trans. Commun..

[3]  B. Avi-Itzhak,et al.  A SEQUENCE OF SERVICE STATIONS WITH ARBITRARY INPUT AND REGULAR SERVICE TIMES , 1965 .

[4]  Eytan Modiano,et al.  Equivalent models for queueing analysis of deterministic service time tree networks , 2005, IEEE Transactions on Information Theory.

[5]  Henry D. Friedman,et al.  Reduction Methods for Tandem Queuing Systems , 1965 .

[6]  W. Dally,et al.  Route packets, not wires: on-chip interconnection networks , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[7]  Michael Shalmon,et al.  A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals , 1984, Oper. Res..

[8]  Michael Shalmon,et al.  Exact Delay Analysis of Packet-Switching Concentrating Networks , 1987, IEEE Trans. Commun..

[9]  J. A. Morrison.  A combinatorial lemma and its Application to concentrating trees of discrete-time queues , 1978, The Bell System Technical Journal.

[10]  V. M. Vishnevskii,et al.  Mathematical methods to study the polling systems , 2006 .

[11]  Izhak Rubin.  An Approximate Time-Delay Analysis for Packet-Switching Communication Networks , 1976, IEEE Trans. Commun..

[12]  Michel Mandjes,et al.  Sample-path large deviations for tandem and priority queues with Gaussian inputs , 2005, math/0505214.

[13]  Izhak Rubin.  Communication networks: Message path delays , 1974, IEEE Trans. Inf. Theory.