End-to-end communication in unreliable networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Reliable communication over unreliable channels
Journal of the ACM (JACM)
Log-space polynomial end-to-end communication
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Slide—the key to polynomial end-to-end communication
Journal of Algorithms
Crash Resilient Communication in Dynamic Networks
IEEE Transactions on Computers
Self-stabilizing end-to-end communication
Journal of High Speed Networks
Counting protocols for reliable end-to-end transmission
Journal of Computer and System Sciences
The complexity of end-to-end communication in memoryless networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Polynomial end-to-end communication
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Short Headers Suffice for Communication in a DAG with Link Failures
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
$k$-Robust Single-Message Transmission
SIAM Journal on Discrete Mathematics
k-robust single-message transmission
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
| Hi-index | 0.00 |
Consider the problem of sending a single message from a sender to a receiver through an m × n mesh with asynchronous links that may stop working, and memoryless intermediate nodes. We prove that for m ∈ O(1), it is necessary and sufficient to use packet headers that are Θ(log log n) bits long.