发明公开
- 专利标题: DISTRIBUTED REUEST ROUTING
- 专利标题(中): 分布式REUEST路由
-
申请号: EP05729897.8申请日: 2005-03-24
-
公开(公告)号: EP1782231A2公开(公告)日: 2007-05-09
- 发明人: CHEN, Chung-Min , CHEN, Wai , LING, Yibei , PANG, Marcus , CAI, Shengwei
- 申请人: Telcordia Technologies, Inc. , Toyota Infotechnology Center Co., Ltd.
- 申请人地址: One Telcordia Drive 5G116 Piscataway, NJ 08854-4157 US
- 专利权人: Telcordia Technologies, Inc.,Toyota Infotechnology Center Co., Ltd.
- 当前专利权人: Telcordia Technologies, Inc.,Toyota Infotechnology Center Co., Ltd.
- 当前专利权人地址: One Telcordia Drive 5G116 Piscataway, NJ 08854-4157 US
- 代理机构: Round, Edward Mark
- 优先权: US876983 20040625
- 国际公布: WO2006011929 20060202
- 主分类号: G06F15/16
- IPC分类号: G06F15/16
摘要:
A plurality of servers (802, 204, 202, 203) for processing client (210) requests (220, 222, 810) forward the requests (220, 222, 810) among themselves to achieve a balanced load. When a server (802, 204, 202, 203) initially receives a client request (220, 222, 810), it randomly selects another of the plurality of servers (802, 204, 202, 203), referred to as a first-chance server, and forwards the request (220, 222, 810) to this server. Upon receiving the request, the first-chance server determines if it is overloaded and if not, process the request. However, if overloaded, the first-chance server compares its load to the load of one or more predetermined next-neighbor servers. If the next-neighbor server(s) are more loaded than the first-chance server, the first-chance server processes the request. Otherwise, the first-chance server forwards the request to the least loaded next-neighbor server. The next-neighbor receiving the request either processes it directly, or alternatively, based on its current load and that of its next-neighbor server(s), forwards the reques to another next-neighbor server for processing.
公开/授权文献
- EP1782231B1 DISTRIBUTED REQUEST ROUTING 公开/授权日:2018-03-21
信息查询