A saturated tree network of polling stations with flow control

Authors:
Paul Beekhuizen;Jacques Resing
Affiliations:
Philips Research and EURANDOM, Eindhoven, The Netherlands;Eindhoven University of Technology, Eindhoven, The Netherlands
Venue:
Proceedings of the 23rd International Teletraffic Congress
Year:
2011

Citing 8
Cited 0

The analysis of random polling systems

Operations Research
Route packets, not wires: on-chip inteconnection networks

Proceedings of the 38th annual Design Automation Conference
Window flow control in FIFO networks with cross traffic

Queueing Systems: Theory and Applications
Closed polling models with failing nodes

Queueing Systems: Theory and Applications
Heavy Traffic Analysis of Polling Systems in Tandem

Operations Research
An Efficient On-Chip Network Interface Offering Guaranteed Services, Shared-Memory Abstraction, and Flexible Network Configuration

Proceedings of the conference on Design, automation and test in Europe - Volume 2
Reduction of a polling network to a single node

Queueing Systems: Theory and Applications
End-to-end delays in polling tree networks

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a saturated tree network with flow control. The network consists of two layers of polling stations, all of which use the random polling service discipline. We obtain the equilibrium distribution of the network using a Markov chain approach. This equilibrium distribution can be used to efficiently compute the division of throughput over packets from different sources. Our study shows that this throughput division is determined by an interaction between the flow control limits, buffer sizes, and the service discipline parameters. A numerical study provides more insight in this interaction. The study is motivated by networks on chips where multiple masters share a single slave, operating under flow control.