Showing papers in "Computer Networks in 1978"

TL;DR: In this article, a finite state model for the specification and validation of communication protocols is considered, and the concept of direct coupling between interactiing finite state components is used to describe a hierarchical structure of protocol layers.

TL;DR: In this paper, a method for implementing any system by a network of processes so it continues to function properly despite the failure or malfunction of individual processes and communication arcs; where "malfunction" is doing something incorrectly, and "failure" means doing nothing.

TL;DR: Results of simulation studies performed during 1975/1976 at the Institute for Teleprocessing of the GMD are presented, which refer to packet networks applying dynamic deadlock-free resource allocation nased on so-called buffer classes.

TL;DR: The proposed File Transfer Protocol is completely compatible (even identical in some areas) with the currently proposed Virtual Terminal Protocol (VTP).

TL;DR: In this paper, the main subject of this paper is connection management in TCP, including mechanisms for establishing connections, terminating connections, recoverty from crashes or failures of either side, and for resynchronizing a connection.

TL;DR: This part describes how this method works for communication protocols involving timing assumptions, state changes depending on message contents, unreliable medium, an arbitrary number of communicating processes, etc.

TL;DR: Timmer-based protocol mechanisms are developed for reliable and efficient transmission of both single-message and message-stream traffic so that correct data delivery is assured in the face of lost, damaged, duplicate, and out-of-sequence packets.

TL;DR: The progress of one research effort in computer-automated protocol validation is summarized, bringing together in one place the results of a number of studies, some published and some to be published but all widely scattered in the literature.

TL;DR: The mathematical model of HDLC developed in this paper allows us to compute its performance limits as a function of window width, transmission errors, and packet lengths for symmetric and asymmetric traffics, but with no transmission delays.

TL;DR: An open queueing network model is used to derive the distribution of end-to-end delay in a message-switched network and the generalization of this basic result to random routing and to messages belonging to a group of a source-destination pairs is considered.

TL;DR: Techniques for definition and verification of computer network protocols have progressed significantly in the past two years to the point where complex real world protocols such as HDLC, X.25, and Cyclades TS can be analyzed.

TL;DR: Most of the issues which are discussed in the context of the NVP, like separation of control from data, device independence, and performance monitoring are not unique only to voice application, but apply equally to any other real-time protocol.

TL;DR: A formal representation model, particularly well adapted to this kind of protocols, but useful also for other protocol types, is introduced and a method for detection of deadlock situations is presented.

TL;DR: The establishment, organization and funding of computer network based scientific journals are discussed, which differ from other forms of machine readable information in that they have passed an editorial review and can be selectively retrieved on the basis of a reviewer score.

TL;DR: Heuristic techniques have been used also to evaluate performances of various flow control mechanisms intended for internode protocols and transport protocols as well as performances as seen by users of computer networks.

TL;DR: Assuming the existence of the X25 DTE/DCE interface and a packet switching network, the problem of constructing end-to-end protocols for interprocess communication is considered and the main device to couple the operating system of a host computer to a communication network is the “Message Transmission Controller”.

TL;DR: The study shows that for the delay performance, message length, traffic pattern and line utilization are the most telling parameters for the dynamic costs of circuit- and packet-switching techniques.

TL;DR: The terminal structure is such that the negotiation of a small number of parameters selects a terminal capability which ranges from Scroll to Data Entry complexity and fully determines the terminals behaviour in respect to the communicating process.

TL;DR: 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.

TL;DR: This paper outlines the requirements of distributed database systems and attempts to survey the present level of support, as well as outlining the needs of implementors and vendors.

TL;DR: The principal result of the UCL TCP was wasteful of processor cycles, and some of the experiments supporting this conclusion are presented, and the general applicability of this result to transnet communication is indicated.

TL;DR: This paper presents a Virtual Terminal corresponding to the class of intelligent terminals used for alphanumeric data-entry applications, and a protocol VTP for exchanging and structuring the messages between VT and AP.

TL;DR: Three facets of ongoing field trials providing scientific research communities with the use of a computerized conferencing system are described, including some initial findings about the human roles in the system and human reactions to this form of communication.

TL;DR: It is shown that buffer allocation at source nodes is an important factor in achieving satisfactory operation in flow control and congestion avoidance in ditagram networks.

TL;DR: The options which have been chosen for the Belgian University Network and the motivations which lead to make those choices are mainly underlined.

TL;DR: The proposal is based on a general model of interprocess communication and describes how this model is used to fit the requirements of terminal control to create a new class of terminal protocols.

TL;DR: The X25 service is compared with other transmission services and it is concluded by saving that a datagram transmission service beside X25 is necessary.

TL;DR: An algorithm is described for the problem of designing a store-and-forward packet-switched computer communication network with multiple packet classes using both terrestrial and satellite links, which is an extension of the design algorithm developed for designing terrestrial networks to include satellite links.

TL;DR: A four-state probabilistic automaton which serves as a simulation model of the NRM, HDX HDLC procedure with Poll/Final bit error recovery procedure and Primary Reply Timer is introduced and a point-to-point throughput equation is developed.

TL;DR: The use of multimicroprocessors for implementing the EIN network results in a modular architecture of functionally divided elements that makes it possible to configure the system in a variety of ways to achieve different goals with the minimum of extra effort.