专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

11. 发明授权

US07925601B2 Reducing bandwidth requirements for peer-to-peer gaming based on error difference between actual game object state and simulated game object state being below an error threshold 有权
标题翻译：基于实际游戏对象状态与模拟游戏对象状态之间的差异差异，降低对等游戏的带宽需求低于错误阈值
公开(公告)号：US07925601B2
公开(公告)日：2011-04-12
申请号：US12581807
申请日：2009-10-19
申请人： John R. Douceur , Jacob R. Lorch , Jeffrey Anson Pang , Frank Christopher Uyeda
发明人： John R. Douceur , Jacob R. Lorch , Jeffrey Anson Pang , Frank Christopher Uyeda
IPC分类号： G06F15/18 , G06F15/16 , G06F17/00 , G06F19/00 , A63F9/24 , A63F13/00
CPC分类号： A63F13/34 , A63F13/12 , A63F13/67 , A63F2300/407 , A63F2300/408 , A63F2300/6027 , H04L67/104 , H04L67/1059 , H04L67/30 , H04L67/38
摘要： Techniques enable the reduction of bandwidth requirements for peer-to-peer gaming architectures. In some embodiments, these techniques allow differentiation among players to decide which players should receive continuous updates and which should receive periodic updates. For those gaming systems receiving periodic updates, guided artificial intelligence is employed to simulate activity of a game object based on guidance provided by the periodic updates. Conversely, for those gaming systems receiving continuous updates, the continuous updates may be employed to update the activity of the game object rather than simulating the activity.
摘要翻译：技术可以减少对等游戏体系结构的带宽需求。在一些实施例中，这些技术允许玩家之间的区分，以决定哪些玩家应该接收连续的更新，哪些玩家应该接收周期性的更新。对于接收定期更新的那些游戏系统，采用引导人工智能来基于定期更新提供的指导来模拟游戏对象的活动。相反，对于接收连续更新的那些游戏系统，可以采用连续更新来更新游戏对象的活动，而不是模拟活动。

12. 发明授权

US09327194B2 Partitioned artificial intelligence for networked games 有权
标题翻译：网络游戏分区人工智能
公开(公告)号：US09327194B2
公开(公告)日：2016-05-03
申请号：US13372305
申请日：2012-02-13
申请人： John R. Douceur , Michael P. Calligaro , Randall C Wood , Jacob R. Lorch
发明人： John R. Douceur , Michael P. Calligaro , Randall C Wood , Jacob R. Lorch
IPC分类号： A63F9/24 , A63F13/40 , A63F13/30
CPC分类号： A63F13/355 , A63F13/10 , A63F13/12 , A63F13/30 , A63F13/34 , A63F13/358 , A63F13/60 , A63F2300/534 , A63F2300/538 , A63F2300/6009 , A63F2300/63
摘要： Partitioned artificial intelligence (AI) for networked gaming. An exemplary system splits the AI into a computationally lightweight server-side component and a computationally intensive client-side component to harness the aggregate computational power of numerous gaming clients. Aggregating resources of many, even thousands of client machines enhances game realism in a manner that would be prohibitively expensive on the central server. The system is tolerant of latency between server and clients. Deterministic and stateless client-side components enable rapid handoff, preemptive migration, and replication of the client-side AI to address problems of client failure and game exploitation. The partitioned AI can support tactical gaming navigation, a challenging task to offload because of sensitivity to latency. The tactical navigation AI calculates influence fields partitioned into server-side and client-side components by means of a Taylor-series approximation.
摘要翻译：网络游戏分区人工智能（AI）。示例性系统将AI分解成计算轻量级的服务器侧组件和计算密集型客户端组件，以利用众多游戏客户端的总计算能力。许多甚至数以千计的客户端机器的资源的集合增强了在中央服务器上昂贵的游戏现实感。系统容忍服务器和客户端之间的延迟。确定性和无状态的客户端组件可以实现客户端AI的快速切换，抢占式迁移和复制，以解决客户端故障和游戏开发问题。分割的AI可以支持战术游戏导航，这是一个具有挑战性的任务，因为对延迟的敏感度要卸载。战术导航AI通过泰勒级数近似计算分割成服务器端和客户端分量的影响场。

13. 发明申请

US20120142430A1 PARTITIONED ARTIFICIAL INTELLIGENCE FOR NETWORKED GAMES 有权
标题翻译：网络游戏的人工智能分类
公开(公告)号：US20120142430A1
公开(公告)日：2012-06-07
申请号：US13372305
申请日：2012-02-13
申请人： John R. Douceur , Michael P. Calligaro , Randall C. Wood , Jacob R. Lorch
发明人： John R. Douceur , Michael P. Calligaro , Randall C. Wood , Jacob R. Lorch
IPC分类号： A63F9/24
CPC分类号： A63F13/355 , A63F13/10 , A63F13/12 , A63F13/30 , A63F13/34 , A63F13/358 , A63F13/60 , A63F2300/534 , A63F2300/538 , A63F2300/6009 , A63F2300/63
摘要： Partitioned artificial intelligence (AI) for networked gaming. An exemplary system splits the AI into a computationally lightweight server-side component and a computationally intensive client-side component to harness the aggregate computational power of numerous gaming clients. Aggregating resources of many, even thousands of client machines enhances game realism in a manner that would be prohibitively expensive on the central server. The system is tolerant of latency between server and clients. Deterministic and stateless client-side components enable rapid handoff, preemptive migration, and replication of the client-side AI to address problems of client failure and game exploitation. The partitioned AI can support tactical gaming navigation, a challenging task to offload because of sensitivity to latency. The tactical navigation AI calculates influence fields partitioned into server-side and client-side components by means of a Taylor-series approximation.
摘要翻译：网络游戏分区人工智能（AI）。示例性系统将AI分解成计算轻量级的服务器侧组件和计算密集型客户端组件，以利用众多游戏客户端的总计算能力。许多甚至数以千计的客户端机器的资源的集合增强了在中央服务器上昂贵的游戏现实感。系统容忍服务器和客户端之间的延迟。确定性和无状态的客户端组件可以实现客户端AI的快速切换，抢占式迁移和复制，以解决客户端故障和游戏开发问题。分割的AI可以支持战术游戏导航，这是一个具有挑战性的任务，因为对延迟的敏感度要卸载。战术导航AI通过泰勒级数近似计算分割成服务器端和客户端分量的影响场。

14. 发明申请

US20100035695A1 REDUCING BANDWIDTH REQUIREMENTS FOR PEER-TO-PEER GAMING BASED ON IMPORTANCE OF REMOTE OBJECTS TO A LOCAL PLAYER 有权
标题翻译：基于远程对象对本地玩家的重要性降低对等体游戏的带宽要求
公开(公告)号：US20100035695A1
公开(公告)日：2010-02-11
申请号：US12581807
申请日：2009-10-19
申请人： John R. Douceur , Jacob R. Lorch , Jeffrey Anson Pang , Frank Christopher Uyeda
发明人： John R. Douceur , Jacob R. Lorch , Jeffrey Anson Pang , Frank Christopher Uyeda
IPC分类号： A63F9/24
CPC分类号： A63F13/34 , A63F13/12 , A63F13/67 , A63F2300/407 , A63F2300/408 , A63F2300/6027 , H04L67/104 , H04L67/1059 , H04L67/30 , H04L67/38
摘要： Techniques enable the reduction of bandwidth requirements for peer-to-peer gaming architectures. In some embodiments, these techniques allow differentiation among players to decide which players should receive continuous updates and which should receive periodic updates. For those gaming systems receiving periodic updates, guided artificial intelligence is employed to simulate activity of a game object based on guidance provided by the periodic updates. Conversely, for those gaming systems receiving continuous updates, the continuous updates may be employed to update the activity of the game object rather than simulating the activity.
摘要翻译：技术可以减少对等游戏体系结构的带宽需求。在一些实施例中，这些技术允许玩家之间的区分，以决定哪些玩家应该接收连续的更新，哪些玩家应该接收周期性的更新。对于接收定期更新的那些游戏系统，采用引导人工智能来基于定期更新提供的指导来模拟游戏对象的活动。相反，对于接收连续更新的那些游戏系统，可以采用连续更新来更新游戏对象的活动，而不是模拟活动。

15. 发明申请

US20090203449A1 PARTITIONED ARTIFICIAL INTELLIGENCE FOR NETWORKED GAMES 有权
标题翻译：网络游戏的人工智能分类
公开(公告)号：US20090203449A1
公开(公告)日：2009-08-13
申请号：US12029286
申请日：2008-02-11
申请人： John R. Douceur , Michael P. Calligaro , Randall C. Wood , Jacob R. Lorch
发明人： John R. Douceur , Michael P. Calligaro , Randall C. Wood , Jacob R. Lorch
IPC分类号： A63F9/24
CPC分类号： A63F13/355 , A63F13/10 , A63F13/12 , A63F13/30 , A63F13/34 , A63F13/358 , A63F13/60 , A63F2300/534 , A63F2300/538 , A63F2300/6009 , A63F2300/63
摘要： Partitioned artificial intelligence (AI) for networked gaming. An exemplary system splits the AI into a computationally lightweight server-side component and a computationally intensive client-side component to harness the aggregate computational power of numerous gaming clients. Aggregating resources of many, even thousands of client machines enhances game realism in a manner that would be prohibitively expensive on the central server. The system is tolerant of latency between server and clients. Deterministic and stateless client-side components enable rapid handoff, preemptive migration, and replication of the client-side AI to address problems of client failure and game exploitation. The partitioned AI can support tactical gaming navigation, a challenging task to offload because of sensitivity to latency. The tactical navigation AI calculates influence fields partitioned into server-side and client-side components by means of a Taylor-series approximation.
摘要翻译：网络游戏分区人工智能（AI）。示例性系统将AI分解成计算轻量级的服务器侧组件和计算密集型客户端组件，以利用众多游戏客户端的总计算能力。许多甚至数以千计的客户端机器的资源的集合增强了在中央服务器上昂贵的游戏现实感。系统容忍服务器和客户端之间的延迟。确定性和无状态的客户端组件可以实现客户端AI的快速切换，抢占式迁移和复制，以解决客户端故障和游戏开发问题。分割的AI可以支持战术游戏导航，这是一个具有挑战性的任务，因为对延迟的敏感度要卸载。战术导航AI通过泰勒级数近似计算分割成服务器端和客户端分量的影响场。

16. 发明授权

US08812908B2 Fast, non-write-cycle-limited persistent memory for secure containers 有权
标题翻译：用于安全容器的快速，非写周期限制的持久性内存
公开(公告)号：US08812908B2
公开(公告)日：2014-08-19
申请号：US12887938
申请日：2010-09-22
申请人： John R. Douceur , Jacob R. Lorch
发明人： John R. Douceur , Jacob R. Lorch
IPC分类号： G06F11/00
CPC分类号： G06F11/1441 , G06F21/86
摘要： Techniques for providing fast, non-write-cycle-limited persistent memory within secure containers, while maintaining the security of the secure containers, are described herein. The secure containers may reside within respective computing devices (e.g., desktop computers, laptop computers, etc.) and may include both volatile storage (e.g., Random Access Memory (RAM), etc.) and non-volatile storage (NVRAM, etc.). In addition, the secure containers may couple to auxiliary power supplies that are located externally thereto and that power the secure containers at least temporarily in the event of a power failure. These auxiliary power supplies may be implemented as short-term power sources, such as capacitors, batteries, or any other suitable power supplies.
摘要翻译：在此保护安全容器的安全性的同时在安全容器内提供快速，非写周期限制的持久存储器的技术在这里被描述。安全容器可以驻留在相应的计算设备（例如，台式计算机，膝上型计算机等）内，并且可以包括易失性存储器（例如，随机存取存储器（RAM）等）和非易失性存储器（NVRAM等））。此外，安全容器可以耦合到位于外部的辅助电源，并且在电源故障的情况下至少暂时为安全容器供电。这些辅助电源可以实现为短期电源，例如电容器，电池或任何其它合适的电源。

17. 发明授权

US08719336B2 Method and apparatus for thwarting traffic analysis in online games 有权
标题翻译：阻止在线游戏流量分析的方法和装置
公开(公告)号：US08719336B2
公开(公告)日：2014-05-06
申请号：US12364913
申请日：2009-02-03
申请人： John R. Douceur , Jacob R. Lorch , Daekyeong Moon , Thomas Moscibroda
发明人： John R. Douceur , Jacob R. Lorch , Daekyeong Moon , Thomas Moscibroda
IPC分类号： G06F15/16
CPC分类号： A63F13/358 , A63F13/12 , A63F13/34 , A63F13/352 , A63F2300/513 , A63F2300/532 , A63F2300/534 , A63F2300/5566 , A63F2300/5586 , H04L67/104 , H04L67/2819 , H04L67/38
摘要： The subject disclosure relates to a method and apparatus for routing data in a network-based computer game via proxy computers. The method and system includes a set of techniques that utilizes the proxy computers to thwart traffic analysis in high-speed games while continuing to satisfy the games' latency requirements. The method and apparatus facilitates thwarting multiple classes of traffic analysis, including inspection of unencrypted header fields, observation of packet size, correlation of packet timing, and collusion among players. A matchmaking system for matching players in a network-based computer game in a manner that resists traffic analysis is also provided.
摘要翻译：本公开涉及一种用于经由代理计算机在基于网络的计算机游戏中路由数据的方法和装置。该方法和系统包括利用代理计算机在继续满足游戏等待时间要求的同时阻止高速游戏中的流量分析的一套技术。该方法和装置有助于阻止多类业务分析，包括对未加密报头字段的检查，分组大小的观察，分组定时的相关性和播放器之间的串通。还提供了一种用于以抵抗流量分析的方式在基于网络的计算机游戏中匹配玩家的配对系统。

18. 发明申请

US20100197405A1 METHOD AND APPARATUS FOR THWARTING TRAFFIC ANALYSIS IN ONLINE GAMES 有权
标题翻译：在线游戏中进行交通分析的方法和装置
公开(公告)号：US20100197405A1
公开(公告)日：2010-08-05
申请号：US12364913
申请日：2009-02-03
申请人： John R. Douceur , Jacob R. Lorch , Daekyeong Moon , Thomas Moscibroda
发明人： John R. Douceur , Jacob R. Lorch , Daekyeong Moon , Thomas Moscibroda
IPC分类号： A63F9/24
CPC分类号： A63F13/358 , A63F13/12 , A63F13/34 , A63F13/352 , A63F2300/513 , A63F2300/532 , A63F2300/534 , A63F2300/5566 , A63F2300/5586 , H04L67/104 , H04L67/2819 , H04L67/38
摘要： The subject disclosure relates to a method and apparatus for routing data in a network-based computer game via proxy computers. The method and system includes a set of techniques that utilizes the proxy computers to thwart traffic analysis in high-speed games while continuing to satisfy the games' latency requirements. The method and apparatus facilitates thwarting multiple classes of traffic analysis, including inspection of unencrypted header fields, observation of packet size, correlation of packet timing, and collusion among players. A matchmaking system for matching players in a network-based computer game in a manner that resists traffic analysis is also provided.
摘要翻译：本公开涉及一种用于经由代理计算机在基于网络的计算机游戏中路由数据的方法和装置。该方法和系统包括利用代理计算机在继续满足游戏等待时间要求的同时阻止高速游戏中的流量分析的一套技术。该方法和装置有助于阻止多类业务分析，包括对未加密报头字段的检查，分组大小的观察，分组定时的相关性和播放器之间的串通。还提供了一种用于以抵抗流量分析的方式在基于网络的计算机游戏中匹配玩家的配对系统。

19. 发明申请

US20120072771A1 Fast, Non-Write-Cycle-Limited Persistent Memory for Secure Containers 有权
标题翻译：用于安全容器的快速，非写周期有限的持久存储器
公开(公告)号：US20120072771A1
公开(公告)日：2012-03-22
申请号：US12887938
申请日：2010-09-22
申请人： John R. Douceur , Jacob R. Lorch
发明人： John R. Douceur , Jacob R. Lorch
IPC分类号： G06F11/08
CPC分类号： G06F11/1441 , G06F21/86
摘要： Techniques for providing fast, non-write-cycle-limited persistent memory within secure containers, while maintaining the security of the secure containers, are described herein. The secure containers may reside within respective computing devices (e.g., desktop computers, laptop computers, etc.) and may include both volatile storage (e.g., Random Access Memory (RAM), etc.) and non-volatile storage (NVRAM, etc.). In addition, the secure containers may couple to auxiliary power supplies that are located externally thereto and that power the secure containers at least temporarily in the event of a power failure. These auxiliary power supplies may be implemented as short-term power sources, such as capacitors, batteries, or any other suitable power supplies.
摘要翻译：在此保护安全容器的安全性的同时在安全容器内提供快速，非写周期限制的持久存储器的技术在这里被描述。安全容器可以驻留在相应的计算设备（例如，台式计算机，膝上型计算机等）内，并且可以包括易失性存储器（例如，随机存取存储器（RAM）等）和非易失性存储器（NVRAM等））。此外，安全容器可以耦合到位于外部的辅助电源，并且在电源故障的情况下至少暂时为安全容器供电。这些辅助电源可以实现为短期电源，例如电容器，电池或任何其它合适的电源。

20. 发明申请

US20110302449A1 COLLECTION ORDERING FOR REPLICATED STATE MACHINES 有权
标题翻译：收购国家机关的订购
公开(公告)号：US20110302449A1
公开(公告)日：2011-12-08
申请号：US12793547
申请日：2010-06-03
申请人： John R. Douceur , Jacob R. Lorch , Jonathan Howell
发明人： John R. Douceur , Jacob R. Lorch , Jonathan Howell
IPC分类号： G06F11/07 , G06F17/00
CPC分类号： G06F11/187 , G06F11/1482 , G06F2201/82
摘要： A replicated state machine with N replica servers may be configured to tolerate a count of F faults. A first operation (of a first ordering type) executes when a first quorum of correctly functioning replicas is available. A second operation (also of the first operation type) executes when a second quorum of correctly functioning replicas is available. A third operation (of a second ordering type) executes when a third quorum of correctly functioning replicas are available. The operations are executed by the replicated state machine such that: (1) the replicated state machine does not guarantee operational ordering between the first operation and the second operation; (2) the replicated state machine guarantees ordering between the first operation and the third operation; and (3) the replicated state machine guarantees ordering between the second operation and the third operation.
摘要翻译：具有N个副本服务器的复制状态机可以被配置为容忍F个故障的计数。当正常运行的副本的第一个法定数量可用时，执行第一个操作（第一个排序类型）。当正常运行的副本的第二个法定值可用时，执行第二个操作（也是第一个操作类型）。当正常运行的副本的第三个法定值可用时，执行第三次操作（第二次排序类型）。这些操作由复制状态机执行，使得：（1）复制状态机不保证第一操作和第二操作之间的操作顺序; （2）复制状态机保证第一操作和第三操作之间的顺序; 和（3）复制状态机保证第二操作和第三操作之间的顺序。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式