This paper describes the impact that buffer management has on network performance for a cut-through ID ring. Such network provides only one routing alternative between each pair of nodes. The network is kept simple to illustrate the significance of buffer management for all virtual cut-through networks. Besides, 2D and 3D torus, among other networks, can be seen as a collection of interlinked ID rings. The simulation results will show that the key to maximum sustained throughput is to reserve half of our buffer capacity for transit packets. This increases link utilization by maximising packets at the sending node and empty buffers at the receiving node. © Springer-Verlag 2004.
CITATION STYLE
Izu, C., & Beivide, R. (2004). Understanding buffer management for cut-through ID rings. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3149, 908–915. https://doi.org/10.1007/978-3-540-27866-5_120
Mendeley helps you to discover research relevant for your work.