A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dimensioning server access bandwidth and multicast routing in overlay networks
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Enabling conferencing applications on the internet using an overlay muilticast architecture
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Resilient multicast using overlays
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scattercast: an architecture for internet broadcast distribution as an infrastructure service
Scattercast: an architecture for internet broadcast distribution as an infrastructure service
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
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
Scalable application-layer multicast simulations with oversim
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
FaReCast: fast, reliable application layer multicast for flash dissemination
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Enabling decentralised microblogging through P2PVPNs
International Journal of Security and Networks
| Hi-index | 0.00 |
The purpose of this study is to maintain efficient backup routes for reconstructing overlay trees quickly. In most conventional methods, after a node leaves the trees, its children start searching for a new parent. In this reactive approach, it takes a lot of time to find a new parent. In this paper, we propose a proactive approach to finding a new parent over the overlay trees before the current parent leaves. A proactive approach allows a node to find its new parent immediately and switch to the backup route smoothly. In our proposal, the structure of the overlay tree using a redundant degree can decide a new parent without so much overhead. Simulations demonstrate our proactive approach can recover from node departures 2 times faster than reactive approaches, and can construct overlay trees with lower overheads than another proactive method. Additionally we carried out experiments over actual networks and their results support the effectiveness of our approach. We confirmed that our proposal achieved better streaming quality than conventional approaches.