Electrical computers and digital processing systems: multicomput – Computer network managing
Reexamination Certificate
2006-03-28
2006-03-28
Etienne, Ario (Department: 2157)
Electrical computers and digital processing systems: multicomput
Computer network managing
C709S203000, C709S217000, C709S224000, C718S105000
Reexamination Certificate
active
07020698
ABSTRACT:
A scalable system and method for locating a closest server in response to a client request via an interactive distribution network, such as the Internet, are provided. A closest content server is defined as having the least round trip time for responding to a client request. The system including a plurality of content servers; and a local server in communication with a plurality of clients, the local server acting as a proxy for communicating client requests from clients to a redirection server. Client network distance and load information is periodically collected at each content server in the network from clients communicating with each of the respective content servers. The redirection server periodically aggregates the network distance and load information from each content server to create client clusters from both current and previously aggregated network distance and load information. Each client cluster represents a division or partition of the total IP address space. Each client cluster is then mapped (paired) to one or more content servers in the network. The mapping or pairing is then utilized to respond to client DN requests received from any client in the network. Another aspect of the invention involves considering the respective capacities of the content servers in the network. A selection probability is assigned to each content server/domain index pair to prevent the repeated selection of the content server having lowest round trip time thereby overloading that server's service capacity. The selection probabilities assigned to each content server effect a load balancing to prevent overloading. Another aspect of the invention involves collecting the distance and load information without incurring any overhead cost by passively collecting TCP information as it is transmitted from clients in communication with content servers in the course of normal communications.
REFERENCES:
patent: 5774660 (1998-06-01), Brendel et al.
patent: 5924116 (1999-07-01), Aggarwal et al.
patent: 6052718 (2000-04-01), Gifford
patent: 6070191 (2000-05-01), Narendran et al.
patent: 6092178 (2000-07-01), Jindal et al.
patent: 6175957 (2001-01-01), Ju et al.
patent: 6185619 (2001-02-01), Joffe et al.
patent: 6237061 (2001-05-01), Srinivasan et al.
patent: 6304913 (2001-10-01), Rune
patent: 6314465 (2001-11-01), Paul et al.
patent: 6324580 (2001-11-01), Jindal et al.
patent: 6327622 (2001-12-01), Jindal et al.
patent: 6351775 (2002-02-01), Yu
patent: 6374297 (2002-04-01), Wolf et al.
patent: 6389448 (2002-05-01), Primak et al.
patent: 6446121 (2002-09-01), Shah et al.
patent: 6484143 (2002-11-01), Swildens et al.
patent: 6606643 (2003-08-01), Emens et al.
patent: 6633953 (2003-10-01), Stark
patent: 6665702 (2003-12-01), Zisapel et al.
patent: 6671259 (2003-12-01), He et al.
patent: 6724733 (2004-04-01), Schuba et al.
patent: 6754706 (2004-06-01), Swildens et al.
patent: 6795860 (2004-09-01), Shah
patent: 6810411 (2004-10-01), Coughlin et al.
patent: 6820133 (2004-11-01), Grove et al.
patent: 6928485 (2005-08-01), Krishnamurthy et al.
patent: 6947992 (2005-09-01), Shachor
patent: 2005/0010653 (2005-01-01), McCanne
Andrews Matthew
Hofmann Markus
Shepherd Bruce
Srinivasan Aravind
Winkler Peter
Etienne Ario
Jacobs LaShonda
Lucent Technologies - Inc.
LandOfFree
System and method for locating a closest server in response... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for locating a closest server in response..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for locating a closest server in response... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3526721