论文信息 - On Datagram Service in Public Packet-Switched Networks

On Datagram Service in Public Packet-Switched Networks

Abstract The need for datagram service in public packet-switched networks is examined. Also, the relationship of subnetwork design to datagram service is discussed. It is concluded that the use of layered design allows datagram service to be offered easily and efficiently, and also prevents the use of harmful routing and buffer allocation techniques.

Eric G. Manning | E. Manning

[1] Marek Irwin Irland. Analysis and simulation of congestion in packet-switched networks. , 1977 .

[2] J. D. Haenle,et al. A Method of Deadlock-free Resource Allocation and Flow Control in Packet Networks , 1976, ICCC.

[3] A. M. Rybczynski,et al. Datapac X.25 service characteristics , 1977, SIGCOMM.

[4] Eric G. Manning,et al. A Homogeneous Network for Data-Sharing Communications , 1977, Comput. Networks.

[5] Louis Pouzin,et al. Presentation and major design aspects of the CYCLADES computer network , 1973, DATACOMM '73.

[6] Alain Danet,et al. The French Public Packet Switching Service: The Transpac Network , 1976, International Conference on Innovative Computing and Cloud Computing.

[7] C. M. Solomonides,et al. A Simulation Study of Routing and Flow Control Problems in a Hierarchically Connected Packet Switching Network , 1976, International Conference on Innovative Computing and Cloud Computing.

[8] Louis Pouzin,et al. Virtual circuits vs. datagrams: technical and political problems , 1976, AFIPS '76.