Abstract
We analyze a family of heuristics for multi-cast routing intended for directed networks which ranges from a simple `naive' algorithm to iterative algorithms where a partial tree is extended in each iteration. Apart from the comparison of the algorithms complexity and efficiency expressed in terms of multi-casting tree cost, we study the length of the connection paths which can be critical from the quality of service viewpoint in broadband networks. It is shown that in general, for a given network example, the lower the tree cost the larger the average and maximum connection path lengths. In this context we propose two heuristics which provide a trade-off between features of the simple `naive' algorithm and the sophisticated algorithm proposed by Takahashi.
| Original language | English |
|---|---|
| Title of host publication | IEEE ATM Workshop, Proceedings |
| Pages | 186-194 |
| Number of pages | 9 |
| DOIs | |
| Publication status | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 IEEE ATM Workshop 'Meeting the Challenges of Deploying the Global Broadband Network Infrastucture' - Fairfax, VA, USA Duration: 26 May 1998 → 29 May 1998 |
Conference
| Conference | Proceedings of the 1998 IEEE ATM Workshop 'Meeting the Challenges of Deploying the Global Broadband Network Infrastucture' |
|---|---|
| City | Fairfax, VA, USA |
| Period | 26/05/98 → 29/05/98 |
ASJC Scopus subject areas
- General Engineering
Fingerprint
Dive into the research topics of 'Analysis of multi-cast routing algorithms for broadband networks'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver