Latency and saturation in networks with finite buffers

This paper is devoted to networks with different size of buffers (5, 10, 20, 30, 40, and 50). The ring and the two-dimension torus topology networks are considered, and the results are compared with these for networks with infinite buffers. The network behavior in terms of the average number of messages and the latency has been studied. Both second-order and first-order transitions to the saturation state have been observed. The results show that the model of independent queues, which is valid for networks with infinite buffers, is still applicable for the load values outside of the critical region, but breaks down, which violates the Jackson theorem.

[1]  Seok Ho Chang,et al.  Performance analysis of a finite-buffer discrete-time queue with bulk arrival, bulk service and vacations , 2005, Comput. Oper. Res..

[2]  K. Mani Chandy,et al.  A Characterization of Product-Form Queuing Networks , 1983, JACM.

[3]  Ahmed Louri,et al.  Adaptive Channel Buffers in On-Chip Interconnection Networks— A Power and Performance Analysis , 2008, IEEE Transactions on Computers.

[4]  Martin Reiser,et al.  Mean Value Analysis fo Queueing Networks - A New Look at an Old Problem , 1979, Performance.

[5]  Michel Mandjes,et al.  Large Deviations for Small Buffers: An Insensitivity Result , 2001, Queueing Syst. Theory Appl..

[6]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[7]  Lev B. Levitin,et al.  Interconnection networks with heterogeneous activity or finite buffers: beyond Jackson's theorem , 2008, CNS '08.

[8]  Tim Roughgarden,et al.  Routers with Very Small Buffers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Nutthapol Asadathorn,et al.  A decomposition approximation for assembly‐disassembly queueing networkswith finite buffer and blocking , 1999, Ann. Oper. Res..

[10]  Baltasar Beferull-Lozano,et al.  Efficient routing with small buffers in dense networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[11]  Jeffrey R. Spirn.  Queuing Networks with Random Selection for Service , 1979, IEEE Transactions on Software Engineering.

[12]  Donald F. Towsley,et al.  Congestion Control for Small Buffer High Speed Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[13]  Lev B. Levitin,et al.  Performance model of a multiprocessor interconnection network: theory and simulation , 2007, SpringSim '07.

[14]  Lev B. Levitin,et al.  Modeling of Latency and Saturation Phenomena in Interconnection Networks , 2007, 2007 12th IEEE Symposium on Computers and Communications.

[15]  Martin Reiser,et al.  Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks , 1981, Perform. Evaluation.

[16]  Andrew S. Noetzel.  A Generalized Queueing Discipline for Product Form Network Solutions , 1979, JACM.

[17]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[18]  E. Bravi,et al.  Optical packet-switched interconnect based on wavelength-division- multiplexed clockwork routing , 2007 .

[19]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[20]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[21]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[22]  Lev B. Levitin,et al.  Critical phenomena in discrete-time interconnection networks , 2010 .

[23]  Lev B. Levitin,et al.  Multiprocessor networks with small buffers: theory and simulation , 2009, SpringSim '09.

[24]  Lev B. Levitin,et al.  Analysis and simulation of a model of multiprocessor networks , 2007 .

[25]  Guido Appenzeller,et al.  Sizing router buffers , 2004, SIGCOMM '04.