Analysis of reliable multicast algorithms for local networks

Authors:
Paul V. Mockapetris
Affiliations:
USC Information Sciences Institute, Marina del Rey, California
Venue:
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Year:
1983

Citing 3
Cited 5

A Majority consensus approach to concurrency control for multiple copy databases

ACM Transactions on Database Systems (TODS)
A note on reliable full-duplex transmission over half-duplex links

Communications of the ACM
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles

Process Groups and Group Communications: Classifications and Requirements

Computer
Edmund: a multicast kernel for distributed application

SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
Distributed process groups in the V Kernel

ACM Transactions on Computer Systems (TOCS)
Simulation of a Novel Leader Election Protocol with the Use of Petri Nets

DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
End-to-end approach to large-scale multimedia dissemination

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Local networks offer unique opportunities for supporting multicast transmissions. This paper describes and analyzes several families of multicast algorithms for local networks. The algorithms examined provide reliable service by dealing with the effects of transmission errors.