Abstract
Multicast has become increasingly important as networks are used to carry continuous media traffic such as voice and video to the end user. In dynamic multicasting, destination nodes are joining and leaving the group during the communication period. A re-routing may produce an optimal route, but it is impractical for various reasons. A better routing could be possible, without re-routing, if the users behavior can be predicted. With the increasing popularity of advance resource reservation, it is possible to estimate the users' duration of staying time. And thus a better routing that can efficiently minimize the total cost of whole session is feasible. We propose a centralized heuristic routing algorithm, which optimize the total cost of the Steiner tree over the whole session period. The efficiency of our proposed algorithm over Greedy and Naive algorithm is shown by simulation results.
| Original language | English |
|---|---|
| Title of host publication | IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings |
| Place of Publication | Piscataway, NJ, United States |
| Publisher | IEEE |
| Pages | 463-466 |
| Number of pages | 4 |
| ISBN (Print) | 0780351460 |
| Publication status | Published - 1998 |
| Event | Proceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98) - Chiangmai, Thailand Duration: 1998 Nov 24 → 1998 Nov 27 |
Other
| Other | Proceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98) |
|---|---|
| City | Chiangmai, Thailand |
| Period | 98/11/24 → 98/11/27 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering