Résumé
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.
| langue originale | Anglais |
|---|---|
| titre | IEEE ATM Workshop, Proceedings |
| Pages | 186-194 |
| Nombre de pages | 9 |
| Les DOIs | |
| état | Publié - 1998 |
| Modification externe | Oui |
| Evénement | Proceedings of the 1998 IEEE ATM Workshop 'Meeting the Challenges of Deploying the Global Broadband Network Infrastucture' - Fairfax, VA, USA Durée: 26 mai 1998 → 29 mai 1998 |
Conférence
| Conférence | Proceedings of the 1998 IEEE ATM Workshop 'Meeting the Challenges of Deploying the Global Broadband Network Infrastucture' |
|---|---|
| La ville | Fairfax, VA, USA |
| Période | 26/05/98 → 29/05/98 |
Empreinte digitale
Voici les principaux termes ou expressions associés à « Analysis of multi-cast routing algorithms for broadband networks ». Ces libellés thématiques sont générés à partir du titre et du résumé de la publication. Ensemble, ils forment une empreinte digitale unique.Citer cette ressource
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver