Journal ArticleDOI
Distributed network protocols
Reads0
Chats0
TLDR
A series of known and new protocols for connectivity test, shortest path, and path updating are described and validated and extended to networks with changing topology.Abstract:
A unified approach to the formal description and validation of several distributed protocols is presented. After introducing two basic protocols, a series of known and new protocols for connectivity test, shortest path, and path updating are described and validated. All protocols are extended to networks with changing topology.read more
Citations
More filters
Book
Distributed algorithms
TL;DR: This book familiarizes readers with important problems, algorithms, and impossibility results in the area, and teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
Journal ArticleDOI
Complexity of network synchronization
TL;DR: A new simulation technique, referred to as a synchronizer, which is a new, simple methodology for designing efficient distributed algorithms in asynchronous networks, is proposed and is proved to be within a constant factor of the lower bound.
Journal ArticleDOI
On secret sharing systems
TL;DR: A linear coding scheme for secret sharing is exhibited which subsumes the polynomial interpolation method proposed by Shamir and can also be viewed as a deterministic version of Blakley's probabilistic method.
Journal ArticleDOI
OR Scheduling Algorithms
TL;DR: A schedule is proposed which minimizes the makespan, the time when the last job is completed, and the constraints are that a job can only be scheduled after its release time, and preemption is not allowed.
Journal ArticleDOI
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Ariel Orda,Raphael Rom +1 more
TL;DR: The shortest-path problem in networks in which the delay (or weight) of the edges changes with time according to arbitrary functions is considered and algorithms for finding the shortest path and minimum delay under various waiting constraints are presented.
References
More filters
Journal ArticleDOI
A Failsafe Distributed Routing Protocol
P. Merlin,Adrian Segall +1 more
TL;DR: The algorithm can be employed in message as well as circuit switching networks, uses distributed computation, provides routing tables that are loop-free for each destination at all times, adapts to changes in network flows, and is completely failsafe.
Journal ArticleDOI
Specification and Validation of Protocols
TL;DR: The "topology" of a protocol is defined, and protocols that are intended to work in a variety of configurations, as well as configurations which may change in time (i.e. "evolving topologies").
Journal ArticleDOI
Resynch Procedures and a Fail-Safe Network Protocol
TL;DR: This appears to be the first demonstration that such fail-safe protocols exist, and the procedures presented have the interesting property that no time-outs are required.
Journal ArticleDOI
Optimal Distributed Routing for Virtual Line-Switched Data Networks
TL;DR: An algorithm that provides minimum delay routing in a data communication network using virtual line-switching and an algorithm for quasi-static routing, when the input flows are slowly changing are presented.
Journal ArticleDOI
Advances in Verifiable Fail-Safe Routing Procedures
TL;DR: Two new versions of a distributed protocol for establishing and maintaining loop-free routing tables for communication networks with changing topology are presented and possess significant advantages over previous versions in terms of complexity of the node algorithm and of the validation procedure.