Analysis of polling systems
Waiting-time approximations in multi-queue systems with cyclic service
Performance Evaluation
An approximation for mean waiting times in cyclic server systems with nonexhaustive service
Performance Evaluation
Performance Analysis of Transaction Driven Computer Systems Via Queueing Analysis of Polling Models
IEEE Transactions on Computers
Queueing analysis of polling models: progress in 1990-1994
Frontiers in queueing
Waiting-time approximations for cyclic-service systems with switch-over times
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
A novel approach to queue stability analysis of polling models
Performance Evaluation - Special issue on performance and control of network systems
Route packets, not wires: on-chip inteconnection networks
Proceedings of the 38th annual Design Automation Conference
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
Heavy Traffic Analysis of Polling Systems in Tandem
Operations Research
Iterative approximation of k-limited polling systems
Queueing Systems: Theory and Applications
Reduction of a polling network to a single node
Queueing Systems: Theory and Applications
Approximation of discrete-time polling systems via structured Markov chains
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
A saturated tree network of polling stations with flow control
Proceedings of the 23rd International Teletraffic Congress
| Hi-index | 0.00 |
We consider a tree network of polling stations operating in discrete-time. Packets arrive from external sources to the network according to batch Bernoulli arrival processes. We assume that all nodes have a service discipline that is HoL-based. The class of HoL-based service disciplines contains for instance the Bernoulli and limited service disciplines, and hence also the classical exhaustive and 1-limited. We obtain an exact expression for the overall mean end-to-end delay, and an approximation for the mean end-to-end delay of packets per source. The study is motivated by Networks on Chips where multiple processors share a single memory.