Showing papers on "Packet loss published in 1976"
01 Jan 1976
TL;DR: A queueing model of a communication network with random routing and end-to-end congestion control is proposed, and the performance of this model is compared with that of a previously published model, where fixed routing was employed.
Abstract: This concise paper extends the results of Pennotti and Schwartz by proposing a queueing model of a communication network with random routing and end-to-end congestion control. Using conventional performance criteria, the performance of this model is compared with that of a previously published model, where fixed routing was employed.
7 citations
01 Jan 1976
TL;DR: Simple analysis and simulation performed on the CIGALE network show that the most critical resource is line bandwidth, not buffers, and a simple method called channel load limiter (CLL) has been devised.
Abstract: Congestion control in packet networks has been commonly associated with buffer management. While buffers are indeed an essential resource, they should cause no concern as long as line load remains within preset limits. Simple analysis and simulation performed on the CIGALE network show that the most critical resource is line bandwidth, not buffers. Based on this observation, a simple method called channel load limiter (CLL) has been devised. Load factors (green, yellow, red) are propagated throughout the network as an adjunction to adaptive routing. Counter measures include sending signaling packets to offending sources, and traffic deviation on less loaded routes. The limits and possible improvements to the CLL scheme are also mentioned.
3 citations