Adapting to a reliable network path

Authors:
Baruch Awerbuch;Yishay Mansour
Affiliations:
Johns Hopkins University, Baltimore, MD;Tel-Aviv University, Tel-Aviv, Israel.
Venue:
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Year:
2003

Citing 5
Cited 4

Amortized efficiency of list update and paging rules

Communications of the ACM
The weighted majority algorithm

Information and Computation
Slide—the key to polynomial end-to-end communication

Journal of Algorithms
Path Kernels and Multiplicative Updates

COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Gambling in a rigged casino: The adversarial multi-armed bandit problem

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Efficient algorithms for online decision problems

Journal of Computer and System Sciences - Special issue: Learning theory 2003
Evaluation of cross-layer interactions for reconfigurable radio platforms

TAPAS '06 Proceedings of the first international workshop on Technology and policy for accessing spectrum
Online linear optimization and adaptive routing

Journal of Computer and System Sciences
Regret Minimization and Job Scheduling

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end communication between two given nodes, where the performance measure is the average number of times the chosen path was disconnected. The second, is to build a spanning tree rooted at a given source node, where the performance measure is the average number of nodes that are the disconnected from the source. For both problems we design competitive algorithms.