Name
Abstract | ||
|---|---|---|
Multimedia applications are becoming increasingly important as networks are now capable to carry continuous media traffic, such as voice and video, to the end user. Most of the multimedia applications need multicast support too. In dynamic multicasting, destination nodes can join and leave the group during the communication period. Total or partial rerouting can optimize the tree cost to some extent. But rerouting for optimization is complex as cell-ordering at ATM switches has to be preserved. Optimum Steiner tree is NP-complete and therefore the present problem too. We propose a heuristic centralized routing algorithm, which optimize the total cost of the Steiner tree over the whole session period, where information about the joining and leaving of participants are available, at the time s/he actually joins. With this algorithm, the average hop-length from source to destination has also reduced considerably. The efficiency of our algorithm and comparison with other proposed algorithms is shown by various simulation results. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1002/ett.4460100208 | EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS |
Field | DocType | Volume |
Heuristic,Joins,Random graph,Telecommunications network,Steiner tree problem,Computer science,Computer network,Greedy algorithm,Multicast,Computational complexity theory,Distributed computing | Journal | 10 |
Issue | ISSN | Citations |
2 | 1120-3862 | 6 |
PageRank | References | Authors |
0.70 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Debasish Chakraborty | 1 | 77 | 11.66 |
| Norio Shiratori | 2 | 818 | 137.59 |
| Goutam Chakraborty | 3 | 363 | 56.31 |
| Chotipat Pornavalai | 4 | 87 | 9.93 |