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

71. 发明授权

US07466656B2 Method, apparatus and program storage device for efficient construction of network overlays through interconnection topology embedding 失效
标题翻译：方法，设备和程序存储设备，通过互连拓扑嵌入有效地构建网络覆盖
公开(公告)号：US07466656B2
公开(公告)日：2008-12-16
申请号：US10973329
申请日：2004-10-26
申请人： Parijat Dube , Zhen Liu , Dimitrios Pendarakis , George V. Popescu
发明人： Parijat Dube , Zhen Liu , Dimitrios Pendarakis , George V. Popescu
IPC分类号： H04L12/26
CPC分类号： H04L41/12 , H04L41/22 , H04L67/104 , H04L67/1044 , H04L67/1089 , H04L67/16
摘要： Methods, apparatuses and program storage devices for constructing a network overlay via embedding an interconnection network in a network overlay graph are provided herein. The network delay distances between pairs of overlay nodes are measured on the shortest network paths. The mapping of the interconnection topology to the network overlay nodes preferably involves assigning 2m m-length binary indexes to the network overlay nodes. There is proposed herein a polynomial time algorithm for interconnection topology embedding using iterative cluster division and node binary index assignment. There is further proposed herein a method for construction of network overlays through interconnection network topology embedding, with the objective of optimizing a quality of service metric (e.g. minimization of the average network overlay routing delay).
摘要翻译：本文提供了通过在网络覆盖图中嵌入互连网络来构建网络覆盖的方法，设备和程序存储设备。在最短的网络路径上测量覆盖节点对之间的网络延迟距离。互连拓扑到网络覆盖节点的映射优选地涉及向网络覆盖节点分配2m m长的二进制索引。本文提出了一种使用迭代集群划分和节点二进制索引分配的互连拓扑嵌入的多项式时间算法。此外还提出了通过互连网络拓扑嵌入来构建网络覆盖的方法，目的是优化服务质量度量（例如，平均网络覆盖路由延迟的最小化）。

72. 发明申请

US20080304516A1 Distributed Joint Admission Control And Dynamic Resource Allocation In Stream Processing Networks 失效
标题翻译：流处理网络中的分布式联合接入控制和动态资源分配
公开(公告)号：US20080304516A1
公开(公告)日：2008-12-11
申请号：US11758706
申请日：2007-06-06
申请人： Hanhua Feng , Zhen Liu , Honghui Xia , Li Zhang
发明人： Hanhua Feng , Zhen Liu , Honghui Xia , Li Zhang
IPC分类号： H04J3/16
CPC分类号： G06F9/5066 , G06F9/5038
摘要： Methods and apparatus operating in a stream processing network perform load shedding and dynamic resource allocation so as to meet a pre-determined utility criterion. Load shedding is envisioned as an admission control problem encompassing source nodes admitting workflows into the stream processing network. A primal-dual approach is used to decompose the admission control and resource allocation problems. The admission control operates as a push-and-pull process with sources pushing workflows into the stream processing network and sinks pulling processed workflows from the network. A virtual queue is maintained at each node to account for both queue backlogs and credits from sinks. Nodes of the stream processing network maintain shadow prices for each of the workflows and share congestion information with neighbor nodes. At each node, resources are devoted to the workflow with the maximum product of downstream pressure and processing rate, where the downstream pressure is defined as the backlog difference between neighbor nodes. The primal-dual controller iteratively adjusts the admission rates and resource allocation using local congestion feedback. The iterative controlling procedure further uses an interior-point method to improve the speed of convergence towards optimal admission and allocation decisions.
摘要翻译：在流处理网络中操作的方法和装置执行卸载和动态资源分配，以满足预定的效用标准。负载脱落被设想为包括允许流程处理网络中的工作流的源节点的准入控制问题。使用原始双重方法来分解入学控制和资源分配问题。准入控制作为推拉过程进行操作，其中源将工作流推送到流处理网络并且从网络中吸收经处理的工作流。每个节点都维护一个虚拟队列，以解决队列积压和来自宿的积分。流处理网络的节点维护每个工作流的影子价格，并与邻居节点共享拥塞信息。在每个节点，资源用于工作流程，具有下游压力和处理速率的最大乘积，其中下游压力被定义为相邻节点之间的积压差异。原始双控制器使用局部拥塞反馈迭代地调整入局速率和资源分配。迭代控制程序进一步使用内点方法来提高收敛速度以达到最佳准入和分配决策。

73. 发明申请

US20080256166A1 Method for Inter-Site Data Stream Transfer in a Cooperative Data Stream Processing 失效
标题翻译：在协同数据流处理中的站点间数据流传输方法
公开(公告)号：US20080256166A1
公开(公告)日：2008-10-16
申请号：US11747694
申请日：2007-05-11
申请人： Michael J. Branson , Frederick Douglis , Zhen Liu , Fan Ye
发明人： Michael J. Branson , Frederick Douglis , Zhen Liu , Fan Ye
IPC分类号： G06F15/16
CPC分类号： H04L12/4633 , H04L69/40
摘要： A cooperative data stream processing system is provided that utilizes a plurality of independent, autonomous and potentially heterogeneous sites in a cooperative arrangement to process user-defined inquiries over dynamic, continuous streams of data. The system derives jobs from the inquiries and these jobs are executed on the various distributed sites by executing applications containing processing elements on these sites. Therefore, components of a given job can be executed simultaneously and in parallel on a plurality of sites within in the system. The sites associated with a given job execution have the need to share data, both primal and derived. A tunnel mechanism is provided that establishes tunnels between pairs of sites within the system. Each tunnel includes either a sink processing element on an originating site and a source processing element on a destination site or a gateway processing element on each site and a network connection between the sink and source processing elements. The sink and source processing elements are in communication with application processing elements on their respective sites and facilitate the exchange of data between these application processing elements. Tunnels can be establish on demand or in accordance with a prescribed plan and can be job specific of generic to any job executing on a given pair of sites.
摘要翻译：提供协作数据流处理系统，其利用协作布置中的多个独立的，自主的和潜在的异构站点来处理关于动态的，连续的数据流的用户定义的查询。系统从查询中导出作业，这些作业通过执行包含这些站点上的处理元素的应用程序在各种分布式站点上执行。因此，给定作业的组件可以在系统内的多个站点上同时并行地执行。与给定作业执行相关联的站点需要共享数据，包括原始数据和派生数据。提供了一种在系统内的站点对之间建立隧道的隧道机制。每个隧道包括发起站点上的宿处理元件和目的站点上的源处理元件或每个站点上的网关处理元件以及宿和源处理元件之间的网络连接。宿和源处理元件与其各自站点上的应用处理元件通信，并且便于这些应用处理元件之间的数据交换。隧道可以根据需要或按照规定的计划建立，并且可以对于在给定的一对站点上执行的任何作业具有通用性。

74. 发明申请

US20080244540A1 METHOD AND SYSTEM FOR ASSEMBLING INFORMATION PROCESSING APPLICATIONS BASED ON DECLARATIVE SEMANTIC SPECIFICATIONS 有权
标题翻译：基于声明语义规范组装信息处理应用的方法和系统
公开(公告)号：US20080244540A1
公开(公告)日：2008-10-02
申请号：US11695238
申请日：2007-04-02
申请人： Mark D. Feblowitz , Nagui Halim , Zhen Liu , Anand Ranganathan , Anton V. Riabov
发明人： Mark D. Feblowitz , Nagui Halim , Zhen Liu , Anand Ranganathan , Anton V. Riabov
IPC分类号： G06F9/45
CPC分类号： G06F8/60 , G06F8/10 , G06F8/41
摘要： A method for assembling an information processing application, includes: inputting a plurality of component descriptions, wherein each of the component descriptions includes a graph pattern that semantically describes an applicability condition of a component and a graph pattern that semantically describes an inclusion effect of the component; inputting a processing request, wherein the processing request includes a goal that is represented by a graph pattern that semantically describes a desired processing outcome; assembling a processing graph, wherein the processing graph includes at least one component that satisfies the desired processing outcome; and outputting the processing graph.
摘要翻译：一种用于组合信息处理应用的方法，包括：输入多个组件描述，其中每个组件描述包括语义上描述组件的适用性条件的图形模式和语义上描述组件的包含效应的图形模式 ; 输入处理请求，其中所述处理请求包括由语义上描述期望的处理结果的图形模式表示的目标; 组装处理图，其中处理图包括满足期望处理结果的至少一个组件; 并输出处理图。

75. 发明申请

US20080244072A1 DISTRIBUTED RESOURCE ALLOCATION IN STREAM PROCESSING SYSTEMS 有权
标题翻译：流域处理系统中分布式资源分配
公开(公告)号：US20080244072A1
公开(公告)日：2008-10-02
申请号：US12132855
申请日：2008-06-04
申请人： James Andrew Broberg , Zhen Liu , Honghui Xia , Li Zhang
发明人： James Andrew Broberg , Zhen Liu , Honghui Xia , Li Zhang
IPC分类号： G06F15/16
CPC分类号： H04L47/10 , H04L47/25 , H04L47/30
摘要： A system and method for resource allocation includes, in a network having nodes and links, injecting units of flow for at least one commodity at a source corresponding to the at least one commodity. At each node, queue heights, associated with the at least one commodity, are balanced for queues associated with each of one or more outgoing paths associated with that node. An amount of commodity flow is pushed across a link toward a sink, where the amount of commodity flow is constrained by a capacity constraint. Flow that reached the sink is absorbed by draining the queues.
摘要翻译：用于资源分配的系统和方法包括在具有节点和链路的网络中，在与所述至少一种商品相对应的源处的至少一种商品的注入单元流中。在每个节点处，与至少一个商品相关联的队列高度对于与与该节点相关联的一个或多个输出路径中的每一个相关联的队列进行平衡。商品流的量被推向一个靠近水槽的连接处，其中商品流的量被容量限制所约束。到达水槽的流量通过排空排队而被吸收。

76. 发明申请

US20080243449A1 METHOD FOR DECLARATIVE SEMANTIC EXPRESSION OF USER INTENT TO ENABLE GOAL-DRIVEN INFORMATION PROCESSING 失效
标题翻译：用户意图表达用于实现目标信息处理的方法
公开(公告)号：US20080243449A1
公开(公告)日：2008-10-02
申请号：US11695279
申请日：2007-04-02
申请人： Mark D. Feblowitz , Nagui Halim , Zhen Liu , Anand Ranganathan , Anton V. Riabov
发明人： Mark D. Feblowitz , Nagui Halim , Zhen Liu , Anand Ranganathan , Anton V. Riabov
IPC分类号： G06F7/60
CPC分类号： G06F8/10
摘要： A method for constructing a processing request so that an information processing application satisfying the processing request can be assembled, includes: inputting a processing request, wherein the processing request includes a goal that is represented by a graph pattern that semantically describes a desired processing outcome; and assembling a processing graph that includes at least one component that satisfies the desired processing outcome, wherein the processing graph is assembled by associating the graph pattern that semantically describes the desired processing outcome with a graph pattern that semantically describes an applicability condition of the at least one component or a graph pattern that semantically describes an inclusion effect of the at least one component.
摘要翻译：一种用于构建处理请求以使得能够组合满足处理请求的信息处理应用程序的方法包括：输入处理请求，其中处理请求包括由语义上描述期望的处理结果的图形模式表示的目标; 以及组合包括满足期望的处理结果的至少一个组件的处理图，其中通过将语义上描述所需处理结果的图形模式与语义上描述至少一个适用性条件的图形模式相关联来组合处理图语义上描述至少一个组件的包含效应的一个组件或图形模式。

77. 发明申请

US20080172671A1 METHOD AND SYSTEM FOR EFFICIENT MANAGEMENT OF RESOURCE UTILIZATION DATA IN ON-DEMAND COMPUTING 审中-公开
标题翻译：资源利用数据在需求计算中的有效管理方法与系统
公开(公告)号：US20080172671A1
公开(公告)日：2008-07-17
申请号：US11622163
申请日：2007-01-11
申请人： Eric Bouillet , Zhen Liu , Dimitrios Pendarakis , Cary Perkins , Li Zhang
发明人： Eric Bouillet , Zhen Liu , Dimitrios Pendarakis , Cary Perkins , Li Zhang
IPC分类号： G06F9/46
CPC分类号： G06F11/3476 , G06F11/3452
摘要： The present invention is based on the main ideas that different sub-intervals of a resource utilization time series are to be summarized with different granularity in the time axis, depending on the values of the series over that interval. Therefore, periods of high resource utilization are represented with higher time granularity, while periods of low resource utilization are represented with lower time granularity, the value stored can represent a function of the summarized values, such as the average or maximum value of the low resource utilization period. The captured resource utilization data is used to generate profiles, wherein the profiles summarize the historical utilization data. The profiles further capture pseudo-periodic behavior over different time scales.
摘要翻译：本发明基于如下主要思想：资源利用时间序列的不同子时间间隔在时间轴上以不同的粒度被总结，这取决于该间隔上的序列值。因此，高资源利用周期以较高的时间粒度表示，而资源利用率低的周期以较低的时间粒度表示，存储的值可以表示汇总值的函数，例如低资源的平均值或最大值利用期。捕获的资源利用率数据用于生成简档，其中概要文件概括了历史使用数据。轮廓进一步捕获不同时间尺度的伪周期行为。

78. 发明申请

US20080168529A1 SYSTEM AND METHOD FOR SECURITY PLANNING WITH SOFT SECURITY CONSTRAINTS 失效
标题翻译：用软安全约束进行安全计划的系统和方法
公开(公告)号：US20080168529A1
公开(公告)日：2008-07-10
申请号：US11619856
申请日：2007-01-04
申请人： Kay Schwendimann Anderson , Pau-Chen Cheng , Trenton Ray Jaeger , Zhen Liu , Anton Viktorovich Riabov , Pankaj Rohatgi , Angela Schuett Reninger , Grant Wagner
发明人： Kay Schwendimann Anderson , Pau-Chen Cheng , Trenton Ray Jaeger , Zhen Liu , Anton Viktorovich Riabov , Pankaj Rohatgi , Angela Schuett Reninger , Grant Wagner
IPC分类号： G06F17/00
CPC分类号： H04L63/20 , G06F21/577 , H04L63/105
摘要： A method for security planning with soft security constraints, include: receiving security-related requirements of a workflow to be developed using system inputs and processing components; and generating at least one proposed workflow according to the security-related requirements, wherein the at least one proposed workflow satisfies soft constraints.
摘要翻译：一种具有软安全约束的安全规划方法包括：使用系统输入和处理组件接收要开发的工作流的安全相关要求; 以及根据所述安全相关要求生成至少一个所提出的工作流，其中所述至少一个所提出的工作流满足软限制。

79. 发明授权

US07392319B2 Method and apparatus for failure resilient forwarding of data over a computer network 失效
标题翻译：通过计算机网络对数据进行故障恢复转发的方法和装置
公开(公告)号：US07392319B2
公开(公告)日：2008-06-24
申请号：US10830779
申请日：2004-04-23
申请人： Zhen Liu , Sambit Sahu , Jeremy I. Silber
发明人： Zhen Liu , Sambit Sahu , Jeremy I. Silber
IPC分类号： G06F15/16
CPC分类号： H04L41/0654 , H04L45/00 , H04L67/2842 , H04L67/2852 , H04L69/16 , H04L69/163 , H04L69/165 , H04L69/40
摘要： In one embodiment, the present invention is a method and an apparatus for failure-resilient forwarding of data over a computer network. In one embodiment, a marker is introduced into the data stream, e.g., at the sending node, and allows, in turn, forwarding nodes and/or receivers to efficiently track data stream reception. The marker functions as a checkpoint for the data transport process, and is identified and indexed at each forwarding node and receiver. Each receiver saves the marker prior to delivering data to an application, thereby designating a point in the data stream at which all preceding data is confirmed to have been delivered to the application. Thus, if a forwarding node fails, the receiver may request stream data from an alternate forwarding node by specifying to the alternate forwarding node to provide data starting from the marker.
摘要翻译：在一个实施例中，本发明是用于在计算机网络上进行数据故障恢复转发的方法和装置。在一个实施例中，将标记引入数据流，例如在发送节点处，并且允许转发节点和/或接收器以有效地跟踪数据流接收。标记用作数据传输过程的检查点，并在每个转发节点和接收器处被识别和索引。每个接收器在将数据传送到应用程序之前保存标记，从而指定数据流中的所有先前数据被确认已被递送到应用的点。因此，如果转发节点发生故障，则接收方可以通过指定备用转发节点从标记开始提供数据来从备用转发节点请求流数据。

80. 发明授权

US07355968B2 Method of stateless group communication and repair of data packets transmission to nodes in a distribution tree 失效
标题翻译：无状态组通信和修复分发树中节点的数据包传输方法
公开(公告)号：US07355968B2
公开(公告)日：2008-04-08
申请号：US10674335
申请日：2003-09-30
申请人： Zhen Liu , George V. Popescu
发明人： Zhen Liu , George V. Popescu
IPC分类号： H04J1/16
CPC分类号： H04L45/48 , H04L12/185 , H04L12/1854 , H04L45/00 , H04L45/16 , H04L69/22 , H04L69/40
摘要： Disclosed is a method for stateless group communication based on constructing and encoding sender based trees. The headers obtained by encoding the distribution trees are inserted in each communication packet. The encoding allows partial or full decoding of the distribution trees. The encoding is performed to minimize the overhead of the header and the processing required for partial decoding of the distribution tree. The invention includes mechanisms for processing the encoded header at intermediate nodes in the distribution tree in order to determine the next communication nodes and mechanisms for modification and re-encoding of the trees in order to provide resilience to network failures or to react to application level specified conditions.
摘要翻译：公开了一种基于构建和编码基于发送方的树的无状态组通信的方法。通过编码分发树获得的报头被插入到每个通信分组中。编码允许分发树的部分或完全解码。执行编码以使头部的开销和分配树的部分解码所需的处理最小化。本发明包括用于在分发树中的中间节点处处理编码报头的机制，以便确定下一个通信节点和用于树的修改和重新编码的机制，以便提供对网络故障的恢复性或者对指定的应用级别做出反应条件。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式