Short Headers Suffice for Communication in a DAG with Link Failures

Authors:
Faith E. Fich;Andreas Jakoby
Affiliations:
-;-
Venue:
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Year:
2000

Citing 14
Cited 1

End-to-end communication in unreliable networks

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Tight bounds for the sequence transmission problem

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Bootstrap network resynchronization (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Reliable communication over unreliable channels

Journal of the ACM (JACM)
Recoverable sequence transmission protocols

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
A note on reliable full-duplex transmission over half-duplex links

Communications of the ACM
Tight Size Bounds for Packet Headers in Narrow Meshes

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Polynomial end-to-end communication

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Header-size lower bounds for end-to-end communication in memoryless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers a number of communication problems, including end-to-end communication and multicats, in networks whose underlying graphs are directed and acyclic and whose links are subject to permanent failures. In the case that each processor has separate input queues for each in-edge, we present protocols for these problems that use single bit headers. In the case that each processor has a single input queue for all of its in-edges, we prove that 驴(logd)-bit headers are necessary and sufficient, where d is the indegree of the graph.