We consider a saturated tree network with flow control. The network consists of two layers of polling stations, all of which 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.
|Title of host publication||Proceedings of the 2011 23rd International Teletraffic Congress (ITC 2011, San Francisco CA, USA, September 6-9, 2011)|
|Publication status||Published - 2011|
Beekhuizen, P., & Resing, J. A. C. (2011). A saturated tree network of polling stations with flow control. In Proceedings of the 2011 23rd International Teletraffic Congress (ITC 2011, San Francisco CA, USA, September 6-9, 2011) (pp. 294-301)