-
公开(公告)号：US20100195488A1
公开(公告)日：2010-08-05
申请号：US12364520
申请日：2009-02-03
申请人： Sanjeev Mehrotra , Ying-zong Huang , Jin Li , Sayandeep Sen , Manish Jain , Sudipta Sengupta
发明人： Sanjeev Mehrotra , Ying-zong Huang , Jin Li , Sayandeep Sen , Manish Jain , Sudipta Sengupta
CPC分类号： H04L47/10 , H04J3/0682 , H04L1/0002 , H04L1/0009 , H04L1/0015 , H04L1/1867 , H04L47/115 , H04L47/193 , H04L47/25 , H04L47/283 , H04L47/37 , Y02D50/10
摘要： Transmission delays are minimized when packets are transmitted from a source computer over a network to a destination computer. The source computer measures the network's available bandwidth, forms a sequence of output packets from a sequence of data packets, and transmits the output packets over the network to the destination computer, where the transmission rate is ramped up to the measured bandwidth. In conjunction with the transmission, the source computer monitors a transmission delay indicator which it computes using acknowledgement packets it receives from the destination computer. Whenever the indicator specifies that the transmission delay is increasing, the source computer reduces the transmission rate until the indicator specifies that the delay is unchanged. The source computer dynamically decides whether each output packet will be a forward error correction packet or a single data packet, where the decision is based on minimizing the expected transmission delays.
摘要翻译： 当数据包通过网络从源计算机传输到目标计算机时，传输延迟最小化。 源计算机测量网络的可用带宽，形成来自一系列数据分组的输出分组序列，并通过网络将输出分组发送到目标计算机，其中传输速率升高到测量带宽。 结合传输，源计算机监视传输延迟指示符，其使用从目的地计算机接收的确认分组来计算它。 每当指示符指示传输延迟增加时，源计算机降低传输速率，直到指示符指定延迟不变。 源计算机动态地确定每个输出分组是否将是前向纠错分组或单个数据分组，其中决定基于最小化期望的传输延迟。
-
公开(公告)号：US20100036903A1
公开(公告)日：2010-02-11
申请号：US12189438
申请日：2008-08-11
申请人： Najam Ahmad , Albert Gordon Greenberg , Parantap Lahiri , Dave Maltz , Parveen K. Patel , Sudipta Sengupta , Kushagra V. Vaid
发明人： Najam Ahmad , Albert Gordon Greenberg , Parantap Lahiri , Dave Maltz , Parveen K. Patel , Sudipta Sengupta , Kushagra V. Vaid
IPC分类号： G06F15/16
CPC分类号： G06F9/505 , H04L67/1002
摘要： Systems and methods that distribute load balancing functionalities in a data center. A network of demultiplexers and load balancer servers enable a calculated scaling and growth operation, wherein capacity of load balancing operation can be adjusted by changing the number of load balancer servers. Accordingly, load balancing functionality/design can be disaggregated to increase resilience and flexibility for both the load balancing and switching mechanisms of the data center.
摘要翻译： 在数据中心中分配负载均衡功能的系统和方法。 多路分解器和负载平衡器服务器的网络实现计算的缩放和增长操作，其中可以通过改变负载平衡器服务器的数量来调整负载平衡操作的容量。 因此，负载平衡功能/设计可以分解，以增加数据中心的负载平衡和切换机制的弹性和灵活性。
-
公开(公告)号：US20090180431A1
公开(公告)日：2009-07-16
申请号：US12014760
申请日：2008-01-15
申请人： Sudipta Sengupta , Minghua Chen , Ranveer Chandra
发明人： Sudipta Sengupta , Minghua Chen , Ranveer Chandra
CPC分类号： H04W72/0486 , H04W16/14 , H04W72/0446 , H04W72/0453 , H04W72/085
摘要： A technique for resource allocation in a wireless network (for example, an access point type wireless network), which supports concurrent communication on a band of channels, is provided. The technique includes accepting connectivity information for the network that supports concurrent communication on the band of channels. A conflict graph is generated from the connectivity information. The generated conflict graph models concurrent communication on the band of channels. A linear programming approach, which incorporates information form the conflict graph and rate requirements for nodes of the network, can be utilized to maximize throughput of the network.
摘要翻译： 提供了一种支持在频带上并发通信的无线网络（例如，接入点型无线网络）中的资源分配技术。 该技术包括接收支持在频带上并发通信的网络的连接信息。 从连接信息生成冲突图。 生成的冲突图形模拟了频道上的并发通信。 可以利用线性规划方法，其中包含形成网络节点的冲突图和速率要求的信息，以最大化网络的吞吐量。
-
公开(公告)号：US07558209B2
公开(公告)日：2009-07-07
申请号：US11414147
申请日：2006-04-28
摘要： A computer-implemented method of computing throughput of a data-routing scheme for a network of nodes interconnected by links and having at least one ingress point and at least one egress point. The method includes: deriving a polynomial-size linear program from a combination of a first linear program and a second linear program and solving the polynomial-size linear program. The first linear program has infinite constraints and minimizes maximum-link utilization of a link in a path between the ingress point and the egress point. The second linear program determines whether any constraint of the first linear program is violated.
摘要翻译： 一种计算机实现的方法，用于计算通过链路互连并具有至少一个入口点和至少一个出口点的节点网络的数据路由方案的吞吐量。 该方法包括：从第一线性程序和第二线性程序的组合中导出多项式大小的线性程序并求解多项式大小的线性程序。 第一个线性程序具有无穷大的约束，并且使进入点和出口点之间的路径中的链路的最大链路利用率最小化。 第二线性程序确定是否违反了第一线性程序的任何约束。
-
公开(公告)号：US07394763B2
公开(公告)日：2008-07-01
申请号：US10851493
申请日：2004-05-21
CPC分类号： H04L45/125 , H04L45/02 , H04L45/306 , H04L63/0227 , H04L63/1441
摘要： A network of nodes interconnected by links has content filtering specified at certain nodes, and routing of packet connections through the network is generated based on the specified content-filtering nodes. The network is specified via a content-filtering node placement method and a network-capacity maximization method so as to apply content filtering to packets for substantially all traffic (packet streams) carried by the network.
摘要翻译： 通过链路互连的节点网络具有在某些节点处指定的内容过滤，并且基于指定的内容过滤节点生成通过网络的分组连接的路由。 通过内容过滤节点放置方法和网络容量最大化方法来指定网络，以对网络承载的基本上所有业务（分组流）的分组应用内容过滤。
-
56.发明申请Method and apparatus for link transmission scheduling for handling traffic variation in wireless mesh networks 有权用于处理无线网状网络中的业务变化的链路传输调度的方法和装置公开(公告)号：US20070237081A1
公开(公告)日：2007-10-11
申请号：US11394372
申请日：2006-03-30
CPC分类号： H04L45/00 , H04L43/0882 , H04L45/302 , H04W28/08 , H04W40/12 , Y02D70/22 , Y02D70/34
摘要： The invention includes a method and apparatus for generating a link transmission schedule for handling traffic variation in wireless networks without dynamic scheduling or routing. The method includes determining fixed traffic capacities associated with respective wireless links of a wireless network according to a routing algorithm, and generating, using the routing algorithm and the fixed traffic capacities, a link transmission schedule including at least one condition by which traffic is transmitted using each of the network links. The link transmission schedule is adapted to remain substantially fixed during dynamic traffic changes. The routing algorithm may be a two-phase routing algorithm in which traffic is distributed by each node in the wireless network to every node in the wireless network using traffic split ratios. For two-phase routing, fixed traffic capacities may be determined using ingress and egress traffic capacities and traffic split ratios associated with respective nodes in the wireless network.
摘要翻译： 本发明包括一种用于在没有动态调度或路由的情况下生成用于处理无线网络中的业务变化的链路传输调度的方法和装置。 该方法包括根据路由算法确定与无线网络的相应无线链路相关联的固定业务容量，以及使用路由算法和固定业务容量生成链路传输调度，链路传输调度包括至少一个使用 每个网络链接。 链路传输调度适于在动态业务改变期间保持基本固定。 路由算法可以是两阶段路由算法，其中使用业务分流比将流量由无线网络中的每个节点分配给无线网络中的每个节点。 对于两相路由，可以使用入口和出口业务容量以及与无线网络中的相应节点相关联的业务分流比来确定固定业务容量。
-
57.发明申请Efficient and robust routing of potentially-variable traffic with local restoration agains link failures 有权具有本地恢复的潜在可变流量的高效且可靠的路由再次发生链路故障公开(公告)号：US20050271060A1
公开(公告)日：2005-12-08
申请号：US11141372
申请日：2005-05-31
CPC分类号： H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
摘要： A method for supporting recovery from failure of a link in a network of nodes interconnected by links comprises: (a) selecting an intermediate node between an ingress point and an egress point of the network, wherein the intermediate node minimizes the sum of (i) a capacity constraint between the ingress point and the intermediate node and (ii) a capacity constraint between the intermediate node and the egress point; wherein the selection identifies a first path structure between the ingress point and the intermediate node, and a second path structure between the intermediate node and the egress point, each path structure comprising a primary path and one or more link backup detours protecting each link on the primary path; (b) implementing, during a first routing phase, a first routing method for routing a fraction of a service level between the ingress point and the intermediate node along the primary path of the first path structure; and (c) implementing, during a second routing phase, a second routing method for routing a fraction of the service level between the intermediate node and the egress point along the primary path of the second path structure.
摘要翻译： 一种用于支持通过链路互连的节点网络中的链路故障恢复的方法包括：（a）在所述网络的入口点和出口点之间选择中间节点，其中所述中间节点将（i） 入口点和中间节点之间的容量约束和（ii）中间节点与出口点之间的容量约束; 其中所述选择识别所述入口点和所述中间节点之间的第一路径结构以及所述中间节点和所述出口点之间的第二路径结构，每个路径结构包括主路径和一个或多个链路备用绕路，以保护所述中间节点和所述出口点之间的每个链路 主路径 （b）在第一路由阶段期间，实施第一路由选择方法，用于沿着所述第一路径结构的所述主路径在所述入口点和所述中间节点之间路由服务级别的一部分; 以及（c）在第二路由阶段期间实施用于沿着所述第二路径结构的所述主路径路由所述中间节点和所述出口点之间的服务级别的一部分的第二路由方法。
-
58.发明申请Efficient and robust routing of potentially-variable traffic for path restoration following link failure 有权链路故障后路径恢复的潜在可变流量的高效鲁棒路由公开(公告)号：US20050270972A1
公开(公告)日：2005-12-08
申请号：US11141705
申请日：2005-05-31
IPC分类号： H04L12/56
CPC分类号： H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
摘要： A method for supporting recovery from failure of a path in a network of nodes interconnected by links comprises: (a) selecting an intermediate node between an ingress point and an egress point of the network, wherein the intermediate node minimizes the sum of (i) a capacity constraint between the ingress point and the intermediate node and (ii) a capacity constraint between the intermediate node and the egress point; wherein the selection identifies a first link-disjoint path set between the ingress point and the intermediate node, and a second link-disjoint path set between the intermediate node and the egress point, each link-disjoint path set comprising a backup path and at least one primary path; (b) implementing, during a first routing phase, a first routing method for routing a fraction of a service level between the ingress point and the intermediate node along each of the one or more primary paths of the first link-disjoint path set; and (c) implementing, during a second routing phase, a second routing method for routing a fraction of the service level between the intermediate node and the egress point along each of the one or more primary paths of the second link-disjoint path set.
摘要翻译： 一种用于支持通过链路互连的节点网络中的路径故障恢复的方法包括：（a）在所述网络的入口点和出口点之间选择中间节点，其中所述中间节点将（i） 入口点和中间节点之间的容量约束和（ii）中间节点与出口点之间的容量约束; 其中所述选择识别在所述入口点和所述中间节点之间设置的第一链接 - 不相交路径，以及在所述中间节点和所述出口点之间设置的第二链路 - 不相交路径，每个链路 - 不相交路径集合包括备用路径并且至少 一条主路 （b）在第一路由阶段期间实施第一路由方法，用于沿着所述第一链路 - 不相交路径集合的所述一个或多个主路径中的每一个路由在所述入口点和所述中间节点之间的服务级别的一部分; 以及（c）在第二路由阶段期间实施第二路由选择方法，用于沿着所述第二链路 - 不相交路径集合的所述一个或多个主路径中的每一个路由在所述中间节点和所述出口点之间的所述服务级别的一部分。
-
公开(公告)号：US09110936B2
公开(公告)日：2015-08-18
申请号：US12979748
申请日：2010-12-28
申请人： Jin Li , Sudipta Sengupta , Ran Kalach , Ronakkumar N. Desai , Paul Adrian Oltean , James Robert Benton
发明人： Jin Li , Sudipta Sengupta , Ran Kalach , Ronakkumar N. Desai , Paul Adrian Oltean , James Robert Benton
IPC分类号： G06F17/30
CPC分类号： G06F17/30371 , G06F17/30156 , G06F17/30303 , G06F17/30327 , G06F17/3033 , G06F17/30489
摘要： The subject disclosure is directed towards a data deduplication technology in which a hash index service's index is partitioned into subspace indexes, with less than the entire hash index service's index cached to save memory. The subspace index is accessed to determine whether a data chunk already exists or needs to be indexed and stored. The index may be divided into subspaces based on criteria associated with the data to index, such as file type, data type, time of last usage, and so on. Also described is subspace reconciliation, in which duplicate entries in subspaces are detected so as to remove entries and chunks from the deduplication system. Subspace reconciliation may be performed at off-peak time, when more system resources are available, and may be interrupted if resources are needed. Subspaces to reconcile may be based on similarity, including via similarity of signatures that each compactly represents the subspace's hashes.
摘要翻译： 本发明涉及一种数据重复数据删除技术，其中散列索引服务的索引被分割成子空间索引，其中小于整个散列索引服务的索引来缓存存储器。 访问子空间索引以确定数据块是否已经存在或需要进行索引和存储。 索引可以根据与索引的数据相关联的标准被划分为子空间，例如文件类型，数据类型，上次使用的时间等等。 还描述了子空间协调，其中检测子空间中的重复条目，以便从重复数据删除系统中删除条目和块。 当更多的系统资源可用时，子空间协调可以在非高峰时间执行，并且如果需要资源，则可能被中断。 调和的子空间可以基于相似性，包括通过每个紧密地表示子空间的散列的签名的相似性。
-
公开(公告)号：US20130282964A1
公开(公告)日：2013-10-24
申请号：US13919727
申请日：2013-06-17
申请人： Sudipta Sengupta , Biplob Kumar Debnath , Jin Li
发明人： Sudipta Sengupta , Biplob Kumar Debnath , Jin Li
IPC分类号： G06F12/02
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.
-
-
-
-
-
-
-
-
-
搜索结果
71 条记录 (耗时 0.033 秒)
