Name
Abstract | ||
|---|---|---|
This paper addresses the problem of routing many-to-many multicast connections with bandwidth reservation. We devise a rout- ing algorithm which provides not only connectivity but also bandwidth among multicast members at a low cost. After briefly addressing the problem complexity (NP-Complete), we move on to design polynomial time algorithms, for scalability purposes, some of which with worst case bounds on performance. A simulation study is used to illustrate the al- gorithms' performance and trade offs. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0037193 | HPCN Europe |
Keywords | DocType | Volume |
multicast trees,bandwidth reservation,low cost | Conference | 1401 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-64443-1 | 4 |
PageRank | References | Authors |
0.82 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dirceu Cavendish | 1 | 85 | 13.71 |
| Aiguo Fei | 2 | 101 | 11.08 |
| Mario Gerla | 3 | 16465 | 2117.01 |
| Raphael Rom | 4 | 1165 | 240.85 |