End-to-end delays in polling tree networks

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

doi:10.4108/ICST.VALUETOOLS2008.4248

End-to-end delays in polling tree networks

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

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.

Original language	English
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
Publisher	ICST
Pages	10-
ISBN (Print)	978-963-9799-31-8
DOIs	https://doi.org/10.4108/ICST.VALUETOOLS2008.4248
Publication status	Published - 2008

Access to Document

10.4108/ICST.VALUETOOLS2008.4248

Cite this

@inproceedings{77e218781f954b548e09263da5b64a37,

title = "End-to-end delays in polling tree networks",

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.",

author = "P. Beekhuizen and T.J.J. Denteneer and J.A.C. Resing",

year = "2008",

doi = "10.4108/ICST.VALUETOOLS2008.4248",

language = "English",

isbn = "978-963-9799-31-8",

pages = "10--",

booktitle = "Value Tools 2008 (Proceedings Third International Conference on Performance Evaluation Methodologies and Tools, Athens, Greece, October 20-24, 2008)",

publisher = "ICST",

}

End-to-end delays in polling tree networks. / Beekhuizen, P.; Denteneer, T.J.J.; Resing, J.A.C.
Value Tools 2008 (Proceedings Third International Conference on Performance Evaluation Methodologies and Tools, Athens, Greece, October 20-24, 2008). Gent: ICST, 2008. p. 10-.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - End-to-end delays in polling tree networks

AU - Beekhuizen, P.

AU - Denteneer, T.J.J.

AU - Resing, J.A.C.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

U2 - 10.4108/ICST.VALUETOOLS2008.4248

DO - 10.4108/ICST.VALUETOOLS2008.4248

M3 - Conference contribution

SN - 978-963-9799-31-8

SP - 10-

BT - Value Tools 2008 (Proceedings Third International Conference on Performance Evaluation Methodologies and Tools, Athens, Greece, October 20-24, 2008)

PB - ICST

CY - Gent

ER -

End-to-end delays in polling tree networks

Abstract

Access to Document

Fingerprint

Cite this