TY - GEN

T1 - An optimal path selection algorithm for static and mobile multicast routing problems

AU - Tajima, Shigeto

AU - Fujii, Masakazu

AU - Funabiki, Nobuo

AU - Yokohira, Tokumi

AU - Tsunemura, Kazufumi

AU - Higashino, Teruo

PY - 2002

Y1 - 2002

N2 - In this paper, we present a new approximation algorithm called OPSAM (Optimal Path Selection Algorithm for Multicast) for the static multicast routing problem and the newly defined mobile multicast routing problem. Given a graph with the cost and the delay associated to each edge, a source node, a destination node set, and a delay time limit, the first problem requires finding a multicast tree such that the total cost is not only minimized, but also the delay along any path from the source to a destination does not exceed its limit. OPSAM first extracts plural path candidates for each destination to satisfy the delay constraint simultaneously. Then, it iteratively selects better paths among candidates for finding a low-cost tree within a short computation time. The performance of OPSAM is verified through simulations in Waxman model and Tiers model, where OPSAM is better than the best existing algorithm BSMA, especially for Tiers model instances. The second problem requires finding a sequence of multicast trees to follow changes of mobile user locations, such that the sum of total tree costs and the difference between two consecutive trees is minimized. The simulation results show the performance of OPSAM is better than BSMA.

AB - In this paper, we present a new approximation algorithm called OPSAM (Optimal Path Selection Algorithm for Multicast) for the static multicast routing problem and the newly defined mobile multicast routing problem. Given a graph with the cost and the delay associated to each edge, a source node, a destination node set, and a delay time limit, the first problem requires finding a multicast tree such that the total cost is not only minimized, but also the delay along any path from the source to a destination does not exceed its limit. OPSAM first extracts plural path candidates for each destination to satisfy the delay constraint simultaneously. Then, it iteratively selects better paths among candidates for finding a low-cost tree within a short computation time. The performance of OPSAM is verified through simulations in Waxman model and Tiers model, where OPSAM is better than the best existing algorithm BSMA, especially for Tiers model instances. The second problem requires finding a sequence of multicast trees to follow changes of mobile user locations, such that the sum of total tree costs and the difference between two consecutive trees is minimized. The simulation results show the performance of OPSAM is better than BSMA.

UR - http://www.scopus.com/inward/record.url?scp=84944052383&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84944052383&partnerID=8YFLogxK

U2 - 10.1007/3-540-45803-4_18

DO - 10.1007/3-540-45803-4_18

M3 - Conference contribution

AN - SCOPUS:84944052383

SN - 3540442561

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 193

EP - 202

BT - Information Networking

A2 - Chong, Ilyoung

A2 - Chong, Ilyoung

PB - Springer Verlag

T2 - International Conference on Information Networking, ICOIN 2002

Y2 - 30 January 2002 through 1 February 2002

ER -