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

1. 发明申请

US20080170592A1 ALMOST PEER-TO-PEER CLOCK SYNCHRONIZATION 审中-公开
标题翻译：同步对等时钟同步
公开(公告)号：US20080170592A1
公开(公告)日：2008-07-17
申请号：US11622177
申请日：2007-01-11
申请人： Michel H.T. Hack , Zhen Liu , Ahmed A. Sobeih , Li Zhang
发明人： Michel H.T. Hack , Zhen Liu , Ahmed A. Sobeih , Li Zhang
IPC分类号： H04J3/06
CPC分类号： H04J3/0641 , H04J3/0664 , H04J3/0676
摘要： Disclosed are a method of and a system for synchronizing clocks in a coordinated network of computers including a multitude of processing nodes, each of the nodes having a clock and one or more neighbor nodes. The method comprises the steps of electing one of the nodes as a correct leader node; and each of the non-leader nodes adjusting its clock rate, based on messages exchanged with neighbor nodes, to remain synchronized with the clock of said correct leader node. In a preferred embodiment, the adjusting step includes the step of each of the non-correct leader nodes using a weight assignment mechanism that gives neighbor nodes that are closer to the leader node more effect on the clock adjustment than those nodes that are further away from the correct leader node.
摘要翻译：公开了一种用于在包括多个处理节点的计算机的协调网络中同步时钟的方法和系统，每个节点具有时钟和一个或多个相邻节点。该方法包括以下步骤：将节点中的一个选为正确的前导节点; 并且每个非前导节点基于与邻居节点交换的消息来调整其时钟速率，以与所述正确的前导节点的时钟保持同步。在优选实施例中，调整步骤包括使用加权分配机制的每个非正确的前导节点的步骤，该加权分配机制给予距离前导节点更靠近时钟调整的相邻节点，而不是远离更远的节点正确的领导节点。

2. 发明申请

US20120284418A1 Techniques For Improved Clock Offset Measuring 有权
标题翻译：改进时钟偏移测量技术
公开(公告)号：US20120284418A1
公开(公告)日：2012-11-08
申请号：US13554000
申请日：2012-07-20
申请人： Steven E. Froehlich , Michel H.T. Hack , Xiaoqiao Meng , Li Zhang
发明人： Steven E. Froehlich , Michel H.T. Hack , Xiaoqiao Meng , Li Zhang
IPC分类号： G06F15/16
CPC分类号： H04J3/0667 , H04L47/10
摘要： In an exemplary aspect, method, apparatus, and program products are disclosed suitable for clock offset determination. One method includes performing a number of exchanges of at least single bytes with another network node, where values of the single bytes are different for the exchanges. The method also includes capturing and storing timestamps for each of the number of exchanges performed on the network node. A second method includes capturing and saving arrival timestamps for each of a number of timing messages in a set of timing messages received from another network node. This second method also includes sending the timestamps to at least the another node in response to completion of the set of timing messages.
摘要翻译：在示例性方面，公开了适用于时钟偏移确定的方法，装置和程序产品。一种方法包括与另一个网络节点执行至少单个字节的多个交换，其中单个字节的值对于交换机是不同的。该方法还包括捕获和存储在网络节点上执行的每个交换机的时间戳。第二种方法包括捕获并保存从另一网络节点接收的一组定时消息中的多个定时消息中的每一个的到达时间戳。该第二种方法还包括响应于该组定时消息的完成向至少另一个节点发送时间戳。

3. 发明申请

US20110106968A1 Techniques For Improved Clock Offset Measuring 有权
标题翻译：改进时钟偏移测量技术
公开(公告)号：US20110106968A1
公开(公告)日：2011-05-05
申请号：US12610430
申请日：2009-11-02
申请人： Steven E. Froehlich , Michel H.T. Hack , Xiaoqiao Meng , Li Zhang
发明人： Steven E. Froehlich , Michel H.T. Hack , Xiaoqiao Meng , Li Zhang
IPC分类号： G06F15/16
CPC分类号： H04J3/0667 , H04L47/10
摘要： In an exemplary aspect, method, apparatus, and program products are disclosed suitable for clock offset determination. One method includes performing a number of exchanges of at least single bytes with another network node, where values of the single bytes are different for the exchanges. The method also includes capturing and storing timestamps for each of the number of exchanges performed on the network node. A second method includes capturing and saving arrival timestamps for each of a number of timing messages in a set of timing messages received from another network node. This second method also includes sending the timestamps to at least the another node in response to completion of the set of timing messages.
摘要翻译：在示例性方面，公开了适用于时钟偏移确定的方法，装置和程序产品。一种方法包括与另一个网络节点执行至少单个字节的多个交换，其中单个字节的值对于交换机是不同的。该方法还包括捕获和存储在网络节点上执行的每个交换机的时间戳。第二种方法包括捕获并保存从另一网络节点接收的一组定时消息中的多个定时消息中的每一个的到达时间戳。该第二种方法还包括响应于该组定时消息的完成向至少另一个节点发送时间戳。

4. 发明申请

US20100037081A1 Method and Apparatus for Maintaining Time in a Computer System 失效
标题翻译：在计算机系统中维护时间的方法和装置
公开(公告)号：US20100037081A1
公开(公告)日：2010-02-11
申请号：US12186658
申请日：2008-08-06
申请人： Steven Froehlich , Michel H.T. Hack , Xiaoqiao Meng , Li Zhang
发明人： Steven Froehlich , Michel H.T. Hack , Xiaoqiao Meng , Li Zhang
IPC分类号： G06F1/04
CPC分类号： G06F1/14
摘要： A computer system is arranged with a circular buffer that includes a piecewise linear map from a high-resolution counter arranged to maintain International Atomic Time. The piecewise linear map includes a current leg that is currently being used and also a future leg that will be used in the future. The future leg is computed while the current leg is still being used.
摘要翻译：计算机系统布置有循环缓冲器，其包括布置成保持国际原子时间的高分辨率计数器的分段线性映射。分段线性映射包括当前正在使用的当前分支，以及将来将要使用的未来分支。当前腿仍在使用时计算未来的腿。

5. 发明授权

US08040824B2 Methods and apparatus for content delivery via application level multicast with minimum communication delay 失效
标题翻译：通过最小通信延迟的应用级多播的内容传送的方法和装置
公开(公告)号：US08040824B2
公开(公告)日：2011-10-18
申请号：US12502714
申请日：2009-07-14
申请人： Zhen Liu , Anton Riabov , Li Zhang
发明人： Zhen Liu , Anton Riabov , Li Zhang
IPC分类号： H04L12/28
CPC分类号： H04L45/48 , H04L12/1881 , H04L45/16
摘要： A method for constructing an overlay multicast tree to deliver data from a source to an identified group of nodes is provided in which a plurality of nodes are identified and mapped into multidimensional Euclidean space. A geometric region is constructing having a size that is the minimum size necessary to contain the source and all the nodes. Once constructed, a tree is created beginning at the source and including all of the nodes within the geometric region.
摘要翻译：提供了一种用于构建覆盖多播树以将数据从源传送到所识别的节点组的方法，其中多个节点被识别并映射到多维欧几里德空间中。一个几何区域正在构造，其大小是包含源和所有节点所需的最小大小。一旦构造，从源头创建树，并且包括几何区域内的所有节点。

6. 发明授权

US07889651B2 Distributed joint admission control and dynamic resource allocation in stream processing networks 失效
公开(公告)号：US07889651B2
公开(公告)日：2011-02-15
申请号：US11758706
申请日：2007-06-06
申请人： Hanhua Feng , Zhen Liu , Honghui Xia , Li Zhang
发明人： Hanhua Feng , Zhen Liu , Honghui Xia , Li Zhang
IPC分类号： G01R31/08
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.

7. 发明授权

US07626917B2 Methods and apparatus for cost minimization of multi-tiered infrastructure with end-to-end delay guarantees 失效
标题翻译：使用端到端延迟保证的多层基础设施成本最小化的方法和设备
公开(公告)号：US07626917B2
公开(公告)日：2009-12-01
申请号：US10865064
申请日：2004-06-10
申请人： Wuqin Lin , Zhen Liu , Cathy Honghui Xia , Li Zhang
发明人： Wuqin Lin , Zhen Liu , Cathy Honghui Xia , Li Zhang
IPC分类号： H04J11/00 , G06F9/44 , G06F9/45
CPC分类号： G06F9/50 , G06F9/5061
摘要： Techniques are provided for determining a capacity allocation in a multi-tiered computing system. In one aspect of the invention, a technique for designing capacity allocation for a multi-tiered computing system, each tier of the computing system having one or more computing devices (e.g., servers), comprises the following steps/operations. Input parameters relating to capacity allocation are obtained. A capacity allocation is computed based on at least a portion of the input parameters, the capacity allocation being computable such that one or more end-to-end performance measures are substantially satisfied for multiple service classes. The capacity allocation computation may minimize a cost function. The capacity allocation computation may also satisfy one or more mean delay guarantees for the multiple service classes, one or more tail distribution guarantees for the multiple service classes, or both one or more mean delay guarantees and one or more tail distribution guarantees for the multiple service classes.
摘要翻译：提供了用于确定多层计算系统中的容量分配的技术。在本发明的一个方面，一种用于设计多层计算系统的容量分配的技术，具有一个或多个计算设备（例如，服务器）的计算系统的每个层包括以下步骤/操作。获得与容量分配有关的输入参数。基于输入参数的至少一部分来计算容量分配，所述容量分配是可计算的，使得对于多个服务类基本上满足一个或多个端到端性能测量。容量分配计算可以最小化成本函数。容量分配计算还可以满足多个服务类别的一个或多个平均延迟保证，多个服务类别的一个或多个尾部分配保证，或一个或多个平均延迟保证以及用于多个服务的一个或多个尾部分配保证课程

8. 发明申请

US20090268733A1 Methods and Apparatus for Content Delivery via Application Level Multicast with Minimum Communication Delay 失效
标题翻译：通过最小通信延迟的应用级组播进行内容传送的方法和装置
公开(公告)号：US20090268733A1
公开(公告)日：2009-10-29
申请号：US12502714
申请日：2009-07-14
申请人： Zhen Liu , Anton Riabov , Li Zhang
发明人： Zhen Liu , Anton Riabov , Li Zhang
IPC分类号： H04L12/56
CPC分类号： H04L45/48 , H04L12/1881 , H04L45/16
摘要： A method for constructing an overlay multicast tree to deliver data from a source to an identified group of nodes is provided in which a plurality of nodes are identified and mapped into multidimensional Euclidean space. A geometric region is constructing having a size that is the minimum size necessary to contain the source and all the nodes. Once constructed, a tree is created beginning at the source and including all of the nodes within the geometric region.
摘要翻译：提供了一种用于构建覆盖多播树以将数据从源传送到所识别的节点组的方法，其中多个节点被识别并映射到多维欧几里德空间中。一个几何区域正在构造，其大小是包含源和所有节点所需的最小大小。一旦构造，从源头创建树，并且包括几何区域内的所有节点。

9. 发明申请

US20080195447A1 SYSTEM AND METHOD FOR CAPACITY SIZING FOR COMPUTER SYSTEMS 审中-公开
标题翻译：用于计算机系统的容量大小的系统和方法
公开(公告)号：US20080195447A1
公开(公告)日：2008-08-14
申请号：US11673118
申请日：2007-02-09
申请人： Eric Bouillet , Zhen Liu , Dimitrios Pendarakis , Li Zhang
发明人： Eric Bouillet , Zhen Liu , Dimitrios Pendarakis , Li Zhang
IPC分类号： G05B19/418 , G06F9/46
CPC分类号： G06F9/5061 , G06Q10/0631 , G06Q10/06315 , G06Q30/0202
摘要： A system and method for capacity sizing in a computer device or system includes determining one or more classes of operations based on at least one of historical computational usage and predicted usage for a system. Based on the one or more classes of operations, at least one capacity target is set based on the computational usage for each class such that computational capacity is maintained at a set level over a given time period and the set level satisfies at least one usage criterion over the given time period.
摘要翻译：一种用于计算机设备或系统中的容量大小化的系统和方法包括基于系统的历史计算使用和预测使用中的至少一个来确定一个或多个类别的操作。基于一个或多个类别的操作，基于每个类的计算使用来设置至少一个容量目标，使得计算能力在给定时间段内保持在设定电平，并且所述设定电平满足至少一个使用准则在给定的时间段内。

10. 发明申请

US20080147307A1 METHOD AND APPARATUS FOR PREDICTING FUTURE TRAVEL TIMES OVER A TRANSPORTATION NETWORK 有权
标题翻译：用于预测运输网络未来旅行时间的方法和装置
公开(公告)号：US20080147307A1
公开(公告)日：2008-06-19
申请号：US12038559
申请日：2008-02-27
申请人： ZHEN LIU , Laura Wynter , Li Zhang
发明人： ZHEN LIU , Laura Wynter , Li Zhang
IPC分类号： G08G1/01
CPC分类号： G08G1/123
摘要： The present invention is a method and an apparatus for predicting future travel times over a transportation network. In one embodiment, a method for predicting future travel times over a transportation network includes receiving a data point indicating a real-time volume of traffic on the link at a given time and updating a template representative of an observed traffic pattern on the link in accordance with the received data point. A future travel time over the link can then be estimated in accordance with the updated template. Thus, the template is able to adapt to dynamically changing traffic patterns, taking these changing traffic patterns into account when making predictions of future traffic patterns.
摘要翻译：本发明是用于预测运输网络上的未来旅行时间的方法和装置。在一个实施例中，用于预测运输网络上的未来旅行时间的方法包括在给定时间接收指示链路上的实时流量的数据点，并且根据链路更新表示链路上观察到的业务模式的模板与收到的数据点。然后可以根据更新的模板来估计链接上的未来旅行时间。因此，模板能够适应动态变化的流量模式，在对未来流量模式进行预测时考虑到这些变化的流量模式。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式