Load balancing service

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

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C718S105000

Reexamination Certificate

active

07346676

ABSTRACT:
A load balancing service for a plurality of customers performs load balancing among a plurality of customer Web servers. Requests for Web content are load balanced across the customer Web servers. The load balancing service provider charges a fee to the customers for the load balancing service. A caching service is also provided that comprises a plurality of caching servers connected to a network. The caching servers host customer content that can be cached and stored, e.g., images, video, text, and/or software. The caching servers respond to requests for Web content from clients. The load balancing service provider charges a fee to the customers for the Web caching service.

REFERENCES:
patent: 5608446 (1997-03-01), Carr et al.
patent: 5729689 (1998-03-01), Allard et al.
patent: 5774660 (1998-06-01), Brendel et al.
patent: 5918228 (1999-06-01), Rich et al.
patent: 6003090 (1999-12-01), Puranik et al.
patent: 6023464 (2000-02-01), Woundy
patent: 6029196 (2000-02-01), Lenz
patent: 6052718 (2000-04-01), Gifford
patent: 6070191 (2000-05-01), Narendran et al.
patent: 6078943 (2000-06-01), Yu
patent: 6085241 (2000-07-01), Otis
patent: 6092178 (2000-07-01), Jindal et al.
patent: 6112239 (2000-08-01), Kenner et al.
patent: 6118765 (2000-09-01), Phillips
patent: 6119171 (2000-09-01), Alkhatib
patent: 6128279 (2000-10-01), O'Neil et al.
patent: 6167438 (2000-12-01), Yates et al.
patent: 6173311 (2001-01-01), Hassett et al.
patent: 6182148 (2001-01-01), Tout
patent: 6185601 (2001-02-01), Wolff
patent: 6249801 (2001-06-01), Zisapel et al.
patent: 6252857 (2001-06-01), Fendick et al.
patent: 6292832 (2001-09-01), Shah et al.
patent: 6298381 (2001-10-01), Shah et al.
patent: 6330605 (2001-12-01), Christensen et al.
patent: 6351776 (2002-02-01), O'Brien et al.
patent: 6381627 (2002-04-01), Kwan et al.
patent: 6405252 (2002-06-01), Gupta et al.
patent: 6415323 (2002-07-01), McCanne et al.
patent: 6415335 (2002-07-01), Lowery et al.
patent: 6430619 (2002-08-01), Sitaraman et al.
patent: 6449251 (2002-09-01), Awadallah et al.
patent: 6449647 (2002-09-01), Colby et al.
patent: 6473793 (2002-10-01), Dillon et al.
patent: 6546014 (2003-04-01), Kramer et al.
patent: 6553568 (2003-04-01), Fijolek et al.
patent: 6560717 (2003-05-01), Scott et al.
patent: 6650621 (2003-11-01), Maki-Kullas
patent: 6654804 (2003-11-01), Fleming
patent: 6665271 (2003-12-01), Thomas et al.
patent: 6735631 (2004-05-01), Oehrke et al.
patent: 6760745 (2004-07-01), Tan et al.
patent: 6795860 (2004-09-01), Shah
patent: 6894974 (2005-05-01), Aweva et al.
patent: 7058706 (2006-06-01), Iyer et al.
patent: 7082463 (2006-07-01), Bradley et al.
patent: 7124188 (2006-10-01), Mangipudi et al.
patent: 2001/0049741 (2001-12-01), Skene et al.
patent: 2002/0026511 (2002-02-01), Garcia-Luna-Aceves et al.
patent: 2002/0073199 (2002-06-01), Levine et al.
patent: 2002/0099816 (2002-07-01), Quarterman et al.
patent: 2002/0103846 (2002-08-01), Zisapel et al.
patent: 2002/0129134 (2002-09-01), Leighton et al.
patent: 2004/0133793 (2004-07-01), Ginter et al.
patent: 2005/0033858 (2005-02-01), Swildens et al.
patent: 2005/0097445 (2005-05-01), Day et al.
patent: 2006/0012176 (2006-01-01), Liu et al.
patent: 817020 (1998-01-01), None
patent: 959601 (1999-11-01), None
patent: WO 99/29083 (1999-06-01), None
patent: WO 00/22526 (2000-04-01), None
U.S. Appl. No. 09/909,711, filed Jul. 19, 2001.
U.S. Appl. No. 11/724,829, filed Mar. 16, 2007.
Bhattachjarjee, S. et al., “Application-Layer Anycasting,” Proceedings of the IEEE Infocom ′97, Apr. 7-12, 1997, vol. 3, Apr. 7, 1997.
Cooper, I. et al., “Internet Web Replication and Caching Taxonomy, draft-ietf-wrec-taxonomy-05.txt,” Jul. 4, 2000, Internet-Draft, XP-002194089, 31 pages.
Fei. et al., “A Novel Server Section Technique for improving the Response Time of a Replicated Servece,” Proceedings of the IEEE Infocom '98 Conference, San Francisco, CA, vol. 2, Mar. 29, 1998, pp. 793-791.
Grimm, C., et al., “Load and Traffic Balancing in Large Scale Cache Meshes,” 1998,Computer Networks and ISDN Systems, XP004138701, pp. 1687-1695.
Guyton, et al., “Locating Nearby Copies of Replicated Internet Services”; Computer Communications Review, Association For Computing Machinery, New York, US<vol., 25, No. 4, Oct. 1, 1995, pp. 288-298.
Moore, et al., “Sonar-a Network Proximity Service,” IETF Internet Draft, Feb. 23, 1996, p. 1, para. 2-4, p. 5, para 1, 2 p. 6, para 4-p. 7 para 2.
Paul, S. et al., “Distributed Caching with Centralized Control,” 2001; Computer Communications, pp. 256-268.
Rekhter, Y. Oct. 1991, IBM Corpl. www.faqs.org/rfcs/rfc1265.html, pp. 1-7.
Rugelj, Joze, et al., “Advanced Mechanism for the Efficient Employment of Distributed Hypermedia Applications in Education,” 1996, XP-002194090, 4 pages.
Schemers, R.J., “Ibnamed: A Load Balancing Name Server in Perl,” Proceedings of the Systems Administration Conference, Sep. 17, 1995, pp. 1-11, XP002054865 p. 2, left-hand column, para 3; p. 3, left-hand column, para 1.
Wi, K.-L. Wu, et al., “SpeedTracer: A Web Usage Mining and Analysis Tool,” 1998, IBM Systems Journal, vol. 37, No. 1, pp. 89-105.
Zhou, Tao, “Web Server Load Balancers”. Apr. 2000, Windows & .NET Magazine.

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

Load balancing service does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-3971857

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