Abstract/Description
The effective cooperation and coordination of nodes is necessary for performance improvement in the P2P network. In this paper, we focus on the problem of maintaining considerable amount of cooperation and friendship in P2P networks of selfish peers. For this purpose we will analyze the performance of SLAC. It is a simple algorithm that maintains excessive levels of cooperation and friendship in a network while performing tasks. A simulation model ldquoPrisoners' Dilemmardquo is presented that puts this algorithm to work in a Peersim environment. For providing random sampling, an existing protocol called ldquoNEWSCASTrdquo has been used. The extensive computer simulations show that the technique is scalable, robust and decentralized.
Keywords
Peer to peer computing, Genetic mutations, Social network services, Computational modeling, Network topology, Performance analysis, Sampling methods, Computer simulation, Robustness
Location
Eiffel 3
Session Theme
Networks - I
Session Type
Other
Session Chair
Dr. Javed Khan
Start Date
15-8-2009 2:45 PM
End Date
15-8-2009 3:05 PM
Recommended Citation
Akram, M. U., & Tariq, A. (2009). Networks - I: Cooperative friendship networks through SLAC with Newscast. International Conference on Information and Communication Technologies. Retrieved from https://ir.iba.edu.pk/icict/2009/2009/3
Networks - I: Cooperative friendship networks through SLAC with Newscast
Eiffel 3
The effective cooperation and coordination of nodes is necessary for performance improvement in the P2P network. In this paper, we focus on the problem of maintaining considerable amount of cooperation and friendship in P2P networks of selfish peers. For this purpose we will analyze the performance of SLAC. It is a simple algorithm that maintains excessive levels of cooperation and friendship in a network while performing tasks. A simulation model ldquoPrisoners' Dilemmardquo is presented that puts this algorithm to work in a Peersim environment. For providing random sampling, an existing protocol called ldquoNEWSCASTrdquo has been used. The extensive computer simulations show that the technique is scalable, robust and decentralized.
