Global hosting system

Electrical computers and digital processing systems: multicomput – Computer network managing – Network resource allocating

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

709105, 709219, 709223, 709224, 709235, G06F 1300

Patent

active

061087033

ABSTRACT:
The present invention is a network architecture or framework that supports hosting and content distribution on a truly global scale. The inventive framework allows a Content Provider to replicate and serve its most popular content at an unlimited number of points throughout the world. The inventive framework comprises a set of servers operating in a distributed manner. The actual content to be served is preferably supported on a set of hosting servers (sometimes referred to as ghost servers). This content comprises HTML page objects that, conventionally, are served from a Content Provider site. In accordance with the invention, however, a base HTML document portion of a Web page is served from the Content Provider's site while one or more embedded objects for the page are served from the hosting servers, preferably, those hosting servers near the client machine. By serving the base HTML document from the Content Provider's site, the Content Provider maintains control over the content.

REFERENCES:
patent: 4922417 (1990-05-01), Churm et al.
patent: 5287499 (1994-02-01), Nemes
patent: 5341477 (1994-08-01), Pitkin et al.
patent: 5542087 (1996-07-01), Neimat et al.
patent: 5638443 (1997-06-01), Stefik et al.
patent: 5646676 (1997-07-01), Dewkett et al.
patent: 5715453 (1998-02-01), Stewart
patent: 5740423 (1998-04-01), Logan et al.
patent: 5751961 (1998-05-01), Smyk
patent: 5761507 (1999-12-01), Govett
patent: 5774660 (1998-06-01), Brendel et al.
patent: 5777989 (1998-07-01), McGarvey
patent: 5802291 (1998-09-01), Balick et al.
patent: 5832506 (1998-11-01), Kuzma
patent: 5856974 (1999-01-01), Gervais et al.
patent: 5870559 (1999-02-01), Leshem et al.
patent: 5878212 (1999-03-01), Civanlar et al.
patent: 5884038 (1999-03-01), Kapoor
patent: 5903723 (1999-05-01), Beck et al.
patent: 5919247 (1999-12-01), Van Hoff et al.
patent: 5933832 (1999-08-01), Suzuoka et al.
patent: 5945989 (1999-08-01), Freishtat et al.
patent: 5956716 (1999-09-01), Kenner et al.
patent: 5961596 (1999-10-01), Takubo et al.
patent: 5991809 (1999-11-01), Kriegsman
patent: 6003030 (1999-12-01), Kenner et al.
patent: 6006264 (1999-12-01), Colby et al.
Shaw, David M. "A Low Latency, High Throughput Web Service Using Internet-wide Replication." Department of Computer Science, Johns Hopkins University, Aug. 1998, 33 pgs.
Amir, Yair, et al. "Seamlessly Selecting the Best Copy from Internet-Wide Replicated Web Servers." Department of Computer Science, Johns Hopkins University, Jun. 1998, 14 pgs.
Bestavros, Azer. "Speculative Data Dissemination and Service to Reduce Server Load, Network Traffic and Service Time in Distributed Information Systems." In Proceedings of ICDE '96: The 1996 International Conference on Data Engineering, Mar. 1996, 4 pgs.
Carter, J. Lawrence, et al. "Universal Classes of Hash Function." Journal of Computer and System Sciences, vol. 18, No. 2, Apr. 1979, pp. 143-154.
Chankhunthod, Anawat, et al. "A Hierarchical Internet Object Cache." In Usenix Proceedings, Jan. 1996, pgs. 153-163.
Cormen, Thomas H., et al. Introduction to Algorithms, The MIT Press, Cambrdige, Massachusetts, 1994, pgs. 219-243, 991-993.
Deering, Stephen, et al. "Multicast Routing in Datagram Internetworks and Extended LANs." ACM Transactions on Computer Systems, vol. 8, No. 2, May 1990, pgs. 85-110.
Devine, Robert. "Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm." In Proceedings of 4.sup.th International Conference on Foundations of Data Organizations and Algorithms, 1993, pgs. 101-114.
Grigni, Michelangelo, et al. "Tight Bounds on Minimum Broadcasts Networks." SIAM Journal of Discrete Mathematics, vol. 4, No. 2, May 1991, pgs. 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." In Proceedings of the 1996 USENIX Technical Conference, Jan. 1996, 8 pgs.
Feeley, Michael, et al. "Implementing Global Memory Management in a Workstation Cluster." In Proceedings of the 15th ACM Symposium on Operating Systems Principles, 1995, pgs. 201-212.
Floyd, Sally, et al. "A Reliable Multicast Framework for Light-Weight Sessions and Application Level Framing." In Proceeding of ACM SIGCOMM'95, pgs. 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, pgs. 538-544.
Karger, David, et al. "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web." In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing ,May 1997, pgs. 654-663.
Litwin, Withold, et al. "LH--A Scaleable, Distributed Data Structure." ACM Transactions on Database Systems, vol. 21, No. 4, Dec. 1996, pgs. 480-525.
Malpani, Radhika, et al. "Making World Wide Web Caching Servers Cooperate." In Proceedings of World Wide Web Conference, 1996, 6 pgs.
Naor, Moni, et al. "The Load, Capacity and Availability of Quorum Systems." In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, Nov. 1994, pgs. 214-225.
Nisan, Noam. "Psuedorandom Generators for Space-Bounded Computation." In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, May 1990, pgs. 204-212.
Palmer, Mark, et al. "Fido: A Cache that Learns to Fetch." In Proceedings of the 17th International Conference on Very Large Data Bases, Sep. 1991, pgs. 255-264.
Panigraphy, Rina. Relieving Hot Spots on the World Wide Web. Massachusetts Institute of Technology, Jun. 1997, pgs. 1-66.
Peleg, David, et al. "The Availability of Quorum Systems." Information and Computation 123, 1995, 210-223.
Plaxton, C. Greg, et al. "Fast Fault-Tolerant Concurrent Access to Shared Objects." In Proceedings of 37th IEEE Symposium on Foundations of Computer Science, 1996, pgs. 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, pgs. 335-348.
Ravi, R., "Rapid Rumor Ramification: Approximating the Miniumum Broadcast Time." In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, Nov. 1994, pgs. 202-213.
Schmidt, Jeanette, et al. "Chernoff-Hoeffding Bounds for Applications with Limited Independence." In Proceedings of the 4th ACS-SIAM Symposium on Discrete Algorithms, 1993, pgs. 331-340.
Tarjan, Robert Endre, et al. "Storing a Sparse Table." Communications of the ACM, vol. 22, No. 11, Nov. 1979, pgs. 606-611.
Vitter, Jeffrey Scott, et al. "Optimal Prefetching via Data Compression." In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, Nov. 1991, pgs. 121-130.
Wegman, Mark, et al. "New Hash Functions and Their Use in Authentication and Set Equality." Journal of Computer and System Sciences vol. 22, Jun. 1981, pgs. 265-279.
Yao, Andrew Chi-Chih. "Should Tables be Sorted?" Journal of the Association for Computing Machinery, vol. 28, No. 3, Jul. 1981, pgs. 615-628.
Beavan, Colin "Web Life They're Watching You." Esquire, Aug. 1997, pgs. 104-105.
Beavan, Colin "Web Life They're Watching You." Esquire, Aug. 1997, pp. 104-105.

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

Global hosting system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Global hosting system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Global hosting system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-593778

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