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

1. 发明申请

WO2006001820A1 METHODS AND APPARATUS FOR COST MINIMIZATION OF MULTI-TIERED INFRASTRUCTURE WITH END-TO-END DELAY GUARANTEES 审中-公开
标题翻译：使用终端延迟保证的多层次基础设施成本最小化的方法和装置
公开(公告)号：WO2006001820A1
公开(公告)日：2006-01-05
申请号：PCT/US2004/038890
申请日：2004-11-18
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , LIN, Wuqin , LIU, Zhen , XIA, Cathy, Honghui , ZHANG, Li
发明人： LIN, Wuqin , LIU, Zhen , XIA, Cathy, Honghui , ZHANG, Li
IPC分类号： G06F9/46
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.
摘要翻译：提供了用于确定多层计算系统中的容量分配的技术。在本发明的一个方面，一种用于设计多层计算系统的容量分配的技术，具有一个或多个计算设备（例如，服务器）的计算系统的每个层包括以下步骤/操作。获得与容量分配有关的输入参数。基于输入参数的至少一部分来计算容量分配，所述容量分配是可计算的，使得对于多个服务类基本上满足一个或多个端到端性能测量。容量分配计算可以最小化成本函数。容量分配计算还可以满足多个服务类别的一个或多个平均延迟保证，多个服务类别的一个或多个尾部分配保证，或者一个或多个平均延迟保证和用于多个服务的一个或多个尾部分配保证类。

2. 发明申请

WO2004059928A1 MAXIMUM LIFETIME ROUTING IN WIRELESS AD-HOC NETWORKS 审中-公开
标题翻译：无线AD-HOC网络中的最大生命周期路由
公开(公告)号：WO2004059928A1
公开(公告)日：2004-07-15
申请号：PCT/US2002/040810
申请日：2002-12-20
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , LIU, Zhen , SANKAR, Arvind
发明人： LIU, Zhen , SANKAR, Arvind
IPC分类号： H04L12/56
CPC分类号： H04W28/02 , H04L45/00 , H04L45/38 , H04W40/04 , H04W40/08 , H04W40/10 , H04W84/18 , Y02D70/122 , Y02D70/144 , Y02D70/22 , Y02D70/32 , Y02D70/324 , Y02D70/326
摘要： Routing techniques are provided that meet performance objectives associated with an ad-hoc network environment and the like. The techniques of invention serve to substantially maximize the lifetime of the network. In one aspect of the invention, a packet routing technique for use in a node of a distributed network comprises the following steps/operations. Queues for storing packets are maintained, wherein at least one queue is associated with a link existing between the node and a neighboring node, and a queue has a height associated therewith. A route is then determined for one or more packets stored in the queues based on heights of queues at neighboring nodes, such that energy constraints associated with the node and the neighboring nodes are substantially maximized. As mentioned, the distributed network is preferably a mobile ad-hoc network wherein the node and the at least one neighboring node communicate over a wireless link.
摘要翻译：提供了满足与自组织网络环境等相关的性能目标的路由技术。本发明的技术用于基本上最大化网络的寿命。在本发明的一个方面，在分布式网络的节点中使用的分组路由技术包括以下步骤/操作。维护用于存储分组的队列，其中至少一个队列与存在于节点和相邻节点之间的链路相关联，并且队列具有与其相关联的高度。然后基于相邻节点处的队列的高度来确定存储在队列中的一个或多个分组的路由，使得与节点和相邻节点相关联的能量约束被实质上最大化。如上所述，分布式网络优选地是移动自组织网络，其中节点和至少一个相邻节点通过无线链路进行通信。

3. 发明申请

WO2008014062A3 SYSTEM AND APPARATUS FOR OPTIMALLY TRADING OFF THE REPLICATION OVERHEAD AND CONSISTENCY LEVEL IN DISTRIBUTED APPLICATIONS 审中-公开
公开(公告)号：WO2008014062A3
公开(公告)日：2008-01-31
申请号：PCT/US2007/071403
申请日：2007-06-15
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , LIU, Zhen , YANG, Hoa , YE, Fan , XIA, Hongui
发明人： LIU, Zhen , YANG, Hoa , YE, Fan , XIA, Hongui
IPC分类号： G06F12/00 , G06F17/30
摘要： Methods and systems are provided for optimally trading off replication overhead and consistaicy levels in distributed data replication where nodes are organized in a hierarchy. The root node has the original data that need to be replicated at all other nodes, and the replicated copies have a freshness threshold that must be satisfied. The data are propagated through periodic updates in the hierarchy. Each node periodically sends data to its child nodes. Given the freshness threshold, an algorithm and its distributed protocol can determine the optimal update period for each link of the hierarchy such that the freshness threshold is satisfied for every node and the overall replication overhead is minimized.

4. 发明申请

WO2007149701A2 A METHOD AND SYSTEM FOR FEDERATED RESOURCE DISCOVERY SERVICE IN DISTRIBUTED SYSTEMS 审中-公开
标题翻译：分布式系统中联合资源发现服务的方法与系统
公开(公告)号：WO2007149701A2
公开(公告)日：2007-12-27
申请号：PCT/US2007/070544
申请日：2007-06-06
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , LIU, Zhen , YANG, Hao , YE, Fan
发明人： LIU, Zhen , YANG, Hao , YE, Fan
IPC分类号： G06F17/30
CPC分类号： G06F17/30545
摘要： Methods and systems are provided for identifying and allocating resources disposed within a plurality of distributed and autonomous computing systems, each of which may have its own legacy resource discovery service. Resource identification servers disposed within each one of the distributed computing systems communicate resource attribute data to a tree hierarchy of dedicated servers. The resource attribute data are maintained in native formats within the distributed computing systems and are mapped to a common format provided by the dedicated servers. The resource attribute data are aggregated at each node within the tree hierarchy, communicated up through the tree hierarchy to one or more root nodes and replicated down through all of the nodes. Additional system robustness is provided through period resource checks and resource attribute data updates. Resource allocation queries are submitted to any level node within the hierarchy and forwarded to the proper computing system for processing.
摘要翻译：提供了用于识别和分配布置在多个分布式和自主计算系统内的资源的方法和系统，每个计算系统可以具有其自己的传统资源发现服务。布置在分布式计算系统的每一个内的资源识别服务器将资源属性数据传送到专用服务器的树层。资源属性数据以分布式计算系统内的本机格式进行维护，并映射到由专用服务器提供的通用格式。资源属性数据在树层次结构中的每个节点进行聚合，通过树层次结构传递到一个或多个根节点，并通过所有节点进行复制。通过周期资源检查和资源属性数据更新来提供额外的系统稳健性。资源分配查询被提交到层次结构中的任何级节点，并转发到正确的计算系统进行处理。

5. 发明申请

WO2005109772A3 METHOD AND APPARATUS FOR GROUP COMMUNICATION WITH END-TO-END RELIABILITY 审中-公开
公开(公告)号：WO2005109772A3
公开(公告)日：2005-11-17
申请号：PCT/US2005/014870
申请日：2005-04-29
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , LIU, Zhen , BACCELLI, Francois , CHAINTREAU, Augustin , RIABOV, Anton
发明人： LIU, Zhen , BACCELLI, Francois , CHAINTREAU, Augustin , RIABOV, Anton
IPC分类号： H04L12/26
摘要： The present invention addresses scalability and end-to-end reliability in overlay multicast networks. A simple end-system multicast architecture (Fig. 3) that is both scalable in throughput and reliable in an end-to-end way is used. In this architecture, the transfers between nodes use TCP with backpressure mechanisms to provide data packet transfers between intermediate nodes (16) having finite-size forwarding buffers (22). There is also a finitesize backup buffer (24) in each node to store copies of packets which are copied out from the receiver window (20) to the forwarding buffers (22). These backup buffers (24) are used when TCP connections are re-established to supply copies of data packets for the children nodes (18) after their parent node fails, maintaining a complete sequence of data packets to all nodes within the multicast overlay network. The architecture provides end-to-end reliability, tolerates multiple simultaneous node failures and provides positive throughput for any group size and any buffer size.

6. 发明申请

WO2008119672A3 METHOD AND SYSTEM FOR RESILIENT PACKET TRACEBACK IN WIRELESS MESH AND SENSOR NETWORKS 审中-公开
公开(公告)号：WO2008119672A3
公开(公告)日：2008-10-09
申请号：PCT/EP2008/053325
申请日：2008-03-19
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , IBM UNITED KINGDOM LIMITED , LIU, Zhen , YANG, Hao , YE, Fan
发明人： LIU, Zhen , YANG, Hao , YE, Fan
IPC分类号： H04L29/06 , H04L12/22
摘要： 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.

7. 发明申请

WO2005055519A1 NODE CLUSTERING BASED ON USER INTERESTS, APPLICATION REQUIREMENTS AND NETWORK CHARACTERISTICS 审中-公开
标题翻译：基于用户兴趣的节点聚类，应用要求和网络特性
公开(公告)号：WO2005055519A1
公开(公告)日：2005-06-16
申请号：PCT/GB2004/004984
申请日：2004-11-25
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , IBM UNITED KINGDOM LIMITED , POPESCU, George , LIU, Zhen , SAHU, Sambit
发明人： POPESCU, George , LIU, Zhen , SAHU, Sambit
IPC分类号： H04L12/24
CPC分类号： H04L69/329 , H04L41/00
摘要： A method of clustering communication nodes based on network attributes such as network delays and forwarding capacity; on communication interest attributes; and on application attributes such as quality of service preferences/constraints (e.g. end-to-end delay constraints, bandwidth constraints) in providing communications between users and application servers. A multi-attribute communication feature vector is formed. That vector is comprised of network attributes (such as available bandwidth, client location attributes in the IP map), communication interests attributes (client request for content updates, client subscription to specific data items or to a set of proximal data sources in network space or application/virtual space) and quality of service requirements (such as delay and loss constraints is used to from efficient group communication mechanisms for distributed collaborative applications. Then the multi-attribute communication feature vectors are clustered. The clustering methods for multi-type attribute feature vectors are: iterative clustering using a generalized distance space with normalized attribute subspace metrics; fusion clustering, and nested clustering.
摘要翻译：基于网络延迟和转发能力等网络属性对通信节点进行聚类的方法; 沟通兴趣属性; 以及在提供用户和应用服务器之间的通信的诸如服务质量优先/约束（例如，端到端延迟约束，带宽约束）之类的应用属性上。形成多属性通信特征向量。该向量包括网络属性（例如可用带宽，IP映射中的客户端位置属性），通信兴趣属性（客户端请求内容更新，客户端订阅特定数据项或网络空间中的一组近端数据源，应用/虚拟空间）和服务质量要求（如延迟和丢失约束）用于分布式协作应用的高效群组通信机制，然后聚类多属性通信特征向量，多类型属性特征的聚类方法向量是：使用具有归一化属性子空间度量的广义距离空间的迭代聚类;融合聚类和嵌套聚类。

8. 发明申请

WO2009109591A1 METHOD AND SYSTEM FOR EFFICIENT COMMODITY DISTRIBUTION AND PRODUCTION 审中-公开
标题翻译：有效的商品分销和生产方法与系统
公开(公告)号：WO2009109591A1
公开(公告)日：2009-09-11
申请号：PCT/EP2009/052529
申请日：2009-03-04
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , PENDARAKIS, Dimitrios , AMBROSIO, Ronald , LIU, Zhen , YAO, Mark , HALIM, Nagui
发明人： PENDARAKIS, Dimitrios , AMBROSIO, Ronald , LIU, Zhen , YAO, Mark , HALIM, Nagui
IPC分类号： G06Q10/00 , G06Q30/00
CPC分类号： G06Q30/02 , G06Q10/06 , G06Q10/063 , Y02E40/76 , Y04S10/545 , Y04S50/00 , Y04S50/14
摘要： Techniques are disclosed for managing a commodity resource in a distributed network by aggregating marginal demand functions or marginal supply functions, depending on whether a node is a commodity consumer or a commodity producer, and determining an optimal allocation/production based on the aggregated function. By way of example, the commodity being managed may be an energy-based commodity such as electrical energy. In such case, the distributed commodity resource-based network may be a distributed electrical grid network.
摘要翻译：公开了用于通过根据节点是商品消费者还是商品生产者来聚合边际需求功能或边际供应功能来管理分布式网络中的商品资源的技术，以及基于聚合功能确定最佳分配/生产。作为例子，被管理的商品可以是诸如电能的基于能量的商品。在这种情况下，基于分布式商业资源的网络可以是分布式电网网络。

9. 发明申请

WO2006074832A1 ON-DEMAND GROUP COMMUNICATION SERVICES WITH QUALITY OF SERVICE (QOS) GUARANTEES 审中-公开
标题翻译：满足服务质量（QOS）保证的集团通讯服务
公开(公告)号：WO2006074832A1
公开(公告)日：2006-07-20
申请号：PCT/EP2005/055852
申请日：2005-11-09
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , IBM UNITED KINGDOM LIMITED , DUBE, Parijat , LIU, Zhen , SAHU, Sambit
发明人： DUBE, Parijat , LIU, Zhen , SAHU, Sambit
IPC分类号： H04L12/18
CPC分类号： H04L12/185 , H04L12/1854 , H04L12/66 , H04L41/0896 , H04L41/145 , H04L41/5009 , H04L41/5051 , H04L41/509
摘要： The present invention broadly contemplates addressing QoS concerns in overlay design to account for the last mile problem. In accordance with the present invention, a simple queuing network model for bandwidth usage in the last-mile bottlenecks is used to capture the effects of the asymmetry, the contention for bandwidth on the outgoing link, and to provide characterization of network throughput and latency. Using this characterization computationally inexpensive heuristics are preferably used for organizing end-systems into a multicast overlay which meets specified latency and packet loss bounds, given a specific packet arrival process.
摘要翻译：本发明广泛地考虑在覆盖设计中解决QoS问题以解决最后一英里问题。根据本发明，用于在最后一公里瓶颈中的带宽使用的简单排队网络模型用于捕获不对称性的影响，对出站链路的带宽争用，并提供网络吞吐量和延迟的表征。使用这种表征，计算上廉价的启发式算法优选地用于将终端系统组织成组播覆盖，其在给定特定分组到达过程时满足指定的延迟和分组丢失边界。

10. 发明申请

WO2005104176A3 METHOD AND APPARATUS FOR FAILURE RESILIENT FORWARDING OF DATA OVER A COMPUTER NETWORK 审中-公开
公开(公告)号：WO2005104176A3
公开(公告)日：2005-11-03
申请号：PCT/US2005/013716
申请日：2005-04-22
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , LIU, Zhen , SAHU, Sambit , SILBER, Jeremy I.
发明人： LIU, Zhen , SAHU, Sambit , SILBER, Jeremy I.
IPC分类号： G06F15/16 , G06F3/00
摘要： 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 (206), e.g., at the sending node, and allows, in turn, forwarding nodes (206) 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 (208, 209). Each receiver saves the marker prior to delivering data to an application (214), 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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式