End-to-end delays in polling tree networks

P. Beekhuizen, T.J.J. Denteneer, J.A.C. Resing

Onderzoeksoutput: Boek/rapportRapportAcademic

72 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
Plaats van productieEindhoven
UitgeverijEurandom
Aantal pagina's16
StatusGepubliceerd - 2009

Publicatie series

NaamReport Eurandom
Volume2009043
ISSN van geprinte versie1389-2355

Vingerafdruk Duik in de onderzoeksthema's van 'End-to-end delays in polling tree networks'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit

    Beekhuizen, P., Denteneer, T. J. J., & Resing, J. A. C. (2009). End-to-end delays in polling tree networks. (Report Eurandom; Vol. 2009043). Eurandom.