A fast topology inference: a building block for network-aware parallel processing
Proceedings of the 16th international symposium on High performance distributed computing
CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
On Maximizing Tree Bandwidth for Topology-Aware Peer-to-Peer Streaming
IEEE Transactions on Multimedia
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Network Topology Inference Based on End-to-End Measurements
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
It is important to use an ALM (application layer multicast) tree with broad bandwidth to ensure the quality of streaming applications. However, when constructing an ALM tree without information on underlay traffic, we cannot know how much congestion there is in links. Therefore, if unexpected congestion in links occurs, the quality of ALM transmissions may worsen. However, no polynomial-time algorithms for constructing maximum-bandwidth ALM trees with information on underlay traffic exist. We regarded an underlay network as a tree network topology in our previous work, and presented a polynomial-time algorithm that was used to construct a maximum-bandwidth ALM tree. We also proved that we could obtain an optimal ALM tree. However, we had not yet evaluated our algorithm by simulation. Here, we discuss our evaluation of the algorithm we propose and a conventional one. We found our algorithm could achieve a broader bandwidth ALM tree at lower computational cost, especially in large networks.