End-to-end delays in polling tree networks

Autor:	Jacques Resing, Theodorus Jacobus Johannes Denteneer, P. Beekhuizen
Přispěvatelé:	Stochastic Operations Research, Eurandom
Jazyk:	angličtina
Rok vydání:	2009
Předmět:	Network packet business.industry Computer science Distributed computing HOL Computer Science::Digital Libraries Bernoulli's principle Tree (data structure) End-to-end principle Polling system Tree network Polling business Computer network
Zdroj:	VALUETOOLS Value Tools 2008 (Proceedings Third International Conference on Performance Evaluation Methodologies and Tools, Athens, Greece, October 20-24, 2008)
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0e8a346e1ad9f336fad67a8a06f8c36 https://research.tue.nl/nl/publications/4e509af7-ec71-4f0a-94ba-c24c6543485b Zobrazit plný text záznamu