Showing papers in "Computer Networks in 1986"

TL;DR: In this paper, the authors proposed a protocol that is functional, robust and compatible with current Ethernet specifications, which meets the real-time voice performance requirements for local and potentially remote distribution of voice.

TL;DR: This work derives formulae useful for dimensioning a videoconferencing network to a low blocking probability grade of service standard and discusses implied teletraffic issues and attempt to describe the reservation process by mathematical models.

TL;DR: In this paper, the effect of propagation delays on the steady state behavior of ALOHA systems is investigated, and it is shown that propagation delays stabilize the system and the global behavior of the system is determined by the cusp catastrophe.

TL;DR: In this paper, the authors apply state machine modeling and analysis techniques to determine important properties of encryption-based protocols including completeness, deadlock freeness, livelock or tempo-blocking freenness, termination, boundedness, and absence of non-executable interactions.

TL;DR: A new local area networking technology is presented which uses local memory to detect and ignore redundant messages, thus also acting as a message sink and can be more flexible and reliable than current networks.

TL;DR: The result of the analytical evaluation of FCP policy is reduced to the problem of solving simultaneous non-linear equations with several variables and of a higher degree, and the systematic algorithm for computing PARs in F CP policy is given.

TL;DR: In this paper, the session layer of the ISO Open-System-Interconnection (OSI) protocol has been validated using an automated state-exploration technique, and a number of the protocol errors found is presented.

TL;DR: The steady state behavior of computer networks employing random access schemes is analyzed in a unified manner and stability can be considered from an analysis of the bifurcation set which gives the necessary and sufficient condition that the system is either monostable or bistable.

TL;DR: In order to find an explanation for the sudden performance deterioration for one system state but not another, the dynamic behavior of p-persistent CSMA/CD is considered and the dependence of the stability of the system state on such system parameters as number of nodes and packet length is considered.

TL;DR: In this paper, a random access protocol for multiaccess broadcast bus systems is presented, which has the capability to reconfigure the available bandwidth instantaneously and can thus present a more efficient channel configuration to the users subject to local loading conditions.

TL;DR: In this paper, the authors examine the use of priorities in a packet-switching network to speed the return of acknowledgements and to effect a grade-of-service routing policy.

TL;DR: In this article, the authors considered a disjointly shared channel where more than one user pair can communicate simultaneously over physically disjointed parts of the channel. And they considered the question of how much extra capacity such a channel has over that of a broadcast channel, as measured by the number of user pairs on the channel, and the amount of extra capacity depends on the topology and the distribution of offered traffic.

TL;DR: The performance of CSMA in networks in which both the topology and the traffic pattern are symmetric is shown to be rather poor as compared with its performance in fully connected networks, while relatively high performance is achieved by the CASMA scheme, the various BTMA protocols, as well as the CDMA scheme.

TL;DR: The functions that MAC layer bridges must perform to receive, transform, and transmit frames properly between any combination of IEEE 802 LANs are discussed.

TL;DR: In this paper, a simple traffic model for the signalling information messages is proposed and analyzed, using this model, signalling information traffic via the D-channel can be estimated accurately enough to design a Dchannel handler for an ISDN switching system.

TL;DR: In this paper, the authors analyzed a week's worth of data traffic on a DATAKIT∗ Virtual Circuit Switch network at AT&T Bell Laboratories, which includes 5 nodes connecting 22 host computers and 226 terminals, with trunks to nodes elsewhere at Bell Laboratories.

TL;DR: The conclusion is that one must be careful both in the overall design of a distributed algorithm, and in its detailed implementation, and the importance of careful formal validation of such protocols, rather than informal, intuitive arguments.

TL;DR: Particular emphasis is laid upon reliability improvement techniques, based on duplication of the ring subsystem components, and the automatic reconfiguration algorithm, which determines network configuration when faults occur.

TL;DR: In this article, two routing strategies, most-forward routing and point-to-destination, are investigated and compared and it is shown that both strategies posses roughly the same degree of performance.

TL;DR: In this article, the authors proposed a new clustering technique which permits us to obtain optimal paths in a virtual circuit fashion, which is appropriate only if the paths are then used for many messages in virtual circuits.

TL;DR: The system architecture developed in the DNTS is also applicable to the ISDN testing system and not only accelerates fault detection and localization processes but reduces maintenance costs to a remarkable degree.

TL;DR: The Rand Message Handling System (MH) as discussed by the authors is a powerful user agent which operates in the ARPA Internet and UUCP environments and has several distinguishing characteristics which give the user additional message handling capabilities.

TL;DR: The volume of ISDN traffic anticipated for the future in the Federal Republic of Germany is taken as an example so as to extend the traffic model shown to an overall traffic model for complete ISDN-PABX's, and the model helps to formulate traffic design 7objectives for new IS DN-PAbX's in the F.R. Germany.

TL;DR: The application of an architecture specified for testing protocols in layers four through seven of the International Organization for Standardization's (ISO) Basic Reference Model for Open Systems Interconnection (OSI) to testing Class 4 Transport with thirteen vendors' implementations of the protocols is described.

TL;DR: This approach is based on dynamic comparison and analysis of observable behaviors presented by system functionality representations given at different levels of abstraction, which is extremely flexible, straightforward to use, and particularly appropriate to systems whose externally observable behavior can be modeled by finite state automata.

TL;DR: In this paper, Girling's strategy for one-time keywords for authentication forwarding is combined with a proxy login mechanism to obtain a reliable method for network authentication that does not depend on the transmission of passwords.

TL;DR: In this paper, a broadcast polling information delivery scheme is proposed to ensure that no superfluous transmissions take place, at the expense of requiring a two-way communication network and incurring a polling overhead.

TL;DR: The design and implementation of a file server which is simple to implement and user friendly, and the automatic recovery provided by the system after a system start up from a failure is described.