公开(公告)号：US06314465B1

公开(公告)日：2001-11-06

申请号：US09266339

申请日：1999-03-11

申请人： Sanjoy Paul ,  Sampath Rangarajan

发明人： Sanjoy Paul ,  Sampath Rangarajan

IPC分类号： G06F1300

CPC分类号： H04L67/1008 ,  H04L67/1002 ,  H04L67/101 ,  H04L67/1012 ,  H04L67/1034

摘要： Client's (106-1-106-N, 107-1-107-M) on local area networks (102, 103) making requests to hot sites, which are connected on a wide area network (100) such as the Internet, are redirected through one of a possible plurality of different redirectors (101, 103) to one of a possible plurality of caching servers (S1, S2, S3), which each have responsibility for mapping one or more of the hot sites. Each request is probabilistically directed by one of the redirectors to one of the caching servers that map the requested hot site in accordance with weights that are determined for that redirector-hot site pair so as to minimize the average delay that all client requests across the network will encounter in making requests to all the cached hot sites. In order to determine the weights with which each redirector will redirect requests to the hot sites to the caching servers, statistics of access rates to each hot site are dynamically determined by each redirector in the network from the traffic flow and reported to a central management station (CMS) (115). Network delay is similarly measured by each redirector and reported to the CMS, and server delay is computed using a queuing model of each server. Using these parameters as inputs, a non-linear programming optimization problem is solved as a network flow problem in order to determine the weights for each redirector that will minimize the average delay. As the access rate statistics, as well as the network delay and server delay, dynamically change, the CMS, using the network flow algorithm, recalculates the weights and forwards them back to each redirector. In other embodiments, the redirector-logical item pair for which the redirector probabilistically directs client requests may be other than a hot site identity. For example, the logical items can be groups of clients or groups of documents, and the servers to which requests are forwarded can be web servers or caching servers.

公开(公告)号：US07801957B2

公开(公告)日：2010-09-21

申请号：US12478130

申请日：2009-06-04

申请人： Katherine H Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

发明人： Katherine H Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

IPC分类号： G06F15/16

CPC分类号： A63F13/358 ,  A63F13/12 ,  A63F2300/534 ,  G07F17/32 ,  G07F17/3269 ,  H04L29/08 ,  H04L67/10 ,  H04L67/12 ,  H04L67/322 ,  H04L67/325 ,  H04L69/329

摘要： The Fair-Order Service of the present invention delivers action messages to the server as soon as it is feasible. Because action messages from different players exhibit different reaction times with respect to an update message, the Fair-Ordering Service executed at the server dynamically enforces a sufficient waiting period on each action message to guarantee the fair processing of all action messages. In reality, the waiting period at the server is bounded because of the real-time nature of interactive games. The algorithms that offer Fair Ordering Service take into consideration delayed and out-of-order action messages. When action messages corresponding to multiple update messages are interleaved, the Fair-Ordering Service matches the action message to the appropriate update message. It accomplishes this by maintaining a window of update messages and using the reaction times for an action message for each of the update messages in the window. This enables state changes at the game server to be performed with fairness to all the players. The Fair-Order Service invention is based on a framework that uses a proxy architecture making it transparent to any specific game application. The service is well suited to client-server based, online multi-player games, where a fair order of player actions is critical to the game outcome.

摘要翻译： 本发明的公平订购服务在可行时尽快向服务器发送动作消息。 由于来自不同玩家的动作消息对于更新消息表现出不同的反应时间，所以在服务器处执行的公正排序服务动态地对每个动作消息执行足够的等待时间，以保证所有动作消息的公平处理。 实际上，由于互动游戏的实时性，服务器的等待时间是有限的。 提供公平订购服务的算法考虑到延迟和无序操作消息。 当与多个更新消息相对应的动作消息被交织时，Fair-Ordering Service将动作消息与适当的更新消息相匹配。 它通过维护更新消息窗口并使用窗口中的每个更新消息的动作消息的反应时间来实现。 这使得游戏服务器上的状态改变能够对所有玩家公平地执行。 公平订单服务发明基于使用代理架构使其对任何特定游戏应用程序透明化的框架。 该服务非常适合基于客户端服务器的在线多玩家游戏，其中玩家动作的公平顺序对于游戏结果至关重要。

公开(公告)号：US07478427B2

公开(公告)日：2009-01-13

申请号：US10429815

申请日：2003-05-05

申请人： Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan ,  Anil Takkallapalli

发明人： Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan ,  Anil Takkallapalli

IPC分类号： G06F21/00 ,  G06F15/16 ,  H04L9/00

CPC分类号： H04L63/0272 ,  H04L12/4633 ,  H04L63/164

摘要： A method and apparatus for providing at least two virtual private network VPN tunnels from a client device in a VPN network having an enterprise gateway and a network VPN gateway. The method and apparatus includes a client device having an Internet Key Exchange (IKE) module for establishing the at least two tunnels using an IKE protocol wherein a first tunnel is an end-to-end VPN tunnel to the enterprise gateway, and a second tunnel is a network-based tunnel to the network VPN gateway. An IPsec Network Driver Interface interfaces with the IKE module, which includes a security authentication database (SADB) that stores downloaded enterprise security policies respectively for each of the at least two tunnels. A routing table stores IP addresses of local presences and hosts respectively associated with the at least two tunnels, whereby packets are routed over the at least two tunnels based on the downloaded policies.

摘要翻译： 一种用于在具有企业网关和网络VPN网关的VPN网络中从客户端设备提供至少两个虚拟专用网络VPN隧道的方法和装置。 该方法和装置包括具有互联网密钥交换（IKE）模块的客户端设备，用于使用IKE协议建立至少两个隧道，其中第一隧道是到企业网关的端到端VPN隧道，以及第二隧道 是到网络VPN网关的基于网络的隧道。 IPsec网络驱动程序接口与IKE模块接口，该IKE模块包括一个安全认证数据库（SADB），它分别为至少两个隧道中的每个隧道存储下载的企业安全策略。 路由表存储分别与至少两个隧道相关联的本地存在和主机的IP地址，由此基于所下载的策略，通过至少两个隧道路由分组。

公开(公告)号：US20060215623A1

公开(公告)日：2006-09-28

申请号：US11089736

申请日：2005-03-25

申请人： Chueng-Hsien Lin ,  Sanjoy Paul ,  Sampath Rangarajan

发明人： Chueng-Hsien Lin ,  Sanjoy Paul ,  Sampath Rangarajan

IPC分类号： H04Q7/24 ,  H04L12/56

CPC分类号： H04W36/18 ,  H04L29/12018 ,  H04L29/12113 ,  H04L29/12311 ,  H04L61/10 ,  H04L61/1541 ,  H04L61/2084 ,  H04W8/087 ,  H04W8/26 ,  H04W40/248 ,  H04W84/12 ,  H04W88/08 ,  H04W88/14 ,  H04W92/02

摘要： A method and apparatus for seamless roaming support for wireless networks is disclosed. The method includes broadcasting a request for a physical address of a default router related to a mobile unit; receiving the request at the default router; replying to the mobile unit; and creating an initial entry in a location table.

摘要翻译： 公开了一种用于无线网络的无缝漫游支持的方法和装置。 该方法包括：广播与移动单元相关的默认路由器的物理地址的请求; 在默认路由器上接收请求; 回复移动单元; 并在位置表中创建初始条目。

公开(公告)号：US20050192098A1

公开(公告)日：2005-09-01

申请号：US10789585

申请日：2004-02-27

申请人： Katherine Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

发明人： Katherine Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

IPC分类号： G06F15/16 ,  G07F17/32 ,  H04L29/08

CPC分类号： A63F13/358 ,  A63F13/12 ,  A63F2300/534 ,  G07F17/32 ,  G07F17/3269 ,  H04L29/08 ,  H04L67/10 ,  H04L67/12 ,  H04L67/322 ,  H04L67/325 ,  H04L69/329

摘要： The Fair-Order Service of the present invention delivers action messages to the server as soon as it is feasible. Because action messages from different players exhibit different reaction times with respect to an update message, the Fair-Ordering Service executed at the server dynamically enforces a sufficient waiting period on each action message to guarantee the fair processing of all action messages. In reality, the waiting period at the server is bounded because of the real-time nature of interactive games. The algorithms that offer Fair Ordering Service take into consideration delayed and out-of-order action messages. When action messages corresponding to multiple update messages are interleaved, the Fair-Ordering Service matches the action message to the appropriate update message. It accomplishes this by maintaining a window of update messages and using the reaction times for an action message for each of the update messages in the window. This enables state changes at the game server to be performed with fairness to all the players. The Fair-Order Service invention is based on a framework that uses a proxy architecture making it transparent to any specific game application. The service is well suited to client-server based, online multi-player games, where a fair order of player actions is critical to the game outcome.

摘要翻译： 本发明的公平订购服务在可行时尽快向服务器发送动作消息。 由于来自不同玩家的动作消息对于更新消息表现出不同的反应时间，所以在服务器处执行的公正排序服务动态地对每个动作消息执行足够的等待时间，以保证所有动作消息的公平处理。 实际上，由于互动游戏的实时性，服务器的等待时间是有限的。 提供公平订购服务的算法考虑到延迟和无序操作消息。 当与多个更新消息相对应的动作消息被交织时，Fair-Ordering Service将动作消息与适当的更新消息相匹配。 它通过维护更新消息窗口并使用窗口中的每个更新消息的动作消息的反应时间来实现。 这使得游戏服务器上的状态改变能够对所有玩家公平地执行。 公平订单服务发明基于使用代理架构使其对任何特定游戏应用程序透明化的框架。 该服务非常适合基于客户端服务器的在线多玩家游戏，其中玩家动作的公平顺序对于游戏结果至关重要。

公开(公告)号：US08597124B2

公开(公告)日：2013-12-03

申请号：US12885814

申请日：2010-09-20

申请人： Katherine H. Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

发明人： Katherine H. Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

IPC分类号： A63F13/00

CPC分类号： A63F13/358 ,  A63F13/12 ,  A63F2300/534 ,  G07F17/32 ,  G07F17/3269 ,  H04L29/08 ,  H04L67/10 ,  H04L67/12 ,  H04L67/322 ,  H04L67/325 ,  H04L69/329

摘要： The Fair-Ordering Service delivers action messages to the server as soon as it is feasible. Because action messages from different players exhibit different reaction times with respect to an update message, the Fair-Ordering Service executed at the server dynamically enforces a sufficient waiting period on each action message to guarantee the fair processing of all action messages. The Fair-Ordering Service takes into consideration delayed and out-of-order action messages. When action messages corresponding to multiple update messages are interleaved, the Fair-Ordering Service matches the action message to the appropriate update message by maintaining a window of update messages and using the reaction times for an action message for each of the update messages in the window. This enables state changes at the game server to be performed with fairness to all the players. The Fair-Ordering Service is based on a framework that uses a proxy architecture.

摘要翻译： 公平订购服务在可行时尽快向服务器发送操作消息。 由于来自不同玩家的动作消息对于更新消息表现出不同的反应时间，所以在服务器处执行的公正排序服务动态地对每个动作消息执行足够的等待时间，以保证所有动作消息的公平处理。 公平订购服务考虑到延迟和无序的行动消息。 当与多个更新消息相对应的动作消息被交织时，公平订购服务通过维护更新消息的窗口并且使用窗口中的每个更新消息的动作消息的反应时间将该动作消息与适当的更新消息相匹配 。 这使得游戏服务器上的状态改变能够对所有玩家公平地执行。 公平订购服务基于使用代理架构的框架。

公开(公告)号：US07894407B2

公开(公告)日：2011-02-22

申请号：US11089736

申请日：2005-03-25

申请人： Chueng-Hsien Lin ,  Sanjoy Paul ,  Sampath Rangarajan

发明人： Chueng-Hsien Lin ,  Sanjoy Paul ,  Sampath Rangarajan

IPC分类号： H04Q7/24

CPC分类号： H04W36/18 ,  H04L29/12018 ,  H04L29/12113 ,  H04L29/12311 ,  H04L61/10 ,  H04L61/1541 ,  H04L61/2084 ,  H04W8/087 ,  H04W8/26 ,  H04W40/248 ,  H04W84/12 ,  H04W88/08 ,  H04W88/14 ,  H04W92/02

摘要： A method and apparatus for seamless roaming support for wireless networks is disclosed. The method includes broadcasting a request for a physical address of a default router related to a mobile unit; receiving the request at the default router; replying to the mobile unit; and creating an initial entry in a location table.

摘要翻译： 公开了一种用于无线网络的无缝漫游支持的方法和装置。 该方法包括：广播与移动单元相关的默认路由器的物理地址的请求; 在默认路由器上接收请求; 回复移动单元; 并在位置表中创建初始条目。

公开(公告)号：US20110009196A1

公开(公告)日：2011-01-13

申请号：US12885814

申请日：2010-09-20

申请人： Katherine H. Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

发明人： Katherine H. Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

IPC分类号： A63F9/24

CPC分类号： A63F13/358 ,  A63F13/12 ,  A63F2300/534 ,  G07F17/32 ,  G07F17/3269 ,  H04L29/08 ,  H04L67/10 ,  H04L67/12 ,  H04L67/322 ,  H04L67/325 ,  H04L69/329

摘要： The Fair-Order Service of the present invention delivers action messages to the server as soon as it is feasible. Because action messages from different players exhibit different reaction times with respect to an update message, the Fair-Ordering Service executed at the server dynamically enforces a sufficient waiting period on each action message to guarantee the fair processing of all action messages. In reality, the waiting period at the server is bounded because of the real-time nature of interactive games. The algorithms that offer Fair Ordering Service take into consideration delayed and out-of-order action messages. When action messages corresponding to multiple update messages are interleaved, the Fair-Ordering Service matches the action message to the appropriate update message. It accomplishes this by maintaining a window of update messages and using the reaction times for an action message for each of the update messages in the window. This enables state changes at the game server to be performed with fairness to all the players. The Fair-Order Service invention is based on a framework that uses a proxy architecture making it transparent to any specific game application. The service is well suited to client-server based, online multi-player games, where a fair order of player actions is critical to the game outcome.

摘要翻译： 本发明的公平订购服务在可行时尽快向服务器发送动作消息。 由于来自不同玩家的动作消息对于更新消息表现出不同的反应时间，所以在服务器处执行的公正排序服务动态地对每个动作消息执行足够的等待时间，以保证所有动作消息的公平处理。 实际上，由于互动游戏的实时性，服务器的等待时间是有限的。 提供公平订购服务的算法考虑到延迟和无序操作消息。 当与多个更新消息相对应的动作消息被交织时，Fair-Ordering Service将动作消息与适当的更新消息相匹配。 它通过维护更新消息窗口并使用窗口中的每个更新消息的动作消息的反应时间来实现。 这使得游戏服务器上的状态改变能够对所有玩家公平地执行。 公平订单服务发明基于使用代理架构使其对任何特定游戏应用程序透明化的框架。 该服务非常适合基于客户端服务器的在线多玩家游戏，其中玩家动作的公平顺序对于游戏结果至关重要。

公开(公告)号：US07584248B2

公开(公告)日：2009-09-01

申请号：US10789585

申请日：2004-02-27

申请人： Katherine H Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

发明人： Katherine H Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

IPC分类号： G06F15/16

CPC分类号： A63F13/358 ,  A63F13/12 ,  A63F2300/534 ,  G07F17/32 ,  G07F17/3269 ,  H04L29/08 ,  H04L67/10 ,  H04L67/12 ,  H04L67/322 ,  H04L67/325 ,  H04L69/329

摘要： The Fair-Order Service of the present invention delivers action messages to the server as soon as it is feasible. Because action messages from different players exhibit different reaction times with respect to an update message, the Fair-Ordering Service executed at the server dynamically enforces a sufficient waiting period on each action message to guarantee the fair processing of all action messages. In reality, the waiting period at the server is bounded because of the real-time nature of interactive games. The algorithms that offer Fair Ordering Service take into consideration delayed and out-of-order action messages. When action messages corresponding to multiple update messages are interleaved, the Fair-Ordering Service matches the action message to the appropriate update message. It accomplishes this by maintaining a window of update messages and using the reaction times for an action message for each of the update messages in the window. This enables state changes at the game server to be performed with fairness to all the players. The Fair-Order Service invention is based on a framework that uses a proxy architecture making it transparent to any specific game application. The service is well suited to client-server based, online multi-player games, where a fair order of player actions is critical to the game outcome.

摘要翻译： 本发明的公平订购服务在可行时尽快向服务器发送动作消息。 由于来自不同玩家的动作消息对于更新消息表现出不同的反应时间，所以在服务器处执行的公正排序服务动态地对每个动作消息执行足够的等待时间，以保证所有动作消息的公平处理。 实际上，由于互动游戏的实时性，服务器的等待时间是有限的。 提供公平订购服务的算法考虑到延迟和无序操作消息。 当与多个更新消息相对应的动作消息被交织时，Fair-Ordering Service将动作消息与适当的更新消息相匹配。 它通过维护更新消息窗口并使用窗口中的每个更新消息的动作消息的反应时间来实现。 这使得游戏服务器上的状态改变能够对所有玩家公平地执行。 公平订单服务发明基于使用代理架构使其对任何特定游戏应用程序透明化的框架。 该服务非常适合基于客户端服务器的在线多玩家游戏，其中玩家动作的公平顺序对于游戏结果至关重要。

公开(公告)号：US07756042B2

公开(公告)日：2010-07-13

申请号：US10772080

申请日：2004-02-04

申请人： Katherine H. Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

发明人： Katherine H. Guo ,  Sarit Mukherjee ,  Sanjoy Paul ,  Sampath Rangarajan

IPC分类号： H04L12/28 ,  H04W40/00 ,  G06F9/00 ,  G06F17/00

CPC分类号： H04L12/287 ,  H04L12/2859 ,  H04L12/4641 ,  H04L63/0272 ,  H04W40/02

摘要： A method and virtual private network (VPN) system for providing bandwidth guaranteed provisioning in network-based mobile VPN services. The method and system include identifying a set of VPN customers, at least one mobile access point (MAP) and at least one customer premise equipment (CPE) associated with each VPN customer, and at least one Internet Protocol (IP) service gateway (IPSG) for facilitating VPN tunneling between a MAP and a CPE, wherein each MAP is geographically remote from each IPSG. A subset of IPSGs is selected to maximize total profit resulting from provisioning a subset of VPN customers on the selected IPSGs. Total profit from all the customers includes the sum of profits from each customer, where for each customer, the customer profit equals weighted revenue less cost, wherein the cost per customer includes a total tunnel bandwidth cost from the MAP to the CPE, and a cost of provisioning an IPSG node.

摘要翻译： 一种用于在基于网络的移动VPN服务中提供带宽保证提供的方法和虚拟专用网（VPN）系统。 该方法和系统包括识别一组VPN客户，至少一个移动接入点（MAP）和与每个VPN客户相关联的至少一个客户驻地设备（CPE）以及至少一个因特网协议（IP）服务网关（IPSG） ），用于促进MAP和CPE之间的VPN隧道，其中每个MAP在地理上远离每个IPSG。 选择IPSG的一个子集，以最大限度地利用在所选择的IPSG上配置VPN客户的子集而产生的总利润。 所有客户的总利润包括每个客户的利润总额，每个客户的利润，客户利润等于加权收入减去成本，其中每个客户的成本包括从MAP到CPE的总隧道带宽成本，以及成本 配置IPSG节点。