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.
|Place of Publication||Eindhoven|
|Number of pages||16|
|Publication status||Published - 2009|