公开(公告)号：US07738406B2

公开(公告)日：2010-06-15

申请号：US12247431

申请日：2008-10-08

Applicant: Shao Liu ,  Sudipta Sengupta ,  Mung Chiang ,  Jin Li ,  Philip Andrew Chou

Inventor： Shao Liu ,  Sudipta Sengupta ,  Mung Chiang ,  Jin Li ,  Philip Andrew Chou

IPC: H04L12/28

CPC classification number: H04L45/00 ,  H04L45/48

Abstract: Peer-to-peer communications sessions involve the transmission of one or more data streams from a source to a set of receivers that may redistribute portions of the data stream via a set of routing trees. Achieving a comparatively high, sustainable data rate throughput of the data stream(s) may be difficult due to the large number of available routing trees, as well as pertinent variations in the nature of the communications session (e.g., upload communications caps, network link caps, the presence or absence of helpers, and the full or partial interconnectedness of the network.) The selection of routing trees may be facilitated through the representation of the node set according to a linear programming model, such as a primal model or a linear programming dual model, and iterative processes for applying such models and identifying low-cost routing trees during an iteration.

Abstract translation: 对等通信会话涉及将一个或多个数据流从源传输到可以通过一组路由树重新分配数据流的部分的一组接收机。 由于大量的可用路由树以及通信会话性质的相关变化（例如，上传通信上限，网络链路），实现数据流的相对较高，可持续的数据速率吞吐量可能是困难的 帽子，帮助者的存在或不存在以及网络的全部或部分互连性）。可以通过根据线性规划模型（例如原始模型或线性的）的节点集合的表示来促进路由树的选择 编程双重模型，以及迭代过程，用于应用此类模型，并在迭代期间识别低成本路由树。

公开(公告)号：US20100085979A1

公开(公告)日：2010-04-08

申请号：US12247431

申请日：2008-10-08

Applicant: Shao Liu ,  Sudipta Sengupta ,  Mung Chiang ,  Jin Li ,  Philip Andrew Chou

Inventor： Shao Liu ,  Sudipta Sengupta ,  Mung Chiang ,  Jin Li ,  Philip Andrew Chou

IPC: H04L12/56

CPC classification number: H04L45/00 ,  H04L45/48

Abstract: Peer-to-peer communications sessions involve the transmission of one or more data streams from a source to a set of receivers that may redistribute portions of the data stream via a set of routing trees. Achieving a comparatively high, sustainable data rate throughput of the data stream(s) may be difficult due to the large number of available routing trees, as well as pertinent variations in the nature of the communications session (e.g., upload communications caps, network link caps, the presence or absence of helpers, and the full or partial interconnectedness of the network.) The selection of routing trees may be facilitated through the representation of the node set according to a linear programming model, such as a primal model or a linear programming dual model, and iterative processes for applying such models and identifying low-cost routing trees during an iteration.

Abstract translation: 对等通信会话涉及将一个或多个数据流从源传输到可以通过一组路由树重新分配数据流的部分的一组接收器。 由于大量的可用路由树以及通信会话性质的相关变化（例如，上传通信上限，网络链路），实现数据流的相对较高，可持续的数据速率吞吐量可能是困难的 帽子，帮助者的存在或不存在以及网络的全部或部分互连性）。可以通过根据线性规划模型（例如原始模型或线性的）的节点集合的表示来促进路由树的选择 编程双重模型，以及迭代过程，用于应用此类模型，并在迭代期间识别低成本路由树。

公开(公告)号：US20090307334A1

公开(公告)日：2009-12-10

申请号：US12410697

申请日：2009-03-25

Applicant: David A. Maltz ,  Albert G. Greenberg ,  Parveen K. Patel ,  Sudipta Sengupta ,  Parantap Lahiri

Inventor： David A. Maltz ,  Albert G. Greenberg ,  Parveen K. Patel ,  Sudipta Sengupta ,  Parantap Lahiri

IPC: G06F15/16

CPC classification number: H04L29/12056 ,  H04L29/12028 ,  H04L45/24 ,  H04L47/125 ,  H04L61/103 ,  H04L61/1505

Abstract: A method of networking a plurality of servers together within a data center is disclosed. The method includes the step of addressing a data packet for delivery to a destination server by providing the destination server address as a flat address. The method further includes the steps of obtaining routing information required to route the packet to the destination server. This routing information may be obtained from a directory service servicing the plurality of servers. Once the routing information is obtained, the data packet may be routed to the destination server according to the flat address of the destination server and routing information obtained from the directory service.

Abstract translation: 公开了一种在数据中心内组合多个服务器的方法。 该方法包括通过提供目的地服务器地址作为平坦地址来寻址用于传送到目的地服务器的数据分组的步骤。 该方法还包括步骤：获得将分组路由到目的地服务器所需的路由信息​​。 可以从服务于多个服务器的目录服务获得该路由信息。 一旦获得了路由信息，数据包可以根据目的地服务器的平面地址和从目录服务获得的路由信息​​被路由到目的地服务器。

公开(公告)号：US20090303880A1

公开(公告)日：2009-12-10

申请号：US12410745

申请日：2009-03-25

Applicant: David A. Maltz ,  Albert G. Greenberg ,  Parveen K. Patel ,  Sudipta Sengupta ,  Parantap Lahiri

Inventor： David A. Maltz ,  Albert G. Greenberg ,  Parveen K. Patel ,  Sudipta Sengupta ,  Parantap Lahiri

IPC: H04L12/56

CPC classification number: H04L45/24 ,  H04L45/02 ,  H04L45/28

Abstract: A system for commoditizing data center networking is disclosed. The system includes an interconnection topology for a data center having a plurality of servers and a plurality of nodes of a network in the data center through which data packets may be routed. The system uses a routing scheme where the routing is oblivious to the traffic pattern between nodes in the network, and wherein the interconnection topology contains a plurality of paths between one or more servers. The multipath routing may be Valiant load balancing. It disaggregates the function of load balancing into a group of regular servers, with the result that load balancing server hardware can be distributed amongst racks in the data center leading to greater agility and less fragmentation. The architecture creates a huge, flexible switching domain, supporting any server/any service, full mesh agility, and unregimented server capacity at low cost.

Abstract translation: 公开了一种用于商业化数据中心网络的系统。 该系统包括用于具有数据中心的多个服务器和多个节点的数据中心的互连拓扑，通过该数据中心可以路由数据分组。 系统使用路由方案，其中路由忽略网络中的节点之间的流量模式，并且其中互连拓扑在一个或多个服务器之间包含多个路径。 多路径路由可能是Valiant负载平衡。 它将负载平衡的功能分解为一组常规服务器，结果是可以在数据中心的机架中分配负载平衡服务器硬件，从而实现更高的灵活性和更少的分段。 该架构创建了一个巨大的，灵活的交换领域，以低成本支持任何服务器/任何服务，全面的网格敏捷性和未注册的服务器容量。

公开(公告)号：US07561534B2

公开(公告)日：2009-07-14

申请号：US10880887

申请日：2004-06-30

Applicant: Mansoor Ali Khan Alicherry ,  Iraj Saniee ,  Sudipta Sengupta

Inventor： Mansoor Ali Khan Alicherry ,  Iraj Saniee ,  Sudipta Sengupta

IPC: H04L12/28

CPC classification number: H04L45/28 ,  H04L45/00 ,  H04L45/123 ,  H04L45/124 ,  H04L45/22

Abstract: 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.

Abstract translation: 描述了一些技术，用于路由方法，这些方法提高了对存在常见风险的链接组的故障的抵抗力。 这些技术之一通过在确定主要路由路径和备用路径时与性能和成本指标分开考虑共享风险链路组来解决物理网络中的故障潜能。 共享风险链接组（SRLG）是附加到链接的属性，用于识别具有共同物理链路的边缘，因此可能由于单个故障而同时中断。 另一种技术考虑到节点不相交，并提供了尽可能节点不相交的两条路径的解决方案，并将管理成本降至最低。 这些技术可以进一步以优先级顺序组合，从而提供严格SRLG不相交的至少两条路径的解决方案，作为节点不相交并且具有最小的管理成本。 由于评估的优先级顺序和链路的典型网络物理配置，链路与公共故障SRLGs相关联，所以优先级排序技术在确定用于在源节点和目的地节点之间路由的至少两个路径方面是非常有效的。

公开(公告)号：US20050265255A1

公开(公告)日：2005-12-01

申请号：US11141257

申请日：2005-05-31

Applicant: Muralidharan Kodialam ,  Tirunell Lakshman ,  Sudipta Sengupta

Inventor： Muralidharan Kodialam ,  Tirunell Lakshman ,  Sudipta Sengupta

IPC: H04L12/56 ,  H04L12/28 ,  H04L12/26

CPC classification number: H04L45/12 ,  H04L45/04 ,  H04L45/24 ,  H04L47/125

Abstract: A method for supporting recovery from failure of a node in a network of nodes interconnected by links, wherein the failed node is in a path providing a service level between an ingress point and an egress point of the network, comprises: (a) selecting a set of one or more intermediate nodes between the ingress point and the egress point, the set excluding the failed node; (b) determining, based on available bandwidth of the network, a non-zero fraction of the service level to route from the ingress point to each intermediate node; (c) implementing, during a first routing phase, a first routing method to determine one or more paths from the ingress point to each intermediate node for routing the corresponding fraction of the service level; and (d) implementing, during a second routing phase, a second routing method to determine one or more paths from each intermediate node to the egress point for routing the corresponding fraction of the service level.

Abstract translation: 一种用于支持通过链路互连的节点网络中的节点的故障恢复的方法，其中所述故障节点处于提供所述网络的入口点和出口点之间的服务水平的路径中，包括：（a）选择 在入口点和出口点之间的一个或多个中间节点的集合，不包括故障节点的集合; （b）基于网络的可用带宽确定从入口点到每个中间节点路由的服务级别的非零分数; （c）在第一路由阶段期间实施第一路由方法，以确定从入口点到每个中间节点的一条或多条路径，用于路由服务级别的相应部分; 以及（d）在第二路由阶段期间实施第二路由方法，以确定从每个中间节点到出口点的一条或多条路径，用于路由服务级别的相应部分。

公开(公告)号：US06778531B1

公开(公告)日：2004-08-17

申请号：US09677009

申请日：2000-09-29

Applicant: Muralidharan S. Kodialam ,  Tirnuell V. Lakshman ,  Sudipta Sengupta

Inventor： Muralidharan S. Kodialam ,  Tirnuell V. Lakshman ,  Sudipta Sengupta

IPC: H04L1228

CPC classification number: H04L45/302 ,  H04L12/18 ,  H04L45/00 ,  H04L45/125 ,  H04L45/16 ,  H04L45/50

Abstract: A packet network of interconnected nodes employs a method of routing with service-level guarantees to determine a path through the network for a requested multicast, label-switched path Each of the nodes includes one or more routers that forward packets based on a forwarding table constructed from a directed tree determined in accordance with the method of multicast routing with service-level guarantees. For a first implementation, a heuristic algorithm uses a scaling phase that iteratively adjusts a maximum arc capacity, determines the resulting tree for the iteration, and selects the tree as the routing tree that provides the “maximum” flow. For a second implementation, the heuristic algorithm computes maximum multicast flows and determines links in the network that are “critical” to satisfy future multicast routing requests. A multicast routing tree is selected such that provisioning the flows over its links “minimally interferes” with capacity of paths needed for future demands.

Abstract translation: 互连节点的分组网络采用路由服务级别保证的方法来确定针对所请求的多播的路由，标签交换路径每个节点包括一个或多个基于构造的转发表转发分组的路由器 从根据具有服务级别保证的多播路由方法确定的有向树。 对于第一个实现，启发式算法使用迭代地调整最大电弧容量的缩放阶段，确定迭代的结果树，并选择该树作为提供“最大”流的路由树。 对于第二个实现，启发式算法计算最大组播流，并确定网络中“关键”的链路以满足未来的组播路由请求。 选择组播路由树，使得通过其链路的流量以最小限度地干扰未来需求所需路径的容量。

公开(公告)号：US09639543B2

公开(公告)日：2017-05-02

申请号：US12979681

申请日：2010-12-28

Applicant: Jin Li ,  Sudipta Sengupta

Inventor： Jin Li ,  Sudipta Sengupta

IPC: G06F17/30

CPC classification number: G06F17/30097 ,  G06F17/3007 ,  G06F17/30159

Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index and/or indexing operations are adaptable to balance deduplication performance savings, throughput and resource consumption. The indexing service may employ hierarchical chunking using different levels of granularity corresponding to chunk size, a sampled compact index table that contains compact signatures for less than all of the hash index's (or subspace's) hash values, and/or selective subspace indexing based on similarity of a subspace's data to another subspace's data and/or to incoming data chunks.

公开(公告)号：US08260952B2

公开(公告)日：2012-09-04

申请号：US12023286

申请日：2008-01-31

Applicant: Sudipta Sengupta ,  Minghua Chen ,  Jin Li ,  Philip A. Chou ,  Miroslav Ponec

Inventor： Sudipta Sengupta ,  Minghua Chen ,  Jin Li ,  Philip A. Chou ,  Miroslav Ponec

IPC: G06F15/16

CPC classification number: H04L67/104 ,  H04L65/604 ,  H04L65/607 ,  H04L67/06 ,  H04L67/1095 ,  H04L67/125 ,  H04N21/632 ,  H04N21/64792

Abstract: The described implementations relate to distributed network management and more particularly to enhancing distributed network utility. One technique selects multiple trees to distribute content to multiple receivers in a session where individual receivers can receive the distributed content at one of a plurality of rates. The technique further adjustably allocates content distribution across the multiple trees to increase a sum of utilities of the multiple receivers.

Abstract translation: 所描述的实现涉及分布式网络管理，更具体地涉及增强分布式网络实用性。 一种技术选择多个树以在单个接收机可以以多个速率中的一个速率接收分布式内容的会话中向多个接收机分发内容。 该技术进一步可调整地分配多个树上的内容分配以增加多个接收器的效用之和。

公开(公告)号：US20120166448A1

公开(公告)日：2012-06-28

申请号：US12979681

申请日：2010-12-28

Applicant: Jin Li ,  Sudipta Sengupta

Inventor： Jin Li ,  Sudipta Sengupta

IPC: G06F17/30

CPC classification number: G06F17/30097 ,  G06F17/3007 ,  G06F17/30159

Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index and/or indexing operations are adaptable to balance deduplication performance savings, throughput and resource consumption. The indexing service may employ hierarchical chunking using different levels of granularity corresponding to chunk size, a sampled compact index table that contains compact signatures for less than all of the hash index's (or subspace's) hash values, and/or selective subspace indexing based on similarity of a subspace's data to another subspace's data and/or to incoming data chunks.

Abstract translation: 主题公开涉及重复数据删除技术，其中散列索引服务的索引和/或索引操作适于平衡重复数据删除性能节省，吞吐量和资源消耗。 索引服务可以使用与块大小相对应的不同级别的粒度的分级分块，包含小于所有哈希索引（或子空间）散列值的紧凑签名的采样压缩索引表和/或基于相似性的选择性子空间索引 子空间的数据到另一个子空间的数据和/或输入的数据块。