Research note: Delay constrained distributed multicast routing algorithm

Authors:
Yongjun Im;Youngseok Lee;Sunjoo Wi;Yanghee Choi
Affiliations:
Department of Computer Engineering, Seoul National University, Kwanak-ku, Seoul 151-742, Korea;Department of Computer Engineering, Seoul National University, Kwanak-ku, Seoul 151-742, Korea;Department of Computer Engineering, Seoul National University, Kwanak-ku, Seoul 151-742, Korea;Department of Computer Engineering, Seoul National University, Kwanak-ku, Seoul 151-742, Korea
Venue:
Computer Communications
Year:
1997

Citing 7
Cited 5

Steiner problem in networks: a survey

Networks
Multicast routing in datagram internetworks and extended LANs

ACM Transactions on Computer Systems (TOCS)
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
An architecture for wide-area multicast routing

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications
RSVP: a new resource ReSerVation Protocol

IEEE Network: The Magazine of Global Internetworking

A survey of combinatorial optimization problems in multicast routing

Computers and Operations Research
A distributed multicast routing algorithm for real-time applications in wide area networks

Journal of Parallel and Distributed Computing
Streaming cache placement problems: complexity and algorithms

International Journal of Computational Science and Engineering
Distributed multicast tree generation with dynamic group membership

Computer Communications
Distributed algorithms for the constrained routing problem in computer networks

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

We propose a delay-constrained multicast algorithm that finds a multicast tree between one source node and multiple destination nodes in communication networks. The proposed algorithm, which provides multicasting and guaranteed QoS (Quality-of-Service) services at the network layer, is also designed to find a reduced-cost routing tree. We present a distributed algorithm by which the routing tree is computed through a single round of message exchange between network nodes, consequently reducing the number of messages and the accompanying computation time. The proposed algorithm is verified by simulation, and it is shown that it exhibits superior performance compared to existing algorithms.