Scalable Feedback Aggregating (SFA) Overlay for Large-scale P2P Trust Management


Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and availability. If the storage associated with replication is not monitored and provisioned, the underlying benefits may not be realized. Resource constraints, performance scalability, and availability present diverse considerations novel overlay formation Availability and performance scalability, in terms of response time, are improved by aggressive replication, whereas resource constraints limit total storage in the network. Identification and eradication of redundant data pose fundamental problems for such systems. In this paper, we present a novel and efficient solution that addresses availability and scalability with respect to management of redundant data. We proposed a scalable feedback aggregating (SFA) overlay for large-scale P2P evaluation. Specifically, we address the problem of duplicate elimination in the context of systems connected over an unstructured peer-to-peer network in which there is no a priori binding between an object and its location. Through theoretical and experimental analysis, the SFAbased trust model shows remarkable enhancement in scalability for large-scale P2P computing, as well as has greater adaptability and accuracy in handling various dynamic behaviors of peers.

until the query has traveled a certain radius. Future reference is not present in routing table. flooding techniques. Delay due to absence of Routing Updating Randomized Algorithm (random Search). do not scale.  To find a file. Despite its simplicity and robustness. in general. a peer sends out a query to its neighbors on the overlay. Deficiency of an Existing System:    table.  In large networks.Existing System  In purely networks such as blind search through flooding mechanisms is usually explored for resource discovery. .  Blind Search. the probability of a successful search may decrease dramatically without significantly enlarging the flooding radius.

Proposed System  In order to improve search performance.  The basic assumption is that if a peer p0 has a particular file required by another peer p. The key problem is what information is actually eligible to guide the search. shortcuts from peer p to several peers p0 are established in order to expedite subsequent search processes. guided search. .  According to previous queries. Proposed System Features:  Guided Search using probabilistic searching method.  We can able to maintain the massive amount of unnecessary storage and computation. Theoretical performance results conclude that in a constant probability to be requested by p in the future.

0 or Windows 2000 or XP .   We define the “truth value” using Fuzzy. Fast Search Technique based on credibilistic ATMS. Software Requirements Platform Program Language Operating System : JDK 1.  Routing updating table. Randomized File Searching Methods. RMI : Microsoft Windows NT 4.5 : JAVA.

Hardware Requirements Processor RAM Hard Drive Monitor Keyboard Mouse Disk Space : Pentium IV Processor : 512 MB : 40 GB : 14” VGA COLOR MONITOR : 104 Keys : Logitech Serial Mouse : 1 GB .

Sign up to vote on this title
UsefulNot useful