Heuristics-based peer to peer message routing

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S241000, C709S244000, C370S355000, C370S360000

Reexamination Certificate

active

07376749

ABSTRACT:
The present invention is directed to a system and method for administering Peer to Peer (P2P) query messages within a P2P network. The present invention collects a plurality of metrics for each host that it is aware of in a P2P network, most often by a host information or query hit message. The metrics collected aid in determining a set of P2P hosts best able to fulfill a query message, without having knowledge of specific content. The metrics collected also aid in managing query messages in that they determine when to drop query messages or when to resend query messages.

REFERENCES:
patent: 6055568 (2000-04-01), Adams
patent: 6938095 (2005-08-01), Basturk et al.
patent: 2002/0147810 (2002-10-01), Traversat et al.
patent: 2002/0184311 (2002-12-01), Traversat et al.
patent: 2003/0009587 (2003-01-01), Harrow et al.
patent: 2003/0050959 (2003-03-01), Faybishenko et al.
patent: 2003/0177186 (2003-09-01), Goodman et al.
patent: 2003/0182428 (2003-09-01), Li et al.
patent: 2003/0204619 (2003-10-01), Bays
patent: 2004/0090913 (2004-05-01), Scudder et al.
patent: 2005/0080858 (2005-04-01), Pessach
Crespo, Garcia-Molina: “Routing indices for Peer-to-Peer systems” XP002252824, Jul. 2, 2002, Vienna, Austria.
Crespo, Garcia-Molina: Routine Indices for Peer to Peer Systems: ICDCS 2002 22ndInternational Conference on Distributed Computing Systems, Jul. 2-5, 2002, XPOO2252824 Vienna, Austria.
Abstract, p. 3, left-hand column, pasragraph 3.1 Query, Processing. In. a. Distributed. Sear Chp. P2P2.S p. 4, left-hand column, paragraph 4. Routing,Indices, p. 7, left-hand column, paragraph 7.1 Modeling. Search. Mechanisms. in.a.p2p System p. 8.
Tang, Xu, Mahalingam: “Peersearch: Efficient Information Retrieval in Peer-to-Peeer Networks” Hewlett-Packard, Jul. 12, 2002, XP002252825.
Page 1, paragraph 1 Introduction; p. 6, paragraph 5, Related. Work.
Saroiu, Krishna Gummadi, Gribble: A measurement sudy of Peer to Peer file sharing systems: Proceedings of Multimedia Computing and Networking 2002 MMCN'02, Jan. 2002, XP002252826 San Jose, CA, USA, paragraph '4 . . . To.Peer.Ro.Peer.System. Designes!
Sam Joseph: Neurogrid: Semantically Routing queries in Peer to Peer Netwokrs: Peer to Peer Computing and Networking 2002, vol. 2376, No. 2002, May 19-24, 2002, pp. 202-214, XP002252827, Pisa, Italy, the whole document.
Abstract, p. 3, left-hand column, pasragraph 3.1 Query, Processing. In. a. Distributed. Sear Chp. P2P2.S p. 4, left-hand column, paragraph 4. Routing,Indices, p. 7, left-hand column, paragraph 7.1 Modeling. Search. Mechanisms. In.a.p2p System p. 8, date unknown.
Page 1, paragraph 1 Introduction; p. 6, paragraph 5, Related. Work, date unknown.

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

Heuristics-based peer to peer message routing does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-2809575

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