Abstract
We have developed a novel algorithm to adjust link-bandwidths of a given multicast tree, which sends a message with sizer from a source to a multiple destinations taking into consideration pipelined router. The algorithm that we have developed tries to minimize the end-to-end delay time and resources such as bandwidths of a multicast tree, and performs admirably well in any given multicast tree. Our evaluation shows that the proposed algorithm dramatically reduces the end-to-end delay time and resources reserved to satisfy the time-constraints.
| Original language | English |
|---|---|
| Pages (from-to) | 7-18 |
| Number of pages | 12 |
| Journal | Journal of Supercomputing |
| Volume | 33 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - Jul 2005 |
Keywords
- bandwidth
- cut-through
- multicast
- pipeline
- quality of service