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.
|Title of host publication||Value Tools 2008 (Proceedings Third International Conference on Performance Evaluation Methodologies and Tools, Athens, Greece, October 20-24, 2008)|
|Place of Publication||Gent|
|Publication status||Published - 2008|
Beekhuizen, P., Denteneer, T. J. J., & Resing, J. A. C. (2008). End-to-end delays in polling tree networks. In Value Tools 2008 (Proceedings Third International Conference on Performance Evaluation Methodologies and Tools, Athens, Greece, October 20-24, 2008) (pp. 10-). ICST. https://doi.org/10.4108/ICST.VALUETOOLS2008.4248