A saturated tree network of polling stations with flow control

P. Beekhuizen, J.A.C. Resing

Research output: Book/ReportReportAcademic

21 Downloads (Pure)

Abstract

We consider a saturated tree network with flow control. The network consists of two layers of polling stations, and all polling stations use the random polling service discipline. We obtain the equilibrium distribution of the network using a Markov chain approach. This equilibrium distribution can be used to efficiently compute the division of throughput over packets from different sources. Our study shows that this throughput division is determined by an interaction between the flow control limits, buffer sizes, and the service discipline parameters. A numerical study provides more insight in this interaction. The study is motivated by networks on chips where multiple masters share a single slave, operating under flow control.
Original languageEnglish
Place of PublicationEindhoven
PublisherEurandom
Number of pages10
Publication statusPublished - 2009

Publication series

NameReport Eurandom
Volume2009055
ISSN (Print)1389-2355

Fingerprint Dive into the research topics of 'A saturated tree network of polling stations with flow control'. Together they form a unique fingerprint.

  • Cite this

    Beekhuizen, P., & Resing, J. A. C. (2009). A saturated tree network of polling stations with flow control. (Report Eurandom; Vol. 2009055). Eurandom.