Show simple item record

dc.contributor.advisorUlusoy, Özgür
dc.contributor.authorKarakaya, K. Murat
dc.date.accessioned2016-01-08T18:04:15Z
dc.date.available2016-01-08T18:04:15Z
dc.date.issued2008
dc.identifier.urihttp://hdl.handle.net/11693/14662
dc.descriptionAnkara : The Department of Computer Engineering and The Institute of Engineering and Science of Bilkent University, 2008.en_US
dc.descriptionThesis (Ph.D.) -- Bilkent University, 2008.en_US
dc.descriptionIncludes bibliographical references leaves 119-127.en_US
dc.description.abstractThe peer-to-peer (P2P) network paradigm has attracted a significant amount of interest as a popular and successful alternative to traditional client-server model for resource sharing and content distribution. However, researchers have observed the existence of high degrees of free riding in P2P networks which poses a serious threat to effectiveness and efficient operation of these networks, and hence to their future. Therefore, eliminating or reducing the impact of free riding on P2P networks has become an important issue to investigate and a considerable amount of research has been conducted on it. In this thesis, we propose two novel solutions to reduce the adverse effects of free riding on P2P networks and to motivate peers to contribute to P2P networks. These solutions are also intended to lead to performance gains for contributing peers and to penalize free riders. As the first solution, we propose a distributed and localized scheme, called Detect and Punish Method (DPM), which depends on detection and punishment of free riders. Our second solution to the free riding problem is a connection-time protocol, called P2P Connection Management Protocol (PCMP), which is based on controlling and managing link establishments among peers according to their contributions. To evaluate the proposed solutions and compare them with other alternatives, we developed a new P2P network simulator and conducted extensive simulation experiments. Our simulation results show that employing our solutions in a P2P network considerably reduces the adverse effects of free riding and improves the overall performance of the network. Furthermore, we observed that P2P networks utilizing the proposed solutions become more robust and scalable.en_US
dc.description.statementofresponsibilityKarakaya, K Muraten_US
dc.format.extentxvii, 127 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectFree ridingen_US
dc.subjectperformance evaluationen_US
dc.subjectdistributed computingen_US
dc.subjectPeer-to-Peer networksen_US
dc.subject.lccTK5105.525 .K37 2008en_US
dc.subject.lcshPeer to peer architecture (Computer networks)en_US
dc.titleCounteracting free riding in pure peer-to-peer networksen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreePh.D.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record