Short Headers Suffice for Communication in a DAG with Link Failures
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Tight Size Bounds for Packet Headers in Narrow Meshes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Authenticated Adversarial Routing
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Anycasting in adversarial systems: routing and admission control
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Asynchronous throughput-optimal routing in malicious networks
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
A dynamic communication network is one in which links may repeatedly fail and recover. In such a network, although it is impossible to establish a path of unfailed links, reliable communication is possible if there is no cut of permanently failed links between a sender and receiver. The authors consider for such a network the basic task of end-to-end communication, that is, delivery in finite time of data items generated online at the sender, to the receiver, in order and without duplication or omission. The best known previous solutions to this problem had exponential complexity. Moreover, it has been conjectured that a polynomial solution is impossible. The authors disprove this conjecture, presenting the first polynomial end-to-end protocol. The protocol uses methods adopted from shared-memory algorithms and introduces novel techniques for fast load balancing in communication networks.