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

Shigeto Tajima, Masakazu Fujii, Nobuo Funabiki, Tokumi Yokohira, Kazufumi Tsunemura, Teruo Higashino

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages193-202
Number of pages10
Volume2343
ISBN (Print)3540442561
Publication statusPublished - 2002
EventInternational Conference on Information Networking, ICOIN 2002 - Cheju Island, Korea, Republic of
Duration: Jan 30 2002Feb 1 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2343
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on Information Networking, ICOIN 2002
CountryKorea, Republic of
CityCheju Island
Period1/30/022/1/02

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Tajima, S., Fujii, M., Funabiki, N., Yokohira, T., Tsunemura, K., & Higashino, T. (2002). An optimal path selection algorithm for static and mobile multicast routing problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2343, pp. 193-202). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2343). Springer Verlag.