Distributed path finding algorithm for stream multicast

Authors:
Xiaofeng Jiang
Affiliations:
Design and Development Centre, SISIR, 1 Science Park Drive, Singapore 0511
Venue:
Computer Communications
Year:
1993

Citing 4
Cited 0

Steiner problem in networks: a survey

Networks
Multicast routing in datagram internetworks and extended LANs

ACM Transactions on Computer Systems (TOCS)
Routing broadband multicast streams

Computer Communications
Reverse path forwarding of broadcast packets

Communications of the ACM

Quantified Score

Hi-index	0.24

Visualization

Abstract

Stream multicast has been proposed to address the special requirements of a range of new communications services such as desktop video conferencing. Although there have been discussions on its centralized path finding algorithms, no schemes have yet been designed on a fully distributed basis. This paper presents a distributed algorithm for stream multicast path finding based on very limited local information. Simulation results show its performance is comparable with that of the centralized algorithms.