Journal ArticleDOI
Store-and-Forward Buffer Requirements in a Packet Switching Network
TLDR
A model for a packet switching network in which each node has a finite pool of S/F buffers is presented and a heuristic algorithm for determining a balanced assignment of nodal S/f buffer capacities is proposed.Abstract:
Previous analytic models for packet switching networks have always assumed infinite storage capacity in store-store-and-forward (S/F) nodes. In this paper, we relax this assumption and present a model for a packet switching network in which each node has a finite pool of S/F buffers. A packet arriving at a node in which all S/F buffers are temporarily filled is discarded. The channel transmission control mechanisms of positive acknowledgment and time-out of packets are included in this model. Individual S/F nodes are analyzed separately as queueing networks with different classes of packets. The single node results are interfaced by imposing a continuity of flow constraint. A heuristic algorithm for determining a balanced assignment of nodal S/F buffer capacities is proposed. Numerical results for the performance of a 19 node network are illustrated.read more
Citations
More filters
Journal ArticleDOI
Virtual cut-through: A new computer communication switching technique
Parviz Kermani,Leonard Kleinrock +1 more
TL;DR: The analysis shows that cut-through switching is superior (and at worst identical) to message switching with respect to the above three performance measures.
Journal ArticleDOI
A Queueing Network Analysis of Computer Communication Networks with Window Flow Control
TL;DR: A computer communication network with window flow control is modeled by a closed multichain queueing network and the severe computational limitation of previous solution algorithms is overcome with a heuristic derived from the recently found mean value analysis.
Journal ArticleDOI
Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions
Farouk Kamoun,Leonard Kleinrock +1 more
TL;DR: This paper considers several schemes for sharing a pool of buffers among a set of communication channels emanating from a given node in a network environment so as to make effective use of storage in a variety of applications.
Journal ArticleDOI
Approximate Methods for Analyzing Queueing Network Models of Computing Systems
K. Mani Chandy,Charles H. Sauer +1 more
TL;DR: It is the contention of this paper that queueing network models with credible assumptions can be solved approximately to provide credible performance estimates at low cost.
Journal ArticleDOI
Buffer Management in a Packet Switch
TL;DR: In a single packet switch with a finite number of packet buffers shared between several output queues, it is shown that restricted sharing prevents congestion by making throughput an increasing function of load.
References
More filters
Journal ArticleDOI
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
TL;DR: Many of the network results of Jackson on arrival and service rate dependencies, of Posner and Bernholtz on different classes of customers, and of Chandy on different types of service centers are combined and extended in this paper.
Journal ArticleDOI
Computational algorithms for closed queueing networks with exponential servers
TL;DR: Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers based on two-dimensional iterative techniques which are highly efficient and quite simple to implement.
Proceedings ArticleDOI
Analytic and simulation methods in computer network design
TL;DR: The Seventies are here and so are computer networks! the time sharing industry dominated the Sixties and it appears that computer networks will play a similar role in the Seventies.
Proceedings ArticleDOI
Computer communication network design: experience with theory and practice
TL;DR: The ARPA Network (ARPANET) project brought together many individuals with diverse backgrounds, philosophies, and technical approaches from the fields of computer science, communication theory, operations research and others to provide an efficient and reliable computer communications system.