Electrical computers and digital processing systems: multicomput – Computer network managing – Network resource allocating
Reexamination Certificate
2005-11-08
2005-11-08
Cardone, Jason D (Department: 2145)
Electrical computers and digital processing systems: multicomput
Computer network managing
Network resource allocating
C709S225000
Reexamination Certificate
active
06963915
ABSTRACT:
The invention relates to a method and apparatus for requesting data from one of a plurality of servers. A virtual network of nodes is generated in response to a data request. A first node on the virtual network of nodes is chosen randomly, and a path generated from the first node to the root on the virtual network. At least one node on the path is mapped to a respective one of the plurality of servers and data is requested from a server. The node may be mapped to the server using the method and apparatus for distributing a request to one of a plurality of resources of the present invention.
REFERENCES:
patent: 4922417 (1990-05-01), Churm et al.
patent: 5109511 (1992-04-01), Nitta et al.
patent: 5287499 (1994-02-01), Nemes
patent: 5325525 (1994-06-01), Shan et al.
patent: 5477582 (1995-12-01), Yamashita
patent: 5511208 (1996-04-01), Boyles et al.
patent: 5542087 (1996-07-01), Neimat et al.
patent: 5596719 (1997-01-01), Ramakrishnan et al.
patent: 5659786 (1997-08-01), George et al.
patent: 5768552 (1998-06-01), Jacoby
patent: 5774660 (1998-06-01), Brendel et al.
patent: 5774668 (1998-06-01), Choquier et al.
patent: 5894556 (1999-04-01), Grimm et al.
patent: 5915095 (1999-06-01), Miskowiec
patent: 5968121 (1999-10-01), Logan et al.
patent: 5978378 (1999-11-01), Van Seters et al.
patent: 5987470 (1999-11-01), Meyers et al.
patent: 5996013 (1999-11-01), Delp et al.
patent: 6006264 (1999-12-01), Colby et al.
patent: 6009275 (1999-12-01), DeKoning et al.
patent: 6029219 (2000-02-01), Michizono et al.
patent: 6058423 (2000-05-01), Factor
patent: 6078946 (2000-06-01), Johnson
patent: 6085296 (2000-07-01), Karkhanis et al.
patent: 6108703 (2000-08-01), Leighton et al.
patent: 6134532 (2000-10-01), Lazarus et al.
patent: 6167438 (2000-12-01), Yates et al.
patent: 6175870 (2001-01-01), Gawlick et al.
patent: 6191786 (2001-02-01), Eyzaguirre et al.
patent: 6209095 (2001-03-01), Anderson et al.
patent: 6230196 (2001-05-01), Guenthner
patent: 6240466 (2001-05-01), McKeehan et al.
patent: 6256675 (2001-07-01), Rabinovich
patent: 6260039 (2001-07-01), Schneck et al.
patent: 6341311 (2002-01-01), Smith et al.
patent: 6377975 (2002-04-01), Florman
patent: 6430618 (2002-08-01), Karger et al.
patent: 6466570 (2002-10-01), Low et al.
patent: 6553420 (2003-04-01), Karger et al.
Kun-Lung Wu et al., “Load balancing and hot spot relief for hash routing among a collection of proxy caches”, IEEE Inter. Conf. on Distributed Computing Systems, p. 536-543, Jun. 1999.
Andreolini, Mauro et al., “Performance study of dispatching algorithms in multi-tier web architectures”, ACM SIGMETRICS Performance Evaluation Review, Special Issue on PAPA 2002, vo. 30, is. 2, p. 10-20, 2002.
Bestavros, Azer. “Speculative Data Dissemination and Service to Reduce Server Load, Network Traffic and Service Time in Distributed Information Systems.” InProceedings of ICDE'96: The 1996 International Conference on Data Engineering, Mar. 1996, 4 pgs.
Carter, J. Lawrence, et al. “Universal Classes of Hash Functions.”Journal of Computer and System Sciences, vol. 18, No. 2, Apr. 1979, pp. 143-154, 991-993.
Chankhunthod, Anawat, et al. “A Hierarchical Internet Object Cache.” InUSENIX Proceedings, Jan. 1996, pp. 153-163.
Cohen, J. et al. “Cache Array Routing Protocol v1.1” Sep. 29, 1997, pp. 1-8, http://www.watersprings.org/pub/id/draft-vinod-carp-v1-01.txt, downloaded on Nov. 20, 2001.
Cormen, Thomas H., et al.Introduction to Algorithms, The MIT Press, Cambridge, Massachusetts, 1994, pp. 219-243.
Danzig, Peter, “NetCache Architecture and Deployment” Feb. 2, 1997, pp. 1-10, http://wwwcache.ja.net/events/workshop/01/Netcache-3_2.pdf, downloaded on Nov. 20, 2001.
Deering, Stephen, et al. “Multicast Routing in Datagram Internetworks and Extended LANs.”ACM Transactions on Computer Systems, vol. 8, No. 2, May 1990, pp. 85-110.
Devine, Robert. “Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm.” InProceedings of 4th International Conference on Foundations of Data Organizations and Algorithms, 1993, pp. 101-114.
Doi, Katsuo, “Super Proxy Script” Copyright 1996-2000, pp. 1-9, http:/
aragw.sharp.co.jp/sps/, downloaded on Nov. 20, 2001.
Feeley, Michael, et al. “Implementing Global Memory Management in a Workstation Cluster.” InProcceedings of the 15th ACM Symposium on Operating Systems Principles, 1995, pp. 201-212.
Floyd, Sally, et al. “A Reliable Multicast Framework for Light-Weight Sessions and Application Level Framing.” InProceeding of ACM SIGCOMM'95, pp. 342-356.
Fredman, Michael, et al. “Storing a Sparse Table with 0(1) Worst Case Access Time.”Journal of the Association for Computing Machinery, vol. 31., No. 3, Jul. 1984, pp. 538-544.
Grigni, Michelangelo, et al. “Tight Bounds on Minimum Broadcasts Networks.”SIAM Journal of Discrete Mathematics, vol. 4, No. 2, May 1991, pp. 207-222.
Gwertzman, James, et al. “The Case for Geographical Push-Caching.”Technical Report HU TR 34-94(excerpt), Harvard University, DAS, Cambridge, MA 02138, 1994, 2 pgs.
Gwertzman, James, et al. “World-Wide Web Cache Consistency.” InProceedings of the 1996 USENIX Technical Conference, Jan. 1996, 8 pgs.
Karger, David, et al. “Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.” InProceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, May 1997, pp. 654-663.
Litwin, Withold, et al. “LH—A Scaleable, Distributed Data Structure.”ACM Transactions on Database Systems, vol. 21, No. 4, Dec. 1996, pp. 480-525.
Malpani, Radhika, et al. “Making World Wide Web Caching Servers Cooperate.” InProceedings of World Wide Web Conference, 1996, 6 pgs.
Microsoft Corporation, “Cache Array Routing Protocol” Copyright 2001, pp. 1-2, http://www.microsoft.com/TechNet/prodtechnol/isa/proddocs/isadocs/m_c_c_arrayrouting.asp, downloaded on Nov. 20, 2001.
Naor, Moni, et al. “The Load, Capacity and Availability of Quorum Systems.” InProceedings of the 35th IEEE Symposium on Foundations of Computer Science, Nov. 1994, pp. 214-225.
Nisan, Noam. “Psuedorandom Generators for Space-Bounded Computation.” InProceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, May 1990, pp. 204-212.
Palmer, Mark, et al. “Fido: A Cache that Learns to Fetch.” InProceedings of the 17th International Conference on Very Large Data Bases, Sep. 1991, pp. 255-264.
Panigrahy, Rina.Relieving Hot Spots on the World Wide Web. Massachusetts Institute of Technology, Jun. 1997, pp. 1-66.
Peleg, David, et al. “The Availability of Quorum Systems.”Information and Computation123, 1995, 210-223.
Plaxton, C. Greg, et al. “Fast Fault-Tolerant Concurrent Access to Shared Objects.” InProceedings of 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 570-579.
Rabin, Michael. “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance.”Journal of the ACM, vol. 36, No. 2, Apr. 1989, pp. 335-348.
Ravi, R., “Rapid Rumor Ramification: Approximating the Miniumum Broadcast Time.” InProceedings of the 35th IEEE Symposium on Foundations of Computer Science, Nov. 1994, pp. 202-213.
Ross, Keith W., “Hash-Routing for Collections of Shared Web Caches” Sep. 1997, 1-21, http://citeseer.nj.nec.com/90285.html, downloaded on Nov. 20, 2001.
Schmidt, Jeanette, “Chernoff-Hoeffding Bounds for Applications with Limited Independence.” InProceedings of the 4th ACS-SIAM Symposium on Discrete Algorithms, 1993, pp. 331-340.
Sharp Corp., “Briefing on Super Proxy Script” Copyright 1996-1998, pp. 1-11, http:/
aragw.sharp.co.jp/sps-e.html, downloaded on Nov. 20, 2001.
Tarjan, Robert Endre, et al. “Storing a Sparse Table.”Communications of the ACM, vol. 22, No. 11, Nov. 1979, pp.
Karger David
Lehman Eric
Leighton F. Thomson
Levine Matthew
Lewin Daniel
Cardone Jason D
Goodwin & Procter LLP
Massachussetts Institute of Technology
LandOfFree
Method and apparatus for distributing requests among a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for distributing requests among a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for distributing requests among a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3484774