COI code: ICCSE01_001
Paper Language: English
How to Download This Paper
For Downloading the Fulltext of CIVILICA papers please visit the orginal Persian Section of website.
Authors A Comprehensive Overview of Existing Methods forOvercoming Selfish Nodes in p2p NetworksMaryam Bozorgan - Ministry of Science Research and Technology, Institue for Higher Educatin ACECR, Khouzestan, iran
Behrang Barekatati - Faculty of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran
Mehdi Seydali - Faculty of computer and electrical engineering,Tarbiat modares University, Tehran, Iran
Abstract:In recent years, thanks to the extensive worldwide interactions, it is expected that Internet broadcast video content in anefficient and flexible manner. Peer-to-Peer (P2P) networks, compared to servicing client networks and also based on content distribution,are complex, but more scalable and considerably reduced costs. P2P networks have provided a driving mechanism in which uploadcapacity of peers can be in accordance with the effective delivery of a network service. In some extent, bandwidth capacities and systemmemory of end-users also are used in overlay P2P network and content distribution load is transferred from servicing and networkcomponents to end users of the system; and since administration of overlay P2P networks is as a distributed management, the manner ofconnection weaknesses handling and the way the peers cooperate would impact on the quality of the received video. In this review study,the Peer-to-Peer video streaming system is investigated along with challenges posed by it as method of streaming video, the heterogeneistyof bandwidth, congestion in the network, resiliency, node churn, traffic control and the quality of cooperation among distributor andrequesting peers, and consequently selfish peers and free riders as well as the effect of mentioned issues on quality of received videos andoptimum solutions to eliminate or reduce the effects of free riders. Finally, an efficient comparison is made for a variety of proposedsolutions by which we can realize the advantages and disadvantages of each method, representing this as an effective key to future efficientsolutions.
Keywords:p2p network, free rider, incentive mechanism, selfish behavior
COI code: ICCSE01_001
how to cite to this paper:If you want to refer to this article in your research, you can easily use the following in the resources and references section:
Bozorgan, Maryam; Behrang Barekatati & Mehdi Seydali, 2016, A Comprehensive Overview of Existing Methods forOvercoming Selfish Nodes in p2p Networks, International Conference on Engineering and Computer Science, نجف آباد, دانشگاه آزاد اسلامي واحد نجف آباد, https://www.civilica.com/Paper-ICCSE01-ICCSE01_001.htmlInside the text, wherever referred to or an achievement of this article is mentioned, after mentioning the article, inside the parental, the following specifications are written.
First Time: (Bozorgan, Maryam; Behrang Barekatati & Mehdi Seydali, 2016)
Second and more: (Bozorgan; Barekatati & Seydali, 2016)
For a complete overview of how to citation please review the following CIVILICA Guide (Citation)
The University/Research Center Information:
Type: Research Center
Paper No.: 5344
in University Ranking and Scientometrics the Iranian universities and research centers are evaluated based on scientific papers.
Research Info Management
Export Citation info of this paper to research management softwares
New Related Papers
- Broadcast on wireless mesh networks using neighbor nodes
- Transfer Learning betweenSars and Ebola Pathogen Systems for Virus-Host Protein-Protein Interaction Prediction
- Extreme Value Copulas and Tail Dependence
- An Auto-Indexing Method for Persian Text
- A Novel Approach For Energy Optimization In Distributed Databases In Wireless Network Applications
The Above articles are recently indexed in the related subjects
Iran Scientific Advertisment Netword
Share this paper
WHAT IS COI?
COI is a national code dedicated to all Iranian Conference and Journal Papers. the COI of each paper can be verified online.