Title

Networks - I: Cooperative friendship networks through SLAC with Newscast

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.

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

Share

COinS
 
Aug 15th, 2:45 PM Aug 15th, 3:05 PM

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.