Multicast routing with multiple QoS constraints in ATM networks
Journal
Information sciences
Journal Volume
124
Journal Issue
1
Pages
29-57
Date Issued
2000
Author(s)
Wu, J.-J.
Hwang, R.-H.
HSUEH-I LU
Abstract
Recently, more and more applications provide multiparty communication services, e.g., video conferencing, distance learning, etc. Therefore, the routing problem of multicast with multiple quality of service (QoS) constraints becomes more important. For example, in order to ensure smooth play back of audio and video data, a video conference requires guarantee on both end-to-end delay and loss probability. In this paper, we solve the multiple-constraint multicast problem by extending three single-constraint Steiner tree algorithms: (1) the constrained shortest path tree (CSPT), (2) the algorithm proposed by Kompella, Pasquale, and Polyzos (KPP), and (3) the bounded shortest multicast algorithm (BSMA). We also propose a novel multiple-constraint multicast routing algorithm based on genetic algorithms, called MCMGA. These four algorithms are evaluated via simulations on different sizes of random graphs. Our numerical results show that, in most cases, MCMGA yields solutions of the least cost. The costs of the solutions obtained by our extended BSMA are also very competitive.
Type
journal article