会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明申请
    • Method and Apparatus for Negotiation Management in Data Processing Systems
    • 数据处理系统中的协商管理方法与装置
    • US20090282415A1
    • 2009-11-12
    • US12112142
    • 2008-04-30
    • Bo AnFrederick DouglisBradley William FawcettAnton V. RiabovFan Ye
    • Bo AnFrederick DouglisBradley William FawcettAnton V. RiabovFan Ye
    • G06F9/50
    • G06F9/5038G06F2209/5014G06F2209/506
    • Techniques are disclosed for optimizing schedules used in implementing plans for performing tasks in data processing systems. For example, an automated method of negotiating for resources in a data processing system, wherein the data processing system comprises multiple sites, comprises a negotiation management component of a computer system at a given one of the sites performing the following steps. One or more tasks from at least one source of one or more plans are obtained. Each plan is annotated with one or more needed resources and one or more potential resource providers at one or more sites in the data processing system. An optimized resource negotiation schedule based on the one or more obtained tasks is computed. The schedule comprises an order in which resources are negotiated. In accordance with the optimized resource negotiation schedule, a request for each needed resource is sent to the one or more potential resource providers such that a negotiation process is performed between the negotiation management component and at least one of the potential resource providers.
    • 公开了用于优化用于在数据处理系统中执行任务的计划中使用的计划的技术。 例如,在数据处理系统中协商资源的自动化方法,其中所述数据处理系统包括多个站点,包括在执行以下步骤的给定一个站点处的计算机系统的协商管理组件。 获得来自一个或多个计划的至少一个来源的一个或多个任务。 每个计划在数据处理系统中的一个或多个站点上用一个或多个所需资源和一个或多个潜在资源提供者进行注释。 计算基于一个或多个获得的任务的优化的资源协商调度。 时间表包括协商资源的顺序。 根据优化的资源协商进度,向所述一个或多个潜在资源提供者发送对每个所需资源的请求,使得在协商管理组件和潜在资源提供者中的至少一个之间执行协商过程。
    • 23. 发明申请
    • System and Method of Planning for Cooperative Information Processing
    • 合作信息处理规划制度与方法
    • US20080256549A1
    • 2008-10-16
    • US11747826
    • 2007-05-11
    • Zhen LiuFan YeAnton V. Riabov
    • Zhen LiuFan YeAnton V. Riabov
    • G06F9/50
    • G06F9/5027G06F9/4881G06F9/5066G06F2209/5017G06Q10/06
    • A cooperative data stream processing system is provided that utilizes a plurality of independent, autonomous and possibly heterogeneous sites in a cooperative arrangement to execute jobs derived from user-define inquires over dynamic, continuous streams of data. A method is provided for cooperative planning for the execution of the jobs across the distributed plurality of sites. An identification of the resources available for sharing from each one of the plurality of sites is communicated to one or more planners disposed on the distributed sites. These planners use the resource information to generate planning domains in which the jobs can be processed. Upon receipt of an inquiry at one of the sites, the inquiry is communicated to one of the planners that uses the planning domain to create at least one distributed plan for the inquiry. Processing of the inquiry is conducted in accordance with the distributed plan. Planning can take advantage of the structure of virtual organizations including cooperative and federated virtual organizations. The distributed plans can make use of the resources within a single virtual organization or across multiple organizations.
    • 提供了一种协作数据流处理系统,其利用协作布置中的多个独立的,自主的和可能异构的站点来执行从动态的,连续的数据流的用户定义查询导出的作业。 提供了一种用于在分布式多个站点上执行作业的协作规划的方法。 从多个站点中的每个站点可用于共享的资源的识别被传送给设置在分布式站点上的一个或多个规划者。 这些规划者使用资源信息来生成可以处理作业的规划域。 在其中一个站点收到查询后,将向使用计划域的计划者传达查询,以创建至少一个用于查询的分布式计划。 查询的处理按照分布式计划进行。 规划可以利用虚拟组织的结构,包括合作社和联合虚拟组织。 分布式计划可以利用单个虚拟组织内或多个组织中的资源。
    • 24. 发明申请
    • Mechanism for Execution of Multi-Site Jobs in a Data Stream Processing System
    • 在数据流处理系统中执行多站点作业的机制
    • US20080256167A1
    • 2008-10-16
    • US11747813
    • 2007-05-11
    • Michael J. BransonFrederick DouglisFan Ye
    • Michael J. BransonFrederick DouglisFan Ye
    • G06F15/16G06F11/07
    • G06F11/203G06F9/5027G06F11/1438G06F11/1446G06F2209/5017G06F2209/508H04L69/40
    • A cooperative data stream processing system is provided that utilizes a plurality of independent, autonomous and possibly heterogeneous sites in a cooperative arrangement to process user-defined job requests over dynamic, continuous streams of data. A mechanism is provided for orchestrating the execution of distributed jobs across the plurality of distributed sites. A distributed plan is created that identifies the processing elements that constitute a job that is derived form user-defined inquiries. Within the distributed plan, these processing elements are arranged into subjobs that are mapped to various sites within the system for execution. Therefore, the jobs are then executed across the plurality of distributed sites in accordance with the distributed plan. The distributed plan also includes requirements for monitoring of execution sites and providing for the back-up of the execution sites in the event of a failure on one of those sites. Execution of the jobs in accordance with the distributed plan is facilitated by the identification of an owner site to which the distributed plan is communicated and which is responsible for driving the execution of the distributed plan.
    • 提供协作数据流处理系统,其利用协作布置中的多个独立的,自主的和可能异构的站点,以通过动态的,连续的数据流处理用户定义的作业请求。 提供了用于在多个分布式站点上编排分布式作业的执行的机制。 创建一个分布式计划,用于标识构成从用户定义的查询导出的作业的处理元素。 在分布式计划中,这些处理元素被排列成被映射到系统内的各个站点以执行的子对象。 因此,这些作业然后根据分布式计划在多个分布式站点之间执行。 分布式计划还包括监控执行站点的要求,并在其中一个站点发生故障时提供执行站点的备份。 通过识别分配的计划被传达的所有者站点以及负责驱动分布式计划的执行来促进按照分布式计划执行作业。
    • 25. 发明授权
    • Method and system for resilient packet traceback in wireless mesh and sensor networks
    • 无线网格和传感器网络中弹性数据包追溯的方法和系统
    • US08695089B2
    • 2014-04-08
    • US11694388
    • 2007-03-30
    • Zhen LiuHao YangFan Ye
    • Zhen LiuHao YangFan Ye
    • H04L29/06
    • H04L63/1458H04L63/1466H04L2463/146H04W84/20
    • A system and method for packet traceback in a network includes maintaining an identity number (ID) for each node in a network and generating a signature (e.g., a message authentication code (MAC)) using a secret key shared between each node on a forwarding path and a sink. Each forwarding node leaves a mark by appending its ID and a signature in the packet, either in a deterministic manner or with a probability. Upon receiving a packet at the sink, correctness of the signatures included in each packet is verified in the reverse order by which these signatures were appended. A last valid MAC is determined in the forwarding path to determine the locations of compromised nodes that collude in false data injection attacks.
    • 用于网络中的数据包追溯的系统和方法包括维护网络中每个节点的身份号码(ID),并使用转发上的每个节点之间共享的密钥生成签名(例如,消息认证码(MAC)) 路径和水槽。 每个转发节点通过以确定性方式或以概率将其ID和签名附加在分组中来留下标记。 在接收器处接收到分组时,以附加这些签名的相反顺序来验证每个分组中包括的签名的正确性。 在转发路径中确定最后一个有效MAC,以确定在虚假数据注入攻击中并发的受损节点的位置。
    • 26. 发明授权
    • Negotiation management in data processing systems
    • 数据处理系统中的谈判管理
    • US08656403B2
    • 2014-02-18
    • US12112142
    • 2008-04-30
    • Bo AnFrederick DouglisBradley William FawcettAnton V. RiabovFan Ye
    • Bo AnFrederick DouglisBradley William FawcettAnton V. RiabovFan Ye
    • G06F9/46
    • G06F9/5038G06F2209/5014G06F2209/506
    • Techniques are disclosed for optimizing schedules used in implementing plans for performing tasks in data processing systems. For example, an automated method of negotiating for resources in a data processing system, wherein the data processing system comprises multiple sites, comprises a negotiation management component of a computer system at a given one of the sites performing the following steps. One or more tasks from at least one source of one or more plans are obtained. Each plan is annotated with one or more needed resources and one or more potential resource providers at one or more sites in the data processing system. An optimized resource negotiation schedule based on the one or more obtained tasks is computed. The schedule comprises an order in which resources are negotiated. In accordance with the optimized resource negotiation schedule, a request for each needed resource is sent to the one or more potential resource providers such that a negotiation process is performed between the negotiation management component and at least one of the potential resource providers.
    • 公开了用于优化用于在数据处理系统中执行任务的计划中使用的计划的技术。 例如,在数据处理系统中协商资源的自动化方法,其中所述数据处理系统包括多个站点,包括在执行以下步骤的给定一个站点处的计算机系统的协商管理组件。 获得来自一个或多个计划的至少一个来源的一个或多个任务。 每个计划在数据处理系统中的一个或多个站点上用一个或多个所需资源和一个或多个潜在资源提供者进行注释。 计算基于一个或多个获得的任务的优化的资源协商调度。 时间表包括协商资源的顺序。 根据优化的资源协商进度,向所述一个或多个潜在资源提供者发送对每个所需资源的请求,使得在协商管理组件和潜在资源提供者中的至少一个之间执行协商过程。
    • 27. 发明授权
    • Mechanism for execution of multi-site jobs in a data stream processing system
    • 在数据流处理系统中执行多站点作业的机制
    • US08417762B2
    • 2013-04-09
    • US11747813
    • 2007-05-11
    • Michael J. BransonFrederick DouglisFan Ye
    • Michael J. BransonFrederick DouglisFan Ye
    • G06F15/16G06F15/00
    • G06F11/203G06F9/5027G06F11/1438G06F11/1446G06F2209/5017G06F2209/508H04L69/40
    • A cooperative data stream processing system utilizing a plurality of independent, autonomous and heterogeneous sites in a cooperative arrangement process user-defined job requests over dynamic, continuous streams of data. A distributed plan is created that identifies the processing elements that constitute a job that is derived from user-defined inquiries. These processing elements are arranged into subjobs that are mapped to various sites within the system for execution. The jobs are executed across the plurality of distributed sites in accordance with the distributed plan. The distributed plan also includes requirements for monitoring and back-up of the execution sites in the event of a failure on one of those sites. Execution of the jobs in accordance with the distributed plan is facilitated by the identification of an owner site to which the distributed plan is communicated and which is responsible for driving the execution of the distributed plan.
    • 在协作安排过程中利用多个独立的,自主的和异构的站点的协作数据流处理系统用户定义的作业通过动态的,连续的数据流请求。 创建一个分布式计划,标识构成从用户定义的查询导出的作业的处理元素。 这些处理元件被布置成被映射到系统内的各个站点以执行的子对象。 根据分布式计划,这些作业在多个分布式站点之间执行。 分布式计划还包括在其中一个站点发生故障时监视和备份执行站点的要求。 通过识别分配的计划被传达的所有者站点以及负责驱动分布式计划的执行来促进按照分布式计划执行作业。
    • 28. 发明授权
    • Mechanism for recovery from site failure in a stream processing system
    • 在流处理系统中从站点故障恢复的机制
    • US08219848B2
    • 2012-07-10
    • US11733724
    • 2007-04-10
    • Michael John BransonFrederick DouglisBradley William FawcettZhen LiuBin RongFan Ye
    • Michael John BransonFrederick DouglisBradley William FawcettZhen LiuBin RongFan Ye
    • G06F11/00
    • G06F11/2025G06F11/2048G06F11/2097
    • A failure recovery framework to be used in cooperative data stream processing is provided that can be used in a large-scale stream data analysis environment. Failure recovery supports a plurality of independent distributed sites, each having its own local administration and goals. The distributed sites cooperate in an inter-site back-up mechanism to provide for system recovery from a variety of failures within the system. Failure recovery is both automatic and timely through cooperation among sites. Back-up sites associated with a given primary site are identified. These sites are used to identify failures within the primary site including failures of applications running on the nodes of the primary site. The failed applications are reinstated on one or more nodes within the back-up sites using job management instances local to the back-up sites in combination with previously stored state information and data values for the failed applications. In additions to inter-site mechanisms, each one of the plurality of sites employs an intra-site back-up mechanism to handle failure recoveries within the site.
    • 提供了可用于协作数据流处理的故障恢复框架,可用于大规模流数据分析环境。 故障恢复支持多个独立的分布式站点,每个都有自己的本地管理和目标。 分布式站点在站点间备份机制中进行协作,以便从系统内的各种故障提供系统恢复。 故障恢复是通过站点之间的合作自动和及时的。 识别与给定主要站点相关联的备用站点。 这些站点用于识别主站点中的故障,包括在主站点的节点上运行的应用程序的故障。 使用备份站点本地的作业管理实例以及先前存储的状态信息和失败应用程序的数据值,在备份站点中的一个或多个节点上恢复失败的应用程序。 除了站点间机制之外,多个站点中的每一个都采用站内备用机制来处理站点内的故障恢复。
    • 30. 发明申请
    • METHOD AND SYSTEM FOR RESILIENT PACKET TRACEBACK IN WIRELESS MESH AND SENSOR NETWORKS
    • 无线网络和传感器网络中的回复分组跟踪的方法和系统
    • US20080244739A1
    • 2008-10-02
    • US11694388
    • 2007-03-30
    • Zhen LiuHao YangFan Ye
    • Zhen LiuHao YangFan Ye
    • G06F12/14
    • H04L63/1458H04L63/1466H04L2463/146H04W84/20
    • A system and method for packet traceback in a network includes maintaining an identity number (ID) for each node in a network and generating a signature (e.g., a message authentication code (MAC)) using a secret key shared between each node on a forwarding path and a sink. Each forwarding node leaves a mark by appending its ID and a signature in the packet, either in a deterministic manner or with a probability. Upon receiving a packet at the sink, correctness of the signatures included in each packet is verified in the reverse order by which these signatures were appended. A last valid MAC is determined in the forwarding path to determine the locations of compromised nodes that collude in false data injection attacks.
    • 用于网络中的数据包追溯的系统和方法包括维护网络中每个节点的身份号码(ID),并使用转发上的每个节点之间共享的密钥生成签名(例如,消息认证码(MAC)) 路径和水槽。 每个转发节点通过以确定性方式或以概率将其ID和签名附加在分组中来留下标记。 在接收器处接收到分组时,以附加这些签名的相反顺序来验证每个分组中包括的签名的正确性。 在转发路径中确定最后一个有效MAC,以确定在虚假数据注入攻击中并发的受损节点的位置。