By Topic

A scaleable multicast routing algorithm for IP-ATM-IP networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Arozullah ; Dept. of Electr. Eng., Catholic Univ. of America, Washington, DC, USA ; S. G. Batsell

Dynamic multicasting is needed in many military communication systems using IP-over-ATM networking. This paper considers transmission of IP multicast packets over a large IP-ATM-IP communication network and presents a multicast routing algorithm called multipoint-to-multipoint routing path with branches (MMRPWB) for the ATM portion of this network. The algorithm presents, for each multicast group, steps for establishing a single multicast routing path that can be used by all sources (senders) in this multicast group to multicast messages to all other group members simultaneously. Generation of the path starts at an arbitrary member node that sends a routing cell through the network. On receiving a copy of the cell a node can decide to join the path if it is a member of the multicast group. Otherwise it retransmits the cell forward. The algorithm eliminates the need for the establishment of individual point-to-multipoint routes for each sender member of a multicast group and reduces overall number of SVCs required. The resulting multipoint-to-multipoint path uses only point-to-point SVCs and hence eliminates the problems associated with using point-to-multipoint SVCs. It also eliminates the need for dynamic IP to ATM address resolution. The performance of this multipoint-to-multipoint path has been shown to be superior to those of multicast routes established by using minimal spanning tree (MST), multicast open shortest path first (MOSPF) and core based tree (CBT) algorithms under similar conditions in terms of delay, join and leave times, robustness, scaleability and difficulties of physical implementation

Published in:

Military Communications Conference, 1996. MILCOM '96, Conference Proceedings, IEEE  (Volume:2 )

Date of Conference:

21-24 Oct 1996