A Capacitated Minimum-Cost Multicast Routing Algorithm for Multirate Multimedia Distribution
Resource
ISPACSU_U05. (EI), 211-216
Journal
Proceedings of 2004 International Symposium on Intelligent Signal Processing and Communication Systems 2004 ISPACS 2004
Pages
211-216
Date Issued
2005
Date
2005
Author(s)
Cheng, H.C.
Lin, F.Y.S.
Abstract
In this paper, we attempt to solve the problem of min-cost multicast routing for multirate multimedia distribution in a capacitated network. More specifically, for (i) a given network topology (ii) a given link capacity (iii) the destinations of a multicast group and (iv) the bandwidth requirement of each destination, we attempt to find a feasible routing solution to minimize the cost of a multicast tree for multirate multimedia distribution. This problem has been proved to be NP-hard. First, we model this problem as an optimization problem, which is a linear programming problem. Then, we propose a simple heuristic algorithm and an optimization based heuristic to solve this problem. Computational experiments have been performed on regular networks, random networks, and scale-free networks.
SDGs
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
43.pdf
Size
23.21 KB
Format
Adobe PDF
Checksum
(MD5):e1afb591c85f20ede1c548e3bd523cb8