论文信息 - Flow control in a resource-sharing computer network

Flow control in a resource-sharing computer network

In this paper we discuss flow control in a resource-sharing computer network (1). The network resources consist of a set of inhomogeneous computers called Hosts that are geographically distributed and are interconnected by a store-and-forward communications subnet. Each Host is connected to a store-and-forward switching node called an Interface Message Processor or an IMP, which is located on or nearby its premises (2). IMPs are then interconnected by leased synchronous communication circuits to form the subnet.

William R. Crowther | Robert E. Kahn

[1] R. A. Scantlebury. A model for the local area of a data communication network objectives and hardware organization , 1969 .

[2] A. Nico Habermann,et al. Prevention of system deadlocks , 1969, CACM.

[3] Richard B. Kalin. A Simplified NCP Protocol , 1970, RFC.

[4] John M. Wozencraft,et al. Coding for two-way channels , 1961 .

[5] Barry D. Wessler,et al. Computer network development to achieve resource sharing , 1899, AFIPS '70 (Spring).

[6] D. W. Davies,et al. The control of congestion in packet switching networks , 1971, Symposium on Problems in the Optimizations of Data Communications Systems.

[7] Keith A. Bartlett,et al. A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[8] William R. Crowther,et al. The interface message processor for the ARPA computer network , 1899, AFIPS '70 (Spring).