Providing fault tolerance for peer-to-peer streaming service

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Because each node in the peer-to-peer network is autonomous, it is difficult to provide deterministic service on the network. In this paper, we propose a framework for a fault tolerant streaming service on a peer-to-peer network. The proposed framework provides a service migration-based fault tolerance mechanism to cope with both node/link failures and link state changes. Simulation results show that using a small-sized buffer, the proposed framework can provide hiccup-free streaming service and the overhead required to maintain the up-to-date node state information is negligible. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Kang, S., Kim, H., & Yeom, H. Y. (2003). Providing fault tolerance for peer-to-peer streaming service. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2720, 73–82. https://doi.org/10.1007/978-3-540-45076-4_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free