Efficient resource balancing through indirection

Details Efficient resource balancing through indirection Efficient resource balancing through indirection

2005-02-10

2010-06-01

Jalil, Neveen Abel (Department: 2165)

Data processing: database and file management or data structures

Data integrity

Statistics maintenance

Reexamination Certificate

active

07730038

ABSTRACT:
A method for locating a resource involves maintaining a capacity object configured to store server information for a plurality of servers, transmitting a resource request from a client to an indirection server comprising the capacity object, selecting one of the plurality of servers to service the resource request using server associated with the capacity object to obtain a selected server, and redirecting the resource request from the indirection server to the selected server.

REFERENCES:
patent: 6263350 (2001-07-01), Wollrath et al.
patent: 6360262 (2002-03-01), Guenthner et al.
patent: 6826580 (2004-11-01), Harris et al.
patent: 6839815 (2005-01-01), Kagami et al.
patent: 6842766 (2005-01-01), Brockway et al.
patent: 7136903 (2006-11-01), Phillips et al.
patent: 7246140 (2007-07-01), Therrien et al.
patent: 2001/0029525 (2001-10-01), Lahr
patent: 2002/0010783 (2002-01-01), Primak et al.
patent: 2002/0019879 (2002-02-01), Jasen et al.
patent: 2002/0023156 (2002-02-01), Chujo et al.
patent: 2002/0099843 (2002-07-01), Fruchtman et al.
patent: 2002/0103907 (2002-08-01), Petersen
patent: 2002/0161850 (2002-10-01), Ulrich et al.
patent: 2003/0084098 (2003-05-01), Lavin et al.
patent: 2003/0174648 (2003-09-01), Wang et al.
patent: 2004/0010593 (2004-01-01), Apostolopoulos et al.
patent: 2004/0103206 (2004-05-01), Hsu et al.
patent: 2006/0029076 (2006-02-01), Namihira et al.
A. Adya, et al.; “Farsite: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment”; Proceedings of the 5thSymposium on Operating Systems and Design Implementation OSDI; Dec. 2002 (14 pages).
I. Clarke, et al.; “Freenet: A Distributed Anonymous Information Storage and Retrieval System”; Lecture Notes in Computer Science; 2000 (21 pages).
J. Kubiatowicz, et al.; “OceanStore: An Architecture for Global-Scale Persistent Storage”; Proceedings of ACM ASPLOS; Nov. 2000 (12 pages).
A. Rowstron, et al.; “Storage Management and Caching in PAST, a Large-Scale, Peristent Peer-to-Peer Storage Utility”; Symposium on Operating Systems Principles; Oct. 2001 (13 pages).
S. Quinlan, et al.; “Venti: A New Approach to Archival Storage”; Proceedings of the FAST 2002 Conference on File and Storage Technologies; First USENIX Conference on File and Storage Technologies; Jan. 2002 (14 pages).
A. Muthitacharoen, et al.; “Ivy: A Read/Write Peer-to-Peer File System”; Proceedings of the 5thUSENIX Symposium on Operating Systems Design and Implementation (OSDI '02); Dec. 2002 (23 pages).
F. Dabek, et al.; “Towards a Common API for Structured Peer-to-Peer Overlays”; Proceedings of 2ndInternational Workshop on Peer-to-Peer Systems (IPTPS '03), Feb. 2003 (11 pages).
I. Stoica, et al.; “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications”; Proceedings of the SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications; Aug. 2001 (12 pages).
B. Zhao, et al.; “Tapestry: A Resilient Global-Scale Overlay for Service Deployment”; IEEE Journal on Selected Areas in Communications; Jan. 2004 (15 pages).
A. Rowstron, et al.; “Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems”; Lecture Notes in Computer Science; 2001 (22 pages).
C. Greg Plaxton, et al.; “Accessing Nearby Copies of Replicated Objects in a Distributed Environment”; ACM Symposium on Parallel Algorithms and Architectures; Jun. 1997 (23 pages).
M. Castro, et al.; “Practical Byzantine Fault Tolerance”; Symposium on Operating Systems Design and Implementation; Feb. 1999 (14 pages).
D. B. Terry, et al.; “Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System”; Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles; Dec. 1995 (12 pages).
D. Boneh, et al.; “Efficient Generation of Shared RSA Keys”; Journal of the ACM; 2001 (21 pages).
Y. Frankel, et al.; “Robust Efficient Distributed RSA-Key Generation”; Proc. 30thAnnual ACM Symposium on Theory of Computing (STOC); May 1998 (10 pages).

Affiliated with

Also associated with

Rating

Efficient resource balancing through indirection 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 resource balancing through indirection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient resource balancing through indirection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4193187