7/29/2019 1.Scalable Feedback Aggregating (SFA)

1/6

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

ManagementAbstract:-

Distributed peer-to-peer systems rely on voluntaryparticipation of peers to effectively manage a storagepool. In such systems, data is generally replicated forperformance and availability. If the storage associated

with replication is not monitored and provisioned, theunderlying benefits may not be realized. Resourceconstraints, performance scalability, and availabilitypresent diverse considerations novel overlay formationAvailability and performance scalability, in terms ofresponse time, are improved by aggressive replication,whereas resource constraints limit total storage in thenetwork. Identification and eradication of redundant data

pose fundamental problems for such systems. In thispaper, we present a novel and efficient solution thataddresses availability and scalability with respect tomanagement of redundant data. We proposed a scalablefeedback aggregating (SFA) overlay for large-scale P2Pevaluation. Specifically, we address the problem ofduplicate elimination in the context of systems connectedover 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 SFA-based trust model shows remarkable enhancement inscalability for large-scale P2P computing, as well as hasgreater adaptability and accuracy in handling variousdynamic behaviors of peers.

7/29/2019 1.Scalable Feedback Aggregating (SFA)

2/6

Existing System

In purely networks such as blind search through flooding mechanisms

is usually explored for resource discovery.

To find a file, a peer sends out a query to its neighbors

on the overlay, until the query has traveled a certain

radius. Despite its simplicity and robustness, flooding

techniques, in general, do not scale.

In large networks, the probability of a successful search

may decrease dramatically without significantlyenlarging the flooding radius.

Deficiency of an Existing System:

Blind Search.

Future reference is not present in routing table.

Delay due to absence of Routing Updating

table.

Randomized Algorithm (random Search).

7/29/2019 1.Scalable Feedback Aggregating (SFA)

3/6

Proposed System

In order to improve search performance, guided search. The key

problem is what information is actually eligible to guide the search.

The basic assumption is that if a peer p0 has a particular

file required by another peer p, Theoretical performance

results conclude that in a constant probability to berequested by p in the future.

According to previous queries, shortcuts from peer p to

several peers p0 are established in order to expedite

subsequent search processes.

We can able to maintain the massive amount of

unnecessary storage and computation.

Proposed System Features:

Guided Search using probabilistic searching method.

7/29/2019 1.Scalable Feedback Aggregating (SFA)

4/6

Randomized File Searching Methods.

Routing updating table.

Fast Search Technique based on credibilistic ATMS.

We define the truth value using Fuzzy.

Software Requirements

Platform : JDK 1.5

Program Language : JAVA, RMI

Operating System : Microsoft Windows NT 4.0 or

Windows 2000or XP

7/29/2019 1.Scalable Feedback Aggregating (SFA)

5/6

Hardware Requirements

Processor : Pentium IV Processor

RAM : 512 MB

Hard Drive : 40 GB

Monitor : 14 VGA COLOR MONITOR

Keyboard : 104 Keys

Mouse : Logitech Serial Mouse

Disk Space : 1 GB

7/29/2019 1.Scalable Feedback Aggregating (SFA)

6/6