Name
Abstract | ||
|---|---|---|
Since usually the network resource is limited, the abilities to do resource reservation in advance, as well as efficient dynamic multicasting when destination nodes can join and leave the group during the communication period, are essential in all distributed multi-party applications. Total or partial rerouting of multicast tree for dynamic multicast groups can optimize the tree cost to some extent but they are complex. Furthermore, optimal multicast r outing has been proved an NP-complete problem. In this paper, we propose an efficient dynamic multicast routing algorithm, which optimize the total cost of the Steiner tree over the whole session period in advance resource reservation environment, where information about the resource reservation (i.e. leaving times of participants at the time of joining) are available. The efficiency of our algorithm over other existing algorithms is shown by various simulation results. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/ICPADS.2000.857741 | ICPADS |
Keywords | DocType | ISBN |
steiner tree,efficient dynamic multicast,multicast tree,efficient dynamic multicasting,optimal multicast r outing,advance resource reservation environment,dynamic multicast group,resource reservation,tree cost,dynamic multicast routing,network resource,cost function,simulation,np complete problem,routing,quality of service,information science,information technology,resource allocation,network resources,protocols | Conference | 0-7695-0568-6 |
Citations | PageRank | References |
2 | 0.43 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chotipat Pornavalai | 1 | 87 | 9.93 |
| Debasish Chakraborty | 2 | 77 | 11.66 |
| Norio Shiratori | 3 | 818 | 137.59 |
| Goutam Chakraborty | 4 | 363 | 56.31 |