Replica routing

Details Replica routing Replica routing

2006-12-12

2006-12-12

Follansbee, John (Department: 2154)

Electrical computers and digital processing systems: multicomput

Distributed data processing

Client/server

C709S226000, C709S235000, C709S240000

Reexamination Certificate

active

07149771

ABSTRACT:
The present invention is a new method called replica routing that automatically directs client computers that request a service to a server replica for that service. The replica chosen by replica routing is the replica that is expected to provide the best performance to the client based upon the client's location in the internetwork topology and the estimated performance of the internetwork. In addition, the system and method is designed to permit new replicas to be flexibly added without undue administrative overhead.

REFERENCES:
patent: 4987587 (1991-01-01), Jolissaint
patent: 5088032 (1992-02-01), Bosack
patent: 5345586 (1994-09-01), Hamala et al.
patent: 5425090 (1995-06-01), Orriss
patent: 5430729 (1995-07-01), Rahnema
patent: 5463735 (1995-10-01), Pascucci et al.
patent: 5600794 (1997-02-01), Callon
patent: 5664107 (1997-09-01), Chatwani et al.
patent: 5740549 (1998-04-01), Reilly et al.
patent: 5774660 (1998-06-01), Brendel et al.
patent: 5812769 (1998-09-01), Graber et al.
patent: 5862328 (1999-01-01), Colyer
patent: 5948069 (1999-09-01), Kitai et al.
patent: 5956716 (1999-09-01), Kenner et al.
patent: 5991809 (1999-11-01), Kriegsman
patent: 6003030 (1999-12-01), Kenner et al.
patent: 6032189 (2000-02-01), Jinzenji et al.
patent: 6382569 (2002-05-01), Schattner et al.
patent: WO 96/41285 (1996-12-01), None
patent: WO 98/18076 (1998-04-01), None
patent: WO 98/37699 (1998-08-01), None
patent: WO 98/40831 (1998-09-01), None
Bowman et al.; “The Harvest Information Discovery and Access System”; 141.142.3.70/SDG/IT94/Proceedings/...; 1994.
Luotonen et al.; “World-Wide Web Proxides”; Apr. 1995.
Kwan et al.; “NCSA's World Wide Web Server: Design and Performance”, IEEE; 1995.
Malpani et al.; “Making World Wide Caching Servers Cooperate”; bmrc.berkeley.edu/papers/1995/138/paper-59.html; 1995.
Routing Basics; www.ics.muni.cz/cisco/data/doc/cinternet/ito/55171.htm; 1995.
Jeffery et al.; “Proxy-Sharing Proxy Servers”; IEEE; 1996.
Oguchi et al.; “A Study of Caching Proxy Mechanisms Realized on Wide Area Distributed Networks”, IEEE; 1996.
Ross; “Hash Routing for Collections of Shared Web Caches”; IEEE Network; Nov. 1997.
Cisco Systems, Inc.; “How to Cost-Effectively Scale Web Servers”; pp. 1-6; posted Nov. 13, 1996; www.cisco.com/warp/public/784/5.html.
Cisco System, Inc.; “The Effects of Distributing Load Randomly to Servers”; pp. 1-18; 1997 or earlier.
Cisco Systems, Inc.; “Cisco Distributed Director”; pp. 1-15; posted Feb. 21, 1997 or earlier; www.cisco.com/warp/public/734/distdir/dd—wp.htm.
Cisco Systems, Inc.; “Cisco Distributed Director”; pp. 1-16; posted Sep. 25, 1996; www.cisco.com/warp/public/734/distdir/dd—wp.htm.
Wallace; “Load balancing juggles calls at busy Web sites”; pp. 1-2; Mar. 17, 1997 or earlier; www.computerworld.com/search/AT-html/9611/96111.1s146web.html.
Cisco Systems, Inc.; “CiscoAdvantage: Leveraging Intranet and Internet Productivity”; pp. 1-8, posted May 21, 1996; www.cisco.com/warp/public/751/advtg/advan—p1.htm.
Gulbransen et al.; A DNS RR for specifying the location of services (DNS SRV), pp. 1-9, Feb. 26, 1997 or earlier; www.internic.net/rfc/rfc2052.txt.
Davis et al.; “A Means for Expressing Location Information in the Domain Name System”; pp. 1-16; Feb. 27, 1997 or earlier; http://www.internic.net/tfc/rfc1876.txt.
Erwin et al.; “Forrester: The Forrester Report”; pp. 2-11; Dec. 1, 1996; vol. 11, No. 1; access.forrester.com/cgi-bi...
Yoshikawa et al.; “Using Smart Clients to Build Scalable Services”; Unisex Association; 1997 Annual Technical Conference; pp. 105-120; Jan. 6-10, 1997 or earlier.
Open Market, Inc. Dr. Watson Product Description, “Software Product Description”; pp. 1-8, Jan. 21, 1997 or earlier; www.cavebear.com/dwtnda/spd.html.
Open Market, Inc.; “Frequently Asked Questions About Dr. Watson, The Network Detective's Assistant (DWTNDA) Version 1.2”; pp. 1-9; Jan. 21, 1997 or earlier; www.cavebear.com/dwtnda/faq.html.
Paxson; “End-to-End Routing Behavior in the Internet”; University of California, Berkeley and Lawrence Berkeley National Laboratory; pp. 25-38; 1996; SIGCOMM '96 Aug. 1996 0-89791-790-1/96/0008.
Tennenhouse et al.; “Towards an Active Network Architecture”; ACM Computer Communications Reviewer; Apr. 1996; vol. 26, No. 2; pp. 5-18.
Chankhunthod et al.; “A hierarchiacal Internet Object Cache”; pp. 153-163; Usenix Technical Conference; Jan. 22-26; 1996.
Crovella et al.; “Dynamic Server Selection in the Internet”; pp. 1-5; Jun. 30, 1995; Proc. Of the Third IEEE Workshop on the Architecture and Implementation of High Performance Communications Subsystems.
Blaze et al.; “Dynamic Hierarchial Caching in Large-Scale Distributed File Systems”; 0-8186-2865-0 /92 IEEE; pp. 521-528; 1992.
Guyton et al.; “Locating Nearby Copies of Replicated Internet Servers”; Computer Science Dept.; University of Colorado; pp. 288-298; 1995; SIGCOMM '95 Cambridge, MA ACM 0-89791-711-1/95/0008.
Gwertzman et al.; The Case for Geographical Push-Caching; pp. 1-4; Harvard University; date unknown.
Baentsch et al.; “Introducing application-level replication and naming into today's Web”; Computer Networks and ISDN Systems 28; pp. 921-930; 1996.
Deering et al.; “Multicast Routing in Datagram Internetworks and Extended LANs”; ACM Transactions on Computer Systems; vol. 8; No. 2; pp. 85-110; May 2, 1990.
Bestavros; “Speculative Data Dissemination and Service to Reduce Server Load, . . . ”; Proceedings of ICDE '196; Int. Conf. On Engineering; New Orleans, LA; Mar. 1996.
Bestavros; “Demand-based Document Dissemination to Reduce Traffic and Balance Load in Distributed Information System”; Proc. Of SPDP '95, 7thIEEE Symposium; San Antonio, TX; Oct. 1995.
Washburn et al.; “TCP/IP Running a Successful Network”; pp. 1-233; and pp. 368-409; Addison-Wesley Publishing Company; date unknown.
Stevens; TCP/IP Illustrated; vol. 1; pp. 1-21; 33-51, 85-142, 186-208, 222-228; Addison-Wesley Publishing Company; date unknown; The Domain Name System; pp. 186-208; TCP: Trans. Control Protocol; 223-228.
Blaze; “Caching in Large-Scale Distributed File Systems”; Princeton University Department of Computer Science; Research Report CS-TR-397-92; Jan. 1993; pp. 1-88.
Danzig et al.; “A Case for Caching File Objects Inside Internetworks”; pp. 1-10; 1993; ACM SIGCOMM.
PointCast, Inc.; “PointCast Ships The Industry's First Broadcast Solution for Corporate Intranets”; Oct. 7, 1996; 501 Macara Ave.; Sunnyvale, CA 94086.
PointCast, Inc.; “Deployment Guidelines” Technical Paper; May 15, 1997; or earlier; pp. 1-15.
PointCast, Inc.; “Configuring Multiple PointCast I-Servers” Technical Paper; Mar. 19, 1997 or earlier; pp. 1-11.
Alsop; “PointCast and Its Wannabes”; Fortune; Nov. 25, 1996; pp. 181.
BackWeb Technologies, Inc.; “Put an End to Those Nasty Hit and Runs On Your Website”; 1996.
O'Malley et al.; “A Dynamic Network Architecture”; ACM Transactions on Computer Systems; vol. 10; No. 2; May 1992; pp. 110-143.
Huitema; “Routing in the Internet”; Prentice Hall PTR; Englewood Cliffs, NJ; pp. 1-60; date unknown.
PointCast, Inc., “Internal PointCast Network Traffic”; Technical Paper; Apr. 17, 1997 or earlier; pp. 2-11.
InterVU Network Services; “What We Do”; www.intervu.net/service/doit.html; Jun. 8, 1997 or earlier.
Netscape; “Netscape Netcenter”; http://www.netscape.com; 1998 or earlier.
Resonate, Inc.; “Corporate Backgrounder”; pp. 1-10; date unknown; 465 Fairchild Drive, Suite 224, Mountain View, CA 94043.
Resonate, Inc.; “A Case for Intelligent Distributed Server Management”; pp. 1-9; 1996; w

Affiliated with

Also associated with

Rating

Replica routing does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3672940