Computer Networks with Finite Buffers: Beyond Jackson’s Theorem

[1]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..

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

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

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

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

[6]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

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

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

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

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

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

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

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

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

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

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