By Topic

An optimal VP-based multicast routing in ATM 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
$31 $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

1 Author(s)
Sang-Baeg Kim ; Labs. of Telecommunication Networks Res., Korea Telecom, Seoul, South Korea

A number of multicast tree algorithms have been proposed in the literature. Their approach to modeling the problem has some drawbacks in applications for ATM networks since only a single multipoint connection request is considered in the presence of link capacity constraints. In this paper, we present a detailed mathematical model for the generalized multicast arborescence (i.e., a roofed out-tree) problem in which there are a number of concurrent multipoint connections of various traffic types. Point-to-point connections are also considered as a special case of multipoint connections. A solution to the model determines, in the most economical way, an establishment of VPCs with reserved capacity and multicast arborescences using the established VPCs for multipoint connections. This model is a natural extension of the virtual channel assignment problem introduced by Kim (1995). Algorithms and numerical results are presented

Published in:

INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE  (Volume:3 )

Date of Conference:

24-28 Mar 1996