An optimal VP-based multicast routing in ATM networks

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.