-
公开(公告)号：US07835271B2
公开(公告)日：2010-11-16
申请号：US11321549
申请日：2005-12-29
申请人： Mansoor Ali Khan Alicherry , Peter Hessler , Viswanath Poosala , Walter Rothkegel , Sudipta Sengupta
发明人： Mansoor Ali Khan Alicherry , Peter Hessler , Viswanath Poosala , Walter Rothkegel , Sudipta Sengupta
IPC分类号： G01R31/08
CPC分类号： H04J14/0227 , H04J3/085 , H04J14/0284 , H04J14/0291 , H04J2203/006 , H04L12/437
摘要： Improved p-cycle restoration techniques using a signaling protocol are disclosed. For example, a technique for use in at least one node of a data communication network for recovering from a failure, wherein the data communication network includes multiple nodes and multiple links for connecting the multiple nodes, comprises the following steps/operations. Notification of the failure is obtained at the at least one node. A determination is made whether the failure is a single link failure or one of a node failure and a multiple link failure. A pre-configured protection cycle (p-cycle) plan is implemented when the failure is a single link failure but not when the failure is one of a node failure and a multiple link failure, such that two independent paths in the network are not connected when implementing the pre-configured protection cycle plan. Implementation of the pre-configured protection cycle plan may further comprise the node sending at least one message to another node in the data communication network and/or receiving at least one message from another node in the data communication network.
摘要翻译： 公开了使用信令协议的改进的p循环恢复技术。 例如，一种在数据通信网络的至少一个节点中用于从故障中恢复的技术，其中数据通信网络包括多个节点和用于连接多个节点的多个链路，包括以下步骤/操作。 在至少一个节点处获得故障的通知。 确定故障是单个链路故障还是节点故障和多个链路故障之一。 当故障是单个链路故障时，实施预配置的保护周期（p周期）计划，但是当故障是节点故障和多个链路故障之一时，则不实现，这样网络中的两个独立路径不连接 在实施预先配置的保护周期计划时。 预先配置的保护周期计划的实施还可以包括节点向数据通信网络中的另一节点发送至少一个消息和/或从数据通信网络中的另一个节点接收至少一个消息。
-
公开(公告)号：US20070153674A1
公开(公告)日：2007-07-05
申请号：US11321549
申请日：2005-12-29
IPC分类号： H04J1/16
CPC分类号： H04J14/0227 , H04J3/085 , H04J14/0284 , H04J14/0291 , H04J2203/006 , H04L12/437
摘要： Improved p-cycle restoration techniques using a signaling protocol are disclosed. For example, a technique for use in at least one node of a data communication network for recovering from a failure, wherein the data communication network includes multiple nodes and multiple links for connecting the multiple nodes, comprises the following steps/operations. Notification of the failure is obtained at the at least one node. A determination is made whether the failure is a single link failure or one of a node failure and a multiple link failure. A pre-configured protection cycle (p-cycle) plan is implemented when the failure is a single link failure but not when the failure is one of a node failure and a multiple link failure, such that two independent paths in the network are not connected when implementing the pre-configured protection cycle plan. Implementation of the pre-configured protection cycle plan may further comprise the node at least one of sending at least one message to another node in the data communication network and receiving at least one message from another node in the data communication network.
摘要翻译： 公开了使用信令协议的改进的p循环恢复技术。 例如，一种在数据通信网络的至少一个节点中用于从故障中恢复的技术，其中数据通信网络包括多个节点和用于连接多个节点的多个链路，包括以下步骤/操作。 在至少一个节点处获得故障的通知。 确定故障是单个链路故障还是节点故障和多个链路故障之一。 当故障是单个链路故障时，实施预配置的保护周期（p周期）计划，但是当故障是节点故障和多个链路故障之一时，则不实现，这样网络中的两个独立路径不连接 在实施预先配置的保护周期计划时。 预配置的保护周期计划的实现可以进一步包括至少一个消息发送到数据通信网络中的另一个节点并且从数据通信网络中的另一节点接收至少一个消息中的至少一个。
-
3.发明授权Methods of network routing having improved resistance to faults affecting groups of links subject to common risks 有权网络路由方法具有改善的对故障链路故障的抵抗，具有常见风险公开(公告)号：US07561534B2
公开(公告)日：2009-07-14
申请号：US10880887
申请日：2004-06-30
IPC分类号： H04L12/28
CPC分类号： H04L45/28 , H04L45/00 , H04L45/123 , H04L45/124 , H04L45/22
摘要： A number of techniques are described for routing methods that improve resistance to faults affecting groups of links subject to common risks. One of these techniques accounts for failure potentials in physical networks by considering shared risk link groups separately from performance and costs metrics in determining a primary routing path and a backup path. A shared risk link group (SRLG) is an attribute attached to a link to identify edges that have physical links in common and can therefore be simultaneously disrupted due to a single fault. Another technique considers node disjointness and provides a solution of two paths that are as node disjoint as possible and minimizes administrative costs. The techniques may further be combined in a priority order thereby providing a solution of at least two paths that are strictly SRLG disjoint, as node-disjoint as possible, and have minimum administrative costs. Due to the priority order of evaluation and typical network physical configurations of links, with the links associated common fault SRLGs, the priority ordering technique is very efficient in determining at least two paths for routing between a source and destination node.
摘要翻译： 描述了一些技术，用于路由方法，这些方法提高了对存在常见风险的链接组的故障的抵抗力。 这些技术之一通过在确定主要路由路径和备用路径时与性能和成本指标分开考虑共享风险链路组来解决物理网络中的故障潜能。 共享风险链接组（SRLG）是附加到链接的属性，用于识别具有共同物理链路的边缘，因此可能由于单个故障而同时中断。 另一种技术考虑到节点不相交，并提供了尽可能节点不相交的两条路径的解决方案，并将管理成本降至最低。 这些技术可以进一步以优先级顺序组合，从而提供严格SRLG不相交的至少两条路径的解决方案，作为节点不相交并且具有最小的管理成本。 由于评估的优先级顺序和链路的典型网络物理配置，链路与公共故障SRLGs相关联，所以优先级排序技术在确定用于在源节点和目的地节点之间路由的至少两个路径方面是非常有效的。
-
公开(公告)号：US07515543B2
公开(公告)日：2009-04-07
申请号：US11018282
申请日：2004-12-21
IPC分类号： H04J1/16
CPC分类号： H04J3/1617 , H04J2203/0083 , H04J2203/0094 , H04L47/10 , H04L47/125 , H04L47/283 , H04L47/34
摘要： A load-balanced network architecture is disclosed in which a traffic flow deliverable from a source node to a destination node via intermediate nodes is split into parts, and the parts are distributed to respective ones of the intermediate nodes. Path delay differences for the parts are substantially equalized by delay adjustment at one or more of the intermediate nodes, and packets of one or more of the parts are scheduled for routing from respective ones of the intermediate nodes to the destination node based on arrival times of the packets at the source node.
摘要翻译： 公开了一种负载平衡的网络架构，其中经由中间节点从源节点传递到目的地节点的业务流被分割成部分，并且将部分分配到相应的中间节点。 通过在一个或多个中间节点处的延迟调整基本上均衡部件的路径延迟差异，并且调度部分中的一个或多个的分组基于从中间节点中的相应节点到目的地节点的分组，基于到达时间 源节点上的数据包。
-
公开(公告)号：US20060133430A1
公开(公告)日：2006-06-22
申请号：US11018282
申请日：2004-12-21
CPC分类号： H04J3/1617 , H04J2203/0083 , H04J2203/0094 , H04L47/10 , H04L47/125 , H04L47/283 , H04L47/34
摘要： A load-balanced network architecture is disclosed in which a traffic flow deliverable from a source node to a destination node via intermediate nodes is split into parts, and the parts are distributed to respective ones of the intermediate nodes. Path delay differences for the parts are substantially equalized by delay adjustment at one or more of the intermediate nodes, and packets of one or more of the parts are scheduled for routing from respective ones of the intermediate nodes to the destination node based on arrival times of the packets at the source node.
-
公开(公告)号：US09298604B2
公开(公告)日：2016-03-29
申请号：US13919738
申请日：2013-06-17
申请人： Sudipta Sengupta , Biplob Kumar Debnath , Jin Li
发明人： Sudipta Sengupta , Biplob Kumar Debnath , Jin Li
CPC分类号： G06F12/0246 , G06F12/0866 , G06F12/0897 , G06F12/123 , G06F2212/222 , G11C7/1072
摘要： Described is using flash memory, RAM-based data structures and mechanisms to provide a flash store for caching data items (e.g., key-value pairs) in flash pages. A RAM-based index maps data items to flash pages, and a RAM-based write buffer maintains data items to be written to the flash store, e.g., when a full page can be written. A recycle mechanism makes used pages in the flash store available by destaging a data item to a hard disk or reinserting it into the write buffer, based on its access pattern. The flash store may be used in a data deduplication system, in which the data items comprise chunk-identifier, metadata pairs, in which each chunk-identifier corresponds to a hash of a chunk of data that indicates. The RAM and flash are accessed with the chunk-identifier (e.g., as a key) to determine whether a chunk is a new chunk or a duplicate.
-
公开(公告)号：US09053032B2
公开(公告)日：2015-06-09
申请号：US12979644
申请日：2010-12-28
CPC分类号： G06F12/0862 , G06F12/0866 , G06F17/30159
摘要： The subject disclosure is directed towards a data deduplication technology in which a hash index service's index maintains a hash index in a secondary storage device such as a hard drive, along with a compact index table and look-ahead cache in RAM that operate to reduce the I/O to access the secondary storage device during deduplication operations. Also described is a session cache for maintaining data during a deduplication session, and encoding of a read-only compact index table for efficiency.
-
公开(公告)号：US08935487B2
公开(公告)日：2015-01-13
申请号：US12979669
申请日：2010-12-28
CPC分类号： G06F12/0862 , G06F12/0866 , G06F12/0897 , G06F17/30097 , G06F17/30159 , G06F2212/1024 , G06F2212/463 , G06F2212/466
摘要： The subject disclosure is directed towards a data deduplication technology in which a hash index service's index maintains a hash index in a secondary storage device such as a hard drive, along with a compact index table and look-ahead cache in RAM that operate to reduce the I/O to access the secondary storage device during deduplication operations. Also described is a session cache for maintaining data during a deduplication session, and encoding of a read-only compact index table for efficiency.
摘要翻译： 主题公开涉及一种数据重复数据删除技术，其中散列索引服务的索引在诸如硬盘驱动器的辅助存储设备中维护散列索引，以及RAM中的紧凑索引表和预先高速缓存，其操作以减少 I / O在重复数据消除操作期间访问辅助存储设备。 还描述了用于在重复数据删除会话期间维护数据的会话高速缓存，以及用于效率的只读压缩索引表的编码。
-
9.发明申请公开(公告)号：US20130054544A1
公开(公告)日：2013-02-28
申请号：US13222198
申请日：2011-08-31
申请人： Jin Li , Sudipta Sengupta , Sanjeev Mehrotra , Ran Kalach , Paul Adrian Oltean
发明人： Jin Li , Sudipta Sengupta , Sanjeev Mehrotra , Ran Kalach , Paul Adrian Oltean
IPC分类号： G06F7/00
CPC分类号： G06F7/00 , G06F3/0608 , G06F3/0641 , G06F3/0674 , G06F11/1004 , G06F17/30159
摘要： The subject disclosure is directed towards partitioning a file into chunks that satisfy a chunk size restriction, such as maximum and minimum chunk sizes, using a sliding window. For file positions within the chunk size restriction, a signature representative of a window fingerprint is compared with a target pattern, with a chunk boundary candidate identified if matched. Other signatures and patterns are then checked to determine a highest ranking signature (corresponding to a lowest numbered Rule) to associate with that chunk boundary candidate, or set an actual boundary if the highest ranked signature is matched. If the maximum chunk size is reached without matching the highest ranked signature, the chunking mechanism regresses to set the boundary based on the candidate with the next highest ranked signature (if no candidates, the boundary is set at the maximum). Also described is setting chunk boundaries based upon pattern detection (e.g., runs of zeros).
摘要翻译： 本发明涉及使用滑动窗口将文件分成满足块大小限制的块，例如最大和最小块大小。 对于块大小限制内的文件位置，将窗口指纹的签名代表与目标模式进行比较，如果匹配则识别出块边界候选。 然后检查其他签名和模式以确定与该块块边界候选者相关联的最高排名签名（对应于最小编号的规则），或者如果最高排名签名匹配则设置实际边界。 如果没有匹配最高排名的签名达到最大块大小，则分块机制基于具有下一个最高排名的签名的候选者（如果没有候选，边界被设置为最大）而退化以设置边界。 还描述了基于模式检测（例如，零的运行）设置块边界。
-
公开(公告)号：US08073978B2
公开(公告)日：2011-12-06
申请号：US12490811
申请日：2009-06-24
申请人： Sudipta Sengupta , Jin Li , Vijay Vasudevan
发明人： Sudipta Sengupta , Jin Li , Vijay Vasudevan
CPC分类号： G06F17/30864
摘要： Techniques are described for sharing content among peers. Locality domains are treated as first order network units. Content is located at the level of a locality domain using a hierarchical DHT in which nodes correspond to locality domains. A peer searches for a given piece of content in a proximity guided manner and terminates at the earliest locality domain (in the hierarchy) which has the content. Locality domains are organized into hierarchical clusters based on their proximity.
摘要翻译： 描述了在对等体之间共享内容的技术。 地点域被视为一级网络单位。 内容位于使用层级DHT的位置级别的级别，其中节点对应于位置域。 对等体以邻近指导的方式搜索给定的内容，并且在具有内容的最早的位置域（在层次结构中）终止。 基于它们的邻近度，地域被组织成分级集群。
-
-
-
-
-
-
-
-
-
搜索结果
71 条记录 (耗时 0.035 秒)
