scispace - formally typeset
Search or ask a question

Showing papers in "Computer Networks in 1980"


Journal ArticleDOI
TL;DR: An analysis of carrier sense multiple access schemes with collision detection is extended to accommodate collision detection and provides the throughput-delay performance of CSMA-CD and its dependence on such key system parameters as the average retransmission delay and the collision recovery time.

427 citations


Journal ArticleDOI
TL;DR: An analytic model is developed and the main result is the moment generating function of the distributed queue size (number of ready users) and mean value formulas for message delay and channel assignment delay are derived.

239 citations


Journal ArticleDOI
TL;DR: A taxonomy by which a number of parameters of a distributed simulation method are classified, and solutions to problems of synchronization, deadlock prevention and inter-process communication arising with various methods in each class of the taxonomy are sought.

156 citations


Journal ArticleDOI
TL;DR: The “star-shaped ring” appears to be a satisfactory approach to installing a network that can grow to a large number of nodes in a typical office building, and simplifies trouble-shooting and permits the use of still simpler transmission circuitry.

90 citations


Journal ArticleDOI
Eric C. Rosen1
TL;DR: The problem of devising a good updating protocol is shown to be a problem in the management of a distributed data base and the requirements which any such protocol must meet are presented and discussed.

68 citations


Journal ArticleDOI
TL;DR: Currently MITRE is developing a variety of TDM techniques for use on coaxial cable, the design of public key crypto systems for application to local networks, integrated data and voice systems, the technical control of local networks and local network protocols.

23 citations


Journal ArticleDOI
TL;DR: The service requirements for local area computer networks are reviewed and several candidate technologies are briefly compared in the concluding section.

22 citations


Journal ArticleDOI
TL;DR: It is suggested that much of the work going on today in local network technology is misdirected and people should consider shifting their attention from the local network itself to the higher level protocols in order to make the use of the network practical and cost-effective for a new generation of computing equipment.

16 citations


Journal ArticleDOI
TL;DR: The n-philosophers problem is an example of asynchronous processes which interact, and in the best solution, the mechanism of relinquishing guarantees that all philosophers will consume, without requiring mutual exclusion.

16 citations


Journal ArticleDOI
TL;DR: A queueing model of the entire controlled network, including probabilistic routing, is developed and Analytic expressions for the important system measures such as average network throughout, average delay and blocking probability are obtained.

8 citations


Journal ArticleDOI
TL;DR: An algorithm is employed when the network is configured to segment this data base such that the majority of accesses involve strictly intranode operation, with correspondingly rapid transaction times, and form a loosely coupled set of processing universes communicating via “thin wire” protocols.

Journal ArticleDOI
TL;DR: This paper is the first analysis of buffer requirements for retransmission error control schemes operating over fading links, and an exact analysis of Bernoulli arrivals is presented and assessed as an easily calculated approximation to more general arrival patterns.

Journal ArticleDOI
TL;DR: The author interprets the OSI Reference Model as discussed in ISO/TC97/SC16/N227 and presents an overview of a formal definition of the Reference Model using a state-oriented system philosophy.

Journal ArticleDOI
TL;DR: A software rotary has been incorporated in all nodes to provide automatic sequencing of connection attempts to a computer acting as a server which has multiple nodes attached to it.

Journal ArticleDOI
TL;DR: Differences that have existed among various network implementations of X.25 are described and Contentious points have been eliminated, in favour of a single universally acceptable specification.

Journal ArticleDOI
TL;DR: In this article, the problem of finding optimal distribution of a database over a computer network to facilitate parallel searching for a set of database queries is analyzed and procedures for finding the optimal distributions in a network to maximally exploit the parallel search capability with or without redundancy of segment types are proposed.


Journal ArticleDOI
TL;DR: It is conjectured that the use of a special purpose high-level language is a most flexible and powerful means of generating particular network agents and that this technique permits the automation of a wide variety of network access procedures.

Journal ArticleDOI
TL;DR: It is shown which parameters need to be measured in a particular data communications application, in order to compare the impact of the tariffs for different communication services, using analytic tariff models.

Journal ArticleDOI
TL;DR: A robust implementation of eventcounts and sequencers for a local network with reliable broadcast capability is developed, in the process the original read primitive is replaced by the lread and rread primitives.

Journal ArticleDOI
TL;DR: The network was developed on a low budget, with few programmers, using as a basis the DECNET proprietary system and protocols, and contains features that endow it with good potential for growth and evolution for resource sharing and multi-hosting.

Journal ArticleDOI
M. Clayton Andrews1
TL;DR: A review is given of the sessions of the International Computer Communications Conference '78 which were devoted to Computer Network Architectures and to Operating Experience of Data Networks.

Journal ArticleDOI
TL;DR: In this paper, a optimality criterion for the correct mix of facilities to be used in the system's design is obtained and an example from data communications is given.

Journal ArticleDOI
TL;DR: Two possible designs of access protocols for integrated computer networks with combined circuit and packet switching capabilities are discussed, i.e. pure circuit or packet protocols, with future integration in mind.

Journal ArticleDOI
TL;DR: Comments in this review paper will not be presented session by session but rather will be grouped by topics of interest to computer communications and each of these topics will contain papers from the collection of sessions where appropriate.