A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An Overlay Tree Building Control Protocol
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Improving Internet multicast with routing labels
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Hi-index | 0.00 |
For better performance and to avoid member service annoyance that results due to joining-clients' waiting durations and time-outs when there are more than one clients wanting to join concurrently for Broadcasting Mini-system's service, this paper proposes a more efficient and better performing Overlay Tree Building Control Protocol by modifying and extending the basic mechanisms building the conventional TBCP. The modified-TBCP (m TBCP) proposed is performance-effective mechanism since it considers the case of how fast will children, concurrently, find and join new parents when paths to existing parents are broken. Besides utilizing partial topology information, m TBCP also does a LAN-out-degree-check. If the selected child-parent-pair falls under the same LAN, that selected parent does not change the out-degree status. The performance comparison, in terms of Overlay-Connection-Throughput and Latency against Group-Size-Growth, between m TBCP, the HMTP, and the traditional TBCP is done through simulations and the results conclude in favour of the proposed m TBCP.