Abstract
We study a single-router Network-on-Chip modelled as a tandem queueing network. The first node is a geo K/D/1 queue (K fixed) representing a network interface, and the second node is a ./G/1 queue representing the packet switch. If K>1 we have train arrivals at the second node. If K=1 the arrival process of the second node reduces to a Bernoulli process. In the latter case, routers have been studied extensively as part of ATM and LAN networks under the assumption that the number of input ports N tends to infinity. In Networks-on-Chips N is usually 4 or 5 and results for ATM and LAN routers lead to inaccurate results. We introduce a new approximation scheme that yields accurate results for small switches. In addition to this we analyse the tandem network, both for K=1 and K>1, and we approximate the mean sojourn time in the switch and the mean end-to-end delay. If N=4 our approximation has a relative error of only 4.5% if K=6 and 1% if K=1.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Beekhuizen, P. (2005). Mathematical modelling of networks-on-chips with best effort traffic. Master’s thesis, Eindhoven University of Technology.
Boot, N. (2005). Throughput and delay analysis for a single router in networks on chip. Master’s thesis, Eindhoven University of Technology.
Dally, W. J., & Towles, B. (2001). Route packets, not wires: on-chip interconnection networks. In DAC proceedings (pp. 684–689).
Eng, K. Y., Karol, M. J., & Yeh, Y. S. (1989). A growable packet (ATM) switch architecture: Design principles and applications. In Proc. of IEEE GLOBECOM (pp. 1159–1165).
González Pestana, S., Rijpkema, E., Rădulescu, A., Goossens, K., & Gangwal, O. (2004). Cost-performance trade-offs in networks on chips: A simulation based approach. In DATE proceedings.
Gravey, A., & Hébuterne, G. (1992). Simultaneity in discrete-time single server queues with Bernoulli inputs. Performance Evaluation, 14, 123–131.
Hluchyj, M. G., & Karol, M. J. (1988). Queueing in high-performance packet switching. IEEE Journal on Selected Areas in Communications, 6(9), 1587–1597.
Karol, M. J., Hluchyj, M. G., & Morgan, S. P. (1987). Input versus output queueing on a space-division packet switch. IEEE Transactions on Communications, 35(12), 1347–1356.
Kim, H., Kim, K., & Lee, Y. (2000). Derivation of the mean cell delay and cell loss probability for multiple input-queued switches. IEEE Communications Letters, 4(4), 140–142.
Rădulescu, A., Dielissen, J., Goossens, K., Rijpkema, E., & Wielage, P. (2004). An efficient on-chip network interface offering guaranteed services, shared memory abstraction, and flexible network configuration. In DATE proceedings.
Rijpkema, E., Goossens, K., Rădulescu, A., Dielissen, J., van Meerbergen, J., Wielage, P., & Waterlander, E. (2003). Trade-offs in the design of a router with both guaranteed and best-effort services for networks on chip. In DATE proceedings.
Takagi, H. (1993). Queueing analysis: A foundation of performance evaluation : Vol. 3. Discrete-time systems. Amsterdam: North-Holland.
Xiong, Y., & Bruneel, H. (1993). Buffer contents and delay for statistical multiplexers with fixed-length packet-train arrivals. Performance Evaluation, 17(1), 31–42.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Beekhuizen, P., Denteneer, D. & Adan, I. Analysis of a tandem network model of a single-router Network-on-Chip. Ann Oper Res 162, 19–34 (2008). https://doi.org/10.1007/s10479-008-0333-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0333-2