Efficient multicast tree algorithm in ATM networks

Authors:
Xiaohua Jia;C. H. Lee;Kia Makki;Niki Pissinou
Affiliations:
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, University of Nevada, Las Vegas, NV 89154, USA;Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, LA 70508, USA
Venue:
Computer Communications
Year:
1996

Citing 4
Cited 1

MBONE: the multicast backbone

Communications of the ACM
Multicast routing extensions for OSPF

Communications of the ACM
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

Performance study of buffer management schemes under multicasting traffic in ATM switching nodes

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Many applications of ATM networks require the multicast function, which sends the same packet to a group of destinations. This paper proposes an algorithm for multicast routing in ATM networks. We define the network cost of a routing as the combination of the cost of establishing connections, the cost of overall bandwidth and the cost of overall switchings. Our routing algorithm works on the original topology of ATM networks with physical switches and physical links, and considers the different switching functionalities of VP (virtual path) switches and VC (virtual channel) switches in the networks. It generates an optimal multicast routing with the minimal overall network cost. Simulations have been done to compare the quality of the routing generated by our algorithm with those of other major algorithms.