Efficient person search mechanism in peer-to-peer networks

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

C709S239000, C709S240000, C709S242000, C709S243000, C709S244000

Reexamination Certificate

active

08055788

ABSTRACT:
An efficient person search method utilizing human communications characteristics such as close social network, user-dependent hot list, and high skewness in access popularity. This method makes use of hot lists in the routing process and clusters people of the same community together in the search graph, thereof creating a “small-world” effect to minimize the hop counts routing would have to go through in a Peer-to-Peer environment.

REFERENCES:
patent: 2004/0003041 (2004-01-01), Moore et al.
patent: 2004/0098503 (2004-05-01), Zhang et al.
patent: 2004/0249970 (2004-12-01), Castro et al.
patent: 2005/0220134 (2005-10-01), Lin
patent: 2005/0223102 (2005-10-01), Zhang et al.
patent: 2006/0190715 (2006-08-01), Miller
patent: 2007/0280464 (2007-12-01), Hughes et al.
patent: 2008/0115125 (2008-05-01), Stafford et al.
patent: 2008/0130516 (2008-06-01), You et al.
A. Rowstron and P. Druschel, “Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems”. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pp. 329-350, Nov. 2001.

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

Efficient person search mechanism 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 Efficient person search mechanism in peer-to-peer networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient person search mechanism in peer-to-peer networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4312723

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