Peer-to-peer system and method with improved utilization

Details Peer-to-peer system and method with improved utilization Peer-to-peer system and method with improved utilization

2011-01-11

2011-01-11

Etienne, Ario (Department: 2457)

Electrical computers and digital processing systems: multicomput

Multicomputer data transferring via shared memory

C709S226000, C709S232000, C707S622000, C707S620000, C707S831000

Reexamination Certificate

active

07870218

ABSTRACT:
The present invention is directed to improving utilization in a peer-to-peer network. Each node in a peer-to-peer network is assigned a number of preferably fixed-size storage slots proportional to the node storage, a first portion of which is allocated to storage zones and a second portion of which is allocated as a free slot reserve. In accordance with an embodiment of an aspect of the invention, this split of a storage zone is delayed until the storage zone becomes full, referred to herein as “lazy splitting”. In accordance with an embodiment of another aspect of the invention, it is advantageous to allocate more storage slots at a node than its actual physical capacity referred to herein as “oversubscription”. In accordance with an embodiment of another aspect of the invention, each physical node is allocated at least one storage zone, even as a new node is added to the system.

REFERENCES:
patent: 5544347 (1996-08-01), Yanai et al.
patent: 5742792 (1998-04-01), Yanai et al.
patent: 5909692 (1999-06-01), Yanai et al.
patent: 6092066 (2000-07-01), Ofek
patent: 6101497 (2000-08-01), Ofek
patent: 6108748 (2000-08-01), Ofek et al.
patent: 6421730 (2002-07-01), Narad et al.
patent: 6704730 (2004-03-01), Moulton et al.
patent: 6728223 (2004-04-01), Litzenberger et al.
patent: 6807632 (2004-10-01), Carpentier et al.
patent: 6810398 (2004-10-01), Moulton
patent: 6826711 (2004-11-01), Moulton et al.
patent: 6857059 (2005-02-01), Karpoff et al.
patent: 6904457 (2005-06-01), Goodman
patent: 6938042 (2005-08-01), Aboulhosn et al.
patent: 6985928 (2006-01-01), Zhang et al.
patent: 7069295 (2006-06-01), Sutherland et al.
patent: 7263596 (2007-08-01), Wideman et al.
patent: 7370083 (2008-05-01), Husain et al.
patent: 7499980 (2009-03-01), Gusler et al.
patent: 7555553 (2009-06-01), Zhang et al.
patent: 2001/0037323 (2001-11-01), Moulton et al.
patent: 2002/0048284 (2002-04-01), Moulton et al.
patent: 2002/0107722 (2002-08-01), Laurin et al.
patent: 2002/0147815 (2002-10-01), Tormasov et al.
patent: 2002/0161983 (2002-10-01), Milos et al.
patent: 2002/0194340 (2002-12-01), Ebstyne et al.
patent: 2003/0149750 (2003-08-01), Franzenburg
patent: 2003/0179750 (2003-09-01), Hasty, Jr. et al.
patent: 2003/0187853 (2003-10-01), Hensley et al.
Ratnasamy et al., “A scalable content addressable network”, , Aug. 2001, ACM, pp. 161-172.
Stoica, I. et al., “Chord: a Scalable peer-to-peer lookup service for internet applications”, in SIGCOMM'01, Aug. 2001.
Ratnasamy, S. et al., “A Scalable Content-Addressable Network”, in SIGCOMM'01, Aug. 2001.
Hildrum, K. et al., “Distributed Object Location in a Dynamic Network”, in SPAA'01, Aug. 2002.
Malkhi, D. et al., “Viceroy: A Scalable and Dynamic Emulation of the Butterfly”, in PODC'02, Jul. 2002.
Cox, R. et al., “Serving DNS Using a Peer-to-Peer Lookup Service”, in 1st International Workshop on Peer-to-Peer Systems, 2002.
Rowstron, A. et al., “Pastry” Scalable, decentralized object location and routing for large-scale peer-to-peer systems; in Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, Nov. 2001.
Zhao, B.Y. et al., “Tapestry: An Infrastructure for Fault-tolerant Wide-Area Location and Routing”, Technical Report No. UCB/CSD-01-1141, Computer Science Division, University of California, Apr. 2001.
Maymounkov, P. et al., “Kademlia: A peer-to-peer information system based on the XOR metric”, in Proceedings of the 1st International Workshop on Peer-to-Peer Systems, 2002.
Rowstron, A. et al., “Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility”, in Symposium on Operating Systems Principles, 2001.
Byers, J. et al., “Simple load balancing for distributed hash tables”, in 2nd International Workshop on Peer-to-Peer Systems, 2002.
I. Stoica et al., “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications”, Proceedings of the 2001 ACM SIGCOMM '01 Conference, pp. 149-160 (Aug. 2001).
B.Y. Zhao et al., “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing”, Tech. Rep. UCB/CSD-01-1141, Univ. of California at Berkeley, Computer Science Department Apr. 2001.
A. Rowstron and P. Druschel, “Pastry: Scalable, distributed 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.
S. Ratnasamy et al., “A Scalable Content Addressable Network”, Proc. of ACM SIGCOMM, pp. 161-172, Aug. 2001.

Affiliated with

Also associated with

Rating

Peer-to-peer system and method with improved utilization does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Peer-to-peer system and method with improved utilization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Peer-to-peer system and method with improved utilization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2703151