activity
20092012
most citedReview of Replication Schemes for Unstructured P2P Networks

12 citations · 31 across the 6 of their papers we have counts for

collaborators

6 papers

eess.SY2012

Web Services Supply Chains: A Literature Review

V. Krithika, Dr. Arshinder Kaur, Dr. K. Chandra Sekaran

The aim of this review paper is to bring into light a potential area i.e., web services supply chains for research by analyzing the existing state of art in this. It is observed fr…

cs.NI2010★ 1 cited

Protocols for Bio-Inspired Resource Discovery and Erasure Coded Replication in P2P Networks

Sabu M. Thampi, K Chandra Sekaran

Efficient resource discovery and availability improvement are very important issues in unstructured P2P networks. In this paper, a bio-inspired resource discovery scheme inspired b…

cs.NI2010★ 11 cited

Survey of Search and Replication Schemes in Unstructured P2P Networks

Sabu M. Thampi, Chandra Sekaran K

P2P computing lifts taxing issues in various areas of computer science. The largely used decentralized unstructured P2P systems are ad hoc in nature and present a number of researc…

cs.NI2010★ 3 cited

`Q-Feed' - An Effective Solution for the Free-riding Problem in Unstructured P2P Networks

Sabu M. Thampi, Chandra Sekaran K

This paper presents a solution for reducing the ill effects of free-riders in decentralised unstructured P2P networks. An autonomous replication scheme is proposed to improve the a…

cs.NI2010★ 4 cited

An Enhanced Search Technique for Managing Partial Coverage and Free Riding in P2P Networks

Sabu M. Thampi, Chandra Sekaran K

This paper presents a Q-learning based scheme for managing the partial coverage problem and the ill-effects of free riding in unstructured P2P networks. Based on various parameter…

cs.DC2009★ 12 cited

Review of Replication Schemes for Unstructured P2P Networks

Sabu M. Thampi, K. Chandra Sekaran

To improve unstructured P2P system performance, one wants to minimize the number of peers that have to be probed for the shortening of the search time. A solution to the problem is…