Multi‐factors oriented study of P2P Churn

Yang, Dong; Zhang, Yu-Xiang; Zhang, Hongke; Wu, Tin-Yu; Chao, Han‐Chieh

doi:10.1002/dac.1001

Cited by 12 publications

(8 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When a parent peer leaves, the video playback in a child peer will be interrupted if a new parent peer cannot be found before the buffered content in child peers is drained. The authors in [19] study various factors related to peer random leave, and use them to analyze and evaluate P2P protocol.…”

Section: Xor-based Fec Schemementioning

confidence: 99%

Reliable Consideration of P2P-Based VoD System With Interleaved Video Frame Distribution

Chang

Chen

Hung

2014

IEEE Systems Journal

View full text Add to dashboard Cite

Following advancements in digital technology and broadband communication technology, video streaming service has become a necessity in the next generation Internet. A peerto-peer (P2P) network structure is widely employed for video streaming applications due to its flexible extensibility and ability to share data stream loading among different peer nodes. This paper considers the problems of network packet loss and native peer random leave in a P2P network environment. An XOR-based frame loss protection scheme is proposed, based on the recently proposed interleaved video frame distribution P2P architecture to mitigate the effects of peer leave and network packet loss. The proposed scheme is not only capable of recovering lost packets, but can also resist the peer-leaving churn. Analysis and simulation results reveal that the proposed scheme has better performance in a frame loss rate with less redundant overhead.Index Terms-Frame protection, peer churn, peer-to-peer (P2P) video-on-demand (VoD), reliability.

show abstract

Section: Xor-based Fec Schemementioning

confidence: 99%

Reliable Consideration of P2P-Based VoD System With Interleaved Video Frame Distribution

Chang

Chen

Hung

2014

IEEE Systems Journal

View full text Add to dashboard Cite

show abstract

“…Skip Graph Nodes: Each node in the Skip Graph overlay represents a single peer in the real world. In our system model, the Skip Graph is churn-free [57] i.e., there is no arrival and departure of nodes, and all the nodes are considered to be available all the time. We assume that the Skip Graph nodes can communicate directly with each other in the underlying network once they know each other's addresses.…”

Section: System Modelmentioning

confidence: 99%

Decentralized and locality aware replication method for DHT-based P2P storage systems

Hassanzadeh-Nazarabadi

Küpçü

Özkasap

2018

Future Generation Computer Systems

View full text Add to dashboard Cite

Skip Graph, a type of DHT, plays an important role in P2P cloud storage applications, where nodes publicly or privately store, share, and access data. Nowadays P2P storage systems are widely using replication to support data availability, reliability, and maintainability. With replication, the main consideration is determining peers to replicate the data. Traditional replication algorithms are partially randomized and employ rigid assumptions about nodes' distribution. This results in high access delay between nodes and their closest replicas, which degrades the system performance. We propose GLARAS, a dynamic and fully decentralized locality aware replication method for Skip Graph. In contrast to the traditional algorithms, which replicate based on strict assumptions about the distribution of nodes, GLARAS aims to approximate the underlying distribution by interacting with a very small subset of nodes and minimize the average access delay of replication accordingly. To ensure GLARAS performs at its best, we also propose a dynamic fully decentralized landmark-based locality aware name ID assignment namely LANS. This ensures that the nodes' distances in the overlay and the underlying network are consistent with each other. Our extensive experiments and analysis results demonstrate that compared to the best existing decentralized locality aware replication, GLARAS improves the average access delay of public and private replications by about 13% and 17%, respectively. Likewise, in comparison to the best existing decentralized locality aware name ID assignment, LANS improves the locality awareness of name IDs and the end-to-end latency of search queries in Skip Graph with the gains of about 19% and 8%, respectively. The average replication's access delay of a Skip Graph-based P2P storage system that employs GLARAS and LANS has an improvement gain of about 2.7 over the best state-of-the-art algorithms. Since Skip Graph is a DHT, any other DHT-based P2P storage service would benefit from our solution.

show abstract

“… Robustness to network dynamics (churn) [6]  Incentive to vote Voting as a phenomenon, decentralized and centralized, is the subject of much research. The work [7] describes taxonomy of vote systems.…”

Section: Requirements To Distributed Vote Systemsmentioning

confidence: 99%

New hybrid distributed voting algorithm

Evseenko

2013

2013 International Conference on Computer Applications Technology (ICCAT)

View full text Add to dashboard Cite

Increasing data volumes requires additional rating techniques. Reputation systems are the subject of much research. There are various techniques to rate content that facilitate the search of quality content. Page rank, citation index and votes from users are some rating examples. In the article I focus on decentralized vote systems. The article reviews several distributed vote designs. I list the distributed vote requirements. A new hybrid algorithm is proposed which operates in the structured overlay P2P DHT Kademlia network.

show abstract

Multi‐factors oriented study of P2P Churn

Cited by 12 publications

References 21 publications

Reliable Consideration of P2P-Based VoD System With Interleaved Video Frame Distribution

Reliable Consideration of P2P-Based VoD System With Interleaved Video Frame Distribution

Decentralized and locality aware replication method for DHT-based P2P storage systems

New hybrid distributed voting algorithm

Contact Info

Product

Resources

About