Showing papers in "Computer Networks in 1988"

TL;DR: A test sequence generated by the procedure given here tours all state transitions and uses a unique signature for each state, called the Unique Input/Output (UIO) sequence, called an input/output behavior that is not exhibited by any other state.

TL;DR: A modified mathematical programming formulation of the problem of selecting a route for every pair of communicating nodes in a backbone network in order to minimize the mean delay faced by messages is presented and a solution procedure utilizing this relaxation is developed.

TL;DR: The design presented is modular, and provides hooks for possible future evolutions of network architectures, and the originality of the scheme is that proxies are built dynamically during internetwork directory calls, thus overcoming the typical problems of proxy schemes.

TL;DR: In this article, the authors proposed a new technique to organize routing information in large networks, where a "radius database" provides optimal routing between frequent communicators, and a combination of a "cluster database" and a backbone allows reasonable routing to all nodes.

TL;DR: The current paper describes the hardware and software needed to implement the protocol at the various nodes as well as the computing equipment needed to support such a system.

TL;DR: A set of methods and tools enables an interdisciplinary team to describe the conceptual model of an existing application system, to define a user interface for this application that is acceptable from a human factors point of view, and to construct the actual interface in order to test whether this enables the user to interact with the system in a more comfortable way.

TL;DR: Analysis of a generally applicable protocol devised by Barberis and Pazzaglia which waits for late packets includes nonstationary buffer length distribution and mean values, as a function of time in the talkspurt, which may be used in the design of a packet voice receiver.

TL;DR: The dynamic hierarchy, which is a generalization of the centralized, tree structured network, is introduced in this paper and a relatively simple heuristic strategy produces capacity assignments whose quality is comparable to that of the preferred probabilistic strategy.

TL;DR: This paper represents a mechanism for interprocess communication, which supports grouping of operations and forms a suitable base for developing a wide range of distributed systems.

TL;DR: Comparisons of the accuracy of the measured call congestion and of a measured time congestion indicate the performance of measurement methods in ISDNs and it is shown that the grade-of-services in busy hours may be degraded as a result of integration.

TL;DR: A new scheme to generate and manage host ids satisfying the various properties of the distributed kernel reliability requires is presented, which is distributed and robust, and works even under network partitioning.

TL;DR: In this article, the design scheme of an experimental computer LAN in the university environment containing several campuses is presented, where some microcomputers are connected with a twisted-pair wire using a baseband transmission method without any modems to constitute a microcomputer LAN sub-system.

TL;DR: This work presents a naming and addressing scheme that provides a common name space for all academic electronic mail users within Switzerland and offers full connectivity to all major foreign electronic mail networks by means of gateways.