Electrical computers and digital processing systems: multicomput – Computer network managing – Network resource allocating
Reexamination Certificate
2002-10-01
2009-06-30
Coulter, Kenneth R (Department: 2441)
Electrical computers and digital processing systems: multicomput
Computer network managing
Network resource allocating
C718S105000
Reexamination Certificate
active
07555553
ABSTRACT:
A peer-to-peer system includes a plurality of nodes. The plurality of nodes includes at least an initial node and a neighboring node. The initial node is operable to determine whether to place an object at either the initial node or another node in the system based on a comparison of storage utilizations for the initial node and the neighboring node.
REFERENCES:
patent: 5915095 (1999-06-01), Miskowiec
patent: 6711571 (2004-03-01), Putzolu
patent: 6826711 (2004-11-01), Moulton et al.
patent: 7069295 (2006-06-01), Sutherland et al.
patent: 2001/0034795 (2001-10-01), Moulton et al.
patent: 2002/0114341 (2002-08-01), Sutherland et al.
patent: 2003/0182421 (2003-09-01), Faybishenko et al.
patent: 2004/0215622 (2004-10-01), Dubnicki et al.
patent: 2005/0108203 (2005-05-01), Tang et al.
patent: 2005/0240591 (2005-10-01), Marceau et al.
A. Rowstron et al.; Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems; Proceedings of 18th IFIP/ACM international Conference on Distributed Systems Platforms (Middleware 2001); Nov. 2001.
M. Castro et al.; “Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays”; Techinical Report MSR-TR-2003-52; pp. 1-11; Sep. 2003.
B. Zhao et al.; Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing; Report No. UCB/CSD-01-1141; Univ. of California at Berkeley, Computer Science Department; pp. 1-27; Apr. 2001.
A. Rowstron et al.; Storage Management and Caching in PAST, a Large-Scale, Persistent Peer-to-Peer Storage Utility; Proceedings of the 18th ACM Symposium on Operating Systems Principles; pp. 188-201; 2001.
Hung-Chang Hsiao et al.; Modeling and Evaluating Peer-to-Peer Storage ARchitectures; Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS '02); Apr. 15, 2002-Apr. 19, 2002.
Bolosky, W. et al., “Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs”, SIGMETRICS 2000, Santa Clara, CA.
Clarke, I. et al., “Freenet: A Distributed Anonymous Information Storage and Retrieval System”, Workshop on Design Issues in Anonymity and Unobservability, 2000, Berkeley, CA.
Dabek, F. et al., “Wide-Area Cooperative Storage with CFS”, Symposium on Operating Systems Principles (SOSP), 2001, Banff, Canada.
Druschel, P. et al., PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility, IEEE 0-7695-1040-X/01, 2001.
Kleiman, S.R.,“Vnodes: An Architecture for Multiple File System Types in Sun UNIX”, USENIX Conference, 1986, Atlanta, GA.
Kubiatowicz, J. et al., “OceanStore: An Architecture for Global-Scale Persistent Storage”, ASPLOS 2000, MA.
Ratnasamy, S. et al., “A Scalable Content-Addressable Network”, ACM SIGCOMM 2001, San Diego, CA.
Roselli, D., et al., “A Comparison of File System Workloads”, USENIX Annual Technical Conference, 2000, San Diego, CA.
Stoica, I. et al., “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications”, ACM SIGCOMM 2001, San Diego, CA.
Mahalingam Mallik
Tang Wenting
Xu Zhichen
Zhang Zheng
Coulter Kenneth R
Hewlett--Packard Development Company, L.P.
LandOfFree
Placing an object at a node in a peer-to-peer system based... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Placing an object at a node in a peer-to-peer system based..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Placing an object at a node in a peer-to-peer system based... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4085016