Sciweavers

166 search results - page 21 / 34
» networking 1993
Sort
View
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
14 years 1 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
MASCOTS
1993
13 years 11 months ago
Simulation Modeling of Weak-Consistency Protocols
: Weak-consistency replication protocols can be used to build wide-area services that are scalable, fault-tolerant, and useful for mobile computer systems. We have evaluated the ti...
Richard A. Golding, Darrell D. E. Long
HPDC
1993
IEEE
14 years 1 months ago
Programming a Distributed System Using Shared Objects
Building the hardware for a high-performance distributed computer system is a lot easier than building its software. In this paper we describe a model for programtributed systems ...
Andrew S. Tanenbaum, Henri E. Bal, M. Frans Kaasho...
ICDCS
1993
IEEE
14 years 1 months ago
Proxy-Based Authorization and Accounting for Distributed Systems
Despite recent widespread interest in the secure authentication of principals across computer networks there has been considerably less discussion of distributed mechanisms to sup...
B. Clifford Neuman
INFOCOM
1993
IEEE
14 years 1 months ago
Stability of a Class of Dynamic Routing Protocols (IGRP)
We perform an exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm widely used in the industry, on a simple ring network. The distance metri...
Steven H. Low, Pravin Varaiya