Research Article
End-to-end delays in polling tree networks
@INPROCEEDINGS{10.4108/ICST.VALUETOOLS2008.4248, author={P. Beekhuizen and T.J.J. Denteneer and J.A.C. Resing}, title={End-to-end delays in polling tree networks}, proceedings={3rd International ICST Conference on Performance Evaluation Methodologies and Tools}, publisher={ICST}, proceedings_a={VALUETOOLS}, year={2010}, month={5}, keywords={Polling Concentrating tree networks HoL-based service dis- ciplines Networks on Chips}, doi={10.4108/ICST.VALUETOOLS2008.4248} }- P. Beekhuizen
T.J.J. Denteneer
J.A.C. Resing
Year: 2010
End-to-end delays in polling tree networks
VALUETOOLS
ICST
DOI: 10.4108/ICST.VALUETOOLS2008.4248
Abstract
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.
Copyright © 2008–2024 ICST