Fich, End-to-end Communication, Proceedings of OPODIS '98, Amines, France, 1998, pages 37--43. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Complexity of End-to-End Communication in Memoryless Networks - Adler, Fich (1998) (4 citations) (Correct)
....with O(log p) bit headers that uses O(log p) bits of storage at R and O(p log p) bits of storage at S. By incorporating a version of the alternating bit protocol along each path, the protocol can also tolerate packet losses. More detail concerning related work can be found in the survey article [F98]. 3 Reliable Delivery of One Message In this section we provide lower and upper bounds for the delivery of a single message . Our lower bounds are proven in the static fault model, and thus trivially also apply to the dynamic fault model. The protocols for our upper bounds are also described for ....
Fich, End-to-end Communication, Proceedings of OPODIS '98, Amines, France, 1998, pages 37--43.
The Complexity of End-to-End Communication in Memoryless Networks - Adler, Fich (1998) (4 citations) (Correct)
....with O(log p) bit headers that uses O(log p) bits of storage at R and O(p log p) bits of storage at S. By incorporating a version of the alternating bit protocol along each path, the protocol can also tolerate packet losses. More detail concerning related work can be found in the survey article [F98]. 3 Reliable Delivery of One Message In this section we provide lower and upper bounds for the delivery of a single message. Our lower bounds are proven in the static fault model and, thus, also apply to the dynamic fault model. The protocols for our upper bounds are also described for the static ....
Fich, End-to-end Communication, Proceedings of 2nd OPODIS, Amiens, France, 1998, pages 37--43.
Tight Size Bounds for Packet Headers in Narrow Meshes - Adler, Fich, Goldberg.. (2000) (3 citations) Self-citation (Fich) (Correct)
....packet. A natural question to ask is the following: how large must packet headers be for reliable communication This problem is addressed in [AF99] part of a large body of research on the end to end communication problem [AAF 94] AAG 97] AG88] AMS89] APV96] DW97] KOR95] LLT98] [F98]. The end to end communication problem is to send information from one designated processor (the sender S) to another designated processor (the receiver R) over an unreliable communication network. This is a fundamental problem in distributed computing, since (a) communication is crucial to ....
F.E. Fich, End-to-end Communication, Proceedings of the 2nd International Conference on Principles of Distributed Systems, (1998), 37-43.
Tight Size Bounds for Packet Headers in Narrow Meshes - Adler, Fich, Goldberg.. (2000) (3 citations) Self-citation (Fich) (Correct)
No context found.
Faith E. Fich, End-to-end Communication, Proceedings of the 2nd International Conference on Principles of Distributed Systems, Amiens, France, 1998, pages 37-43.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC