IRE Transactions on Communications Systems · 1972 · 110 citations · 1 references
ComputingCommunicationComputer ScienceComputer NetworksDigital CommunicationQueuing TheoryCommunication NetworksCongestion ControlFlow ControlNetwork SwitchingPacket SwitchingSwitching TechniquesCongestion AvoidanceCongestion Control In SwitchesEnd-to-end Flow ControlTraffic Capacity
Packet‑switching networks have limited capacity and must drop traffic when overloaded; the ARPA network processes data in packets, subdividing longer messages similarly to memory paging. The paper proposes a congestion‑control method that limits the number of packet carriers in the network. The method uses a fixed pool of reusable packet carriers that circulate randomly; a data packet must acquire an empty carrier before transmission, and the scheme includes variations that prevent delays under normal traffic.
Any communication network has a finite traffic capacity and if it is offered traffic beyond the limit it must reject some of it. The data-communication network studied here is one employing packet switching, like the Advanced Research Project Agency (ARPA) network. It handles blocks of data, called packets, and longer messages are subdivided, rather in the same way that store in a computer is allocated in pages. A method of controlling congestion is proposed in which there is a finite number of packet carriers in the whole network. When a packet of data is delivered to its destination node the "empty" packet is available for reuse. The empties move randomly round the network and new data must capture an empty packet carrier before being launched into the network. Various elaborations are described that avoid delay in normal conditions. This so-called "isarithmic" method of congestion control supplements and does not replace end-to-end flow control.
1
Computer network development to achieve resource sharing
Lawrence G. Roberts, Barry D. Wessler · 1970 · 354 citations