Latency and saturation in networks with finite buffers

Authors:
Yelena Rykalova;Lev B. Levitin
Affiliations:
Boston University, Boston, MA;Boston University, Boston, MA
Venue:
Proceedings of the 14th Communications and Networking Symposium
Year:
2011

Citing 18
Cited 0

Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
A Generalized Queueing Discipline for Product Form Network Solutions

Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
A Characterization of Product-Form Queuing Networks

Journal of the ACM (JACM)
Computational algorithms for closed queueing networks with exponential servers

Communications of the ACM
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Large Deviations for Small Buffers: An Insensitivity Result

Queueing Systems: Theory and Applications
Mean Value Analysis fo Queueing Networks - A New Look at an Old Problem

Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
Sizing router buffers

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Performance analysis of a finite-buffer discrete-time queue with bulk arrival, bulk service and vacations

Computers and Operations Research
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Efficient routing with small buffers in dense networks

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Queuing Networks with Random Selection for Service

IEEE Transactions on Software Engineering
Analysis and simulation of a model of multiprocessor networks

ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Interconnection networks with heterogeneous activity or finite buffers: beyond Jackson's theorem

Proceedings of the 11th communications and networking simulation symposium
Performance model of a multiprocessor interconnection network: theory and simulation

SpringSim '07 Proceedings of the 2007 spring simulaiton multiconference - Volume 1
Adaptive Channel Buffers in On-Chip Interconnection Networks— A Power and Performance Analysis

IEEE Transactions on Computers
Multiprocessor networks with small buffers: theory and simulation

SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.