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

Multicast Routing
Optimal Path
Routing Problem
Multicast
Costs
Path
Approximation algorithms
Delay Time
Vertex of a graph
Time delay
Approximation Algorithms
Consecutive
Exceed
Simulation
Model
Graph in graph theory

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.

An optimal path selection algorithm for static and mobile multicast routing problems. / Tajima, Shigeto; Fujii, Masakazu; Funabiki, Nobuo; Yokohira, Tokumi; Tsunemura, Kazufumi; Higashino, Teruo.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2343 Springer Verlag, 2002. p. 193-202 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2343).

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

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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2343, Springer Verlag, pp. 193-202, International Conference on Information Networking, ICOIN 2002, Cheju Island, Korea, Republic of, 1/30/02.
Tajima S, Fujii M, Funabiki N, Yokohira T, Tsunemura K, Higashino T. 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. Springer Verlag. 2002. p. 193-202. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Tajima, Shigeto ; Fujii, Masakazu ; Funabiki, Nobuo ; Yokohira, Tokumi ; Tsunemura, Kazufumi ; Higashino, Teruo. / An optimal path selection algorithm for static and mobile multicast routing problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2343 Springer Verlag, 2002. pp. 193-202 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8f2fb1c5fd944fcc95a9519830d5005b,
title = "An optimal path selection algorithm for static and mobile multicast routing problems",
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.",
author = "Shigeto Tajima and Masakazu Fujii and Nobuo Funabiki and Tokumi Yokohira and Kazufumi Tsunemura and Teruo Higashino",
year = "2002",
language = "English",
isbn = "3540442561",
volume = "2343",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "193--202",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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

M3 - Conference contribution

AN - SCOPUS:84944052383

SN - 3540442561

VL - 2343

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

SP - 193

EP - 202

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

PB - Springer Verlag

ER -