Y. Amir, D. Dolev, S. Kramer, and D. Mahlki. Membership algoritms for multicast communication groups. In 6th Intl. Workshop on Distributed Algorithms proceedings (WDAG), pages 292--312, Nov. 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Lightweight Probabilistic Broadcast - Eugster, Guerraoui, Handurukande.. (2001) (45 citations) (Correct)
....guarantees, and reliable protocols do not scale well. The well known Reliable Multicast Transport Protocol (RMTP) 24] for instance generates a fload of positive acknowledgements from receivers, loading both the network and the sender, where these acknowledgements converge. Any form of membership ([21, 15, 2]) is hidden by such network level protocols, which makes them consequently also difficult to exploit with more dynamic dissemination (filtering, e.g. 22] emphasizing the need for new forms of application level broadcast. Gossip based broadcast algorithms. Gossip based broadcast algorithms ....
Y. Amir, D. Dolev, S. Kramer, and D. Mahlki. Membership algoritms for multicast communication groups. In 6th Intl. Workshop on Distributed Algorithms proceedings (WDAG), pages 292--312, Nov. 1992.
Lightweight Probabilistic Broadcast - Eugster, Guerraoui, Handurukande.. (2001) (45 citations) (Correct)
No context found.
Y. Amir, D. Dolev, S. Kramer, and D. Mahlki. Membership algoritms for multicast communication groups. In 6th Intl. Workshop on Distributed Algorithms proceedings (WDAG), pages 292--312, Nov. 1992.
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