A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
Topology-aware overlay networks for group communication
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Distributing streaming media content using cooperative networking
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A Host-Based Multicast (HBM) Solution for Group Communications
ICN '01 Proceedings of the First International Conference on Networking-Part 1
An Overlay Tree Building Control Protocol
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
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
FTTH-Enhanced Mini-System m TBCP-Based Overlay Construction and Evaluation
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A survey of proposals for an alternative group communication service
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Adaptive processing overlay multicasting for web-based broadcasting provides efficient service for multi-users sharing application with single sources. A mechanism is proposed by locally applying children-parents-role swapping in trees by adopting a swapping function in overlay protocol. Performance efficient results for real-time, concurrent service is achieved with stream trees with locally swapped nodes having maximum peak RTTs of about 0.6 seconds - better than TBCP and HMTP. The proposed scheme does well in terms of session connections, especially when multi-users’ number grows. Number of hosts against group size after the local swapping seems to be the best and maximum average relative delay penalty (ARDP) of less than 6 units indicates that the new mechanism welcomes modest services in stream groups with affordable penalty, regardless of hosts’ number. The swapped trees perform better in terms of costs, average RTT, number of hosts, and ARDP.