Interest-based connections in peer-to-peer networks

Electrical computers and digital processing systems: multicomput – Computer-to-computer session/connection establishing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S217000, C709S207000

Reexamination Certificate

active

10119449

ABSTRACT:
Peers (p) monitor responses received from other peers (s, q) to requests for information and rate the responding peers on their ability to provide information of interest. When a responding peer (s) is discovered to frequently provide good results, the requesting peer (p) attempts to move closer to the responding peer (s) by creating a direct connection (p-s) with that peer and thereby promote the “good” peer to an “immediate” peer. If such a promotion would result in too many direct connections, the least important immediate peer is demoted to an “indirect” peer. The criteria (Imp) used for evaluating the relative importance of at least the immediate peers is preferably a time weighted average (Imp*(t)=α·Imp(t)+β·Imp*(t−1)) that also measures consistency and reliability and preferably includes factors not only representative of the peer's ability to provide requested information (Hits), but also of its proximity to the source of that information (1/Hops) so that it can prove that information efficiently. This leads to clusters of peers with similar interests, and in turn reduces the depth of searches typically required to achieve good results.

REFERENCES:
patent: 5557786 (1996-09-01), Johnson, Jr.
patent: 5701467 (1997-12-01), Freeston
patent: 5974236 (1999-10-01), Sherman
patent: 6055568 (2000-04-01), Adams
patent: 6502175 (2002-12-01), Krishnan et al.
patent: 6742023 (2004-05-01), Fanning et al.
patent: 6791949 (2004-09-01), Ryu et al.
patent: 6836463 (2004-12-01), Garcia-Luna-Aceves et al.
patent: 6857012 (2005-02-01), Sim et al.
patent: 6961310 (2005-11-01), Cain
patent: 7027773 (2006-04-01), McMillin
patent: 2002/0059025 (2002-05-01), Kim et al.
patent: 2002/0073204 (2002-06-01), Dutta et al.
patent: 2002/0184311 (2002-12-01), Traversat et al.
patent: 2003/0051051 (2003-03-01), O'Neal et al.
patent: 2003/0079003 (2003-04-01), Burr
patent: 2003/0120662 (2003-06-01), Vishik
MacGregor et al., Connectability: A Performance Metric for Reconfigurable Transport Networks, Dec. 1993, IEEE, whole document.
M. Ramanathan et al., “Finding good peers in peer-to-peer networks” (Unpublished).
M. Ramanathan et al.; IEEE; “Finding Good Peers in Peer-to-Peer Networks” (Published Apr. 15, 2002).
INRIA “Is the Internet Fractal? The Multicast Power Law Revisited”; C. Adjih et al., No. 4157.
The gnutella homepage. In http://www.gnutella.wego.com.
The limewire homepage. In http://www.limewire.com.
The morpheus homepage. In http://www.musiccity.com.
B. Yang and H. Garcia-Molina. Comparing hybrid peer-to-peer systems.In.Proceedings of Very Large Databases, Rome, Italy, Sep. 2001.
L.A. Adamic, et al., Search in power-law networks. In http://www.parc.xerox.com/istl/groups/iea/papers/plsearch/.
C. Adjih et al. Multicase tree structure and the power law. In http://www.cs.purdue.edu/homes/spa/papers/multicast.ps. (Unpublished).
C. Adjih et al. Multicase tree structure and the power law. In http://www.cs.purdue.edu/homes/spa/papers/multicast.ps. (Published Jan. 6, 2002).
The akamai homepage. In http://www.akamai.com.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Interest-based connections in peer-to-peer networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Interest-based connections in peer-to-peer networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interest-based connections in peer-to-peer networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3848449

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.