scispace - formally typeset
Journal ArticleDOI

Application Note Local Congestion Control In Computercommunication Networks With Random Routing

N.D. Georganas, +2 more
- 01 Feb 1980 - 
- Vol. 18, Iss: 1, pp 74-79
Reads0
Chats0
TLDR
In this article, a queueing model for the analysis of a local congestion control scheme is presented, and an analytical study of the model shows that LCC witb random routing is superior to similar control with deterministic routing at least for the particular example considered here.
Abstract: 
A queueing model for the analysis of a local congestion control scheme is presented. Analytic study of the model shows that local congestion control witb random routing is superior to similar control with deterministic routing at least for the particular example considered here.

read more

References
More filters
Journal ArticleDOI

Sequential Arrays of Waiting Lines

Gordon C. Hunt
- 01 Dec 1956 - 
TL;DR: The problem considered in this paper is that in which a sequence of service operations must be performed on the units to be serviced, and the maximum possible utilization is obtained for all cases discussed.
Journal ArticleDOI

Cyclic Queuing Systems with Restricted Length Queues

William J. Gordon, +1 more
- 01 Apr 1967 - 
TL;DR: The closed, cyclic systems that are considered are shown to be stochastically equivalent to open systems in which the number of customers is a random variable and the concept of duality is introduced.
Journal ArticleDOI

Flow Control in a Resource-Sharing Computer Network

Robert E. Kahn, +1 more
- 01 Jun 1972 - 
TL;DR: This paper examines in some detail the nature of the flow control required in the subnet and its relation to the host flow control and subnet performance.
Journal ArticleDOI

Analysis of a Packet-Switched Network with End-to-End Congestion Control and Random Routing

A. Chatterjee, +2 more
- 01 Dec 1977 - 
TL;DR: In this article, a queueing model of a communication network with random routing and end-to-end congestion control is proposed and compared with that of a previously published model, where fixed routing was employed.
Proceedings ArticleDOI

Local congestion control in computer-communication networks with random routing

N.D. Georganas, +2 more
TL;DR: Analytic study of the model shows that local congestion control with random routing is superior to similar control with deterministic routing for a particular example worked out here.