Journal ArticleDOI
Slide-The Key to Polynomial End-to-End Communication
Reads0
Chats0
TLDR
This paper presents the first polynomial complexity end-to-end communication protocol in dynamic networks, a simple and efficient method for delivering tokens across an unreliable network, and uses it to derive a file-transfer protocol for sufficiently large files.About:
This article is published in Journal of Algorithms.The article was published on 1997-01-01. It has received 34 citations till now. The article focuses on the topics: Internetwork protocol & Internet protocol suite.read more
Citations
More filters
Proceedings ArticleDOI
Survivable mobile wireless networks: issues, challenges, and research directions
James P. G. Sterbenz,Rajesh Krishnan,Regina Rosales Hain,Alden W. Jackson,David Levin,Ram Ramanathan,John K. Zao +6 more
TL;DR: Issues and challenges in enhancing the survivability of mobile wireless networks are surveyed, with particular emphasis on military requirements*.
Proceedings ArticleDOI
Adaptive packet routing for bursty adversarial traffic
TL;DR: This paper considers an adversary who injects packets, with only their destinations specified, into network nodes in a continuous manner subject to certain limitations on the injection rate, and presents a simple, deterministic, local-control protocol that applies to any network topology.
Proceedings ArticleDOI
Simple routing strategies for adversarial systems
TL;DR: This paper presents two simple distributed balancing algorithms and shows that for the case of a single receiver these algorithms will always ensure that the number of packets or flow in the system is bounded at any time step, even for an injection process that completely saturates the capacities of the available edges.
Journal ArticleDOI
f-Sensitivity Distance Oracles and Routing Schemes
TL;DR: This paper presents an efficiently constructible f-sensitivity distance oracle that given a triplet (s,t,F), where s and t are vertices and F is a set of forbidden edges such that |F|≤f, returns an estimate of the distance between s andT in G(V,E∖F), and is the first to consider approximate oracles for general graphs.
Book ChapterDOI
f-sensitivity distance Oracles and routing schemes
TL;DR: An efficiently constructible f-sensitivity distance oracle that given a triplet (s, t, F), where s and t are vertices and F is a set of forbidden edges such that |F| ≤ f, returns an estimate of the distance between s andT in G(V, E\ F).
References
More filters
Journal ArticleDOI
Efficient dispersal of information for security, load balancing, and fault tolerance
TL;DR: Information Dispersal Algorithm (IDA) has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission ofInformation in networks, and to communications between processors in parallel computers.
Journal ArticleDOI
The New Routing Algorithm for the ARPANET
TL;DR: The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations.
Proceedings ArticleDOI
Self-stabilization by local checking and correction
TL;DR: The first self-stabilizing end-to-end communication protocol and the most efficient known self-Stabilizing network reset protocol are introduced.
Proceedings ArticleDOI
Distributed program checking: a paradigm for building self-stabilizing distributed protocols
Baruch Awerbuch,George Varghese +1 more
TL;DR: The notion of distributed program checking as a means of making a distributed algorithm self-stabilizing is explored and a compiler that converts a deterministic synchronous protocol pi for static networks into a self-Stabilizing version of pi for dynamic networks is described.
Proceedings ArticleDOI
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
Baruch Awerbuch,Tom Leighton +1 more
TL;DR: Improved Approximation Algorithms the Multi-Commodity Flow Problem and Competitive Routing in Dynamic Networks improve the quality of the approximation algorithms used for routing decisions.