公开(公告)号：US07729257B2

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

申请号：US11394372

申请日：2006-03-30

Applicant: Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman ,  Sudipta Sengupta

Inventor： Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman ,  Sudipta Sengupta

IPC: H04J1/16

CPC classification number: H04L45/00 ,  H04L43/0882 ,  H04L45/302 ,  H04W28/08 ,  H04W40/12 ,  Y02D70/22 ,  Y02D70/34

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

Abstract translation: 本发明包括一种用于在没有动态调度或路由的情况下生成用于处理无线网络中的业务变化的链路传输调度的方法和装置。 该方法包括根据路由算法确定与无线网络的相应无线链路相关联的固定业务容量，以及使用路由算法和固定业务容量生成链路传输调度，链路传输调度包括至少一个使用 每个网络链接。 链路传输调度适于在动态业务改变期间保持基本固定。 路由算法可以是两阶段路由算法，其中使用业务分流比将流量由无线网络中的每个节点分配给无线网络中的每个节点。 对于两相路由，可以使用入口和出口业务容量以及与无线网络中的相应节点相关联的业务分流比来确定固定业务容量。

公开(公告)号：US07515543B2

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

申请号：US11018282

申请日：2004-12-21

Applicant: Harsha S. Nagesh ,  Viswanath Poosala ,  Sudipta Sengupta ,  Peter J. Winzer

Inventor： Harsha S. Nagesh ,  Viswanath Poosala ,  Sudipta Sengupta ,  Peter J. Winzer

IPC: H04J1/16

CPC classification number: H04J3/1617 ,  H04J2203/0083 ,  H04J2203/0094 ,  H04L47/10 ,  H04L47/125 ,  H04L47/283 ,  H04L47/34

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

Abstract translation: 公开了一种负载平衡的网络架构，其中经由中间节点从源节点传递到目的地节点的业务流被分割成部分，并且将部分分配到相应的中间节点。 通过在一个或多个中间节点处的延迟调整基本上均衡部件的路径延迟差异，并且调度部分中的一个或多个的分组基于从中间节点中的相应节点到目的地节点的分组，基于到达时间 源节点上的数据包。

公开(公告)号：US20050259648A1

公开(公告)日：2005-11-24

申请号：US10851493

申请日：2004-05-21

Applicant: Muralidharan Kodialam ,  Tirunell Lakshman ,  Sudipta Sengupta

Inventor： Muralidharan Kodialam ,  Tirunell Lakshman ,  Sudipta Sengupta

IPC: H04L12/56 ,  H04L29/06

CPC classification number: H04L45/125 ,  H04L45/02 ,  H04L45/306 ,  H04L63/0227 ,  H04L63/1441

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

Abstract translation: 通过链路互连的节点网络具有在某些节点处指定的内容过滤，并且基于指定的内容过滤节点生成通过网络的分组连接的路由。 通过内容过滤节点放置方法和网络容量最大化方法来指定网络，以对网络承载的基本上所有业务（分组流）的分组应用内容过滤。

公开(公告)号：US08996683B2

公开(公告)日：2015-03-31

申请号：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/173 ,  G06F15/16 ,  H04L29/12 ,  H04L12/707 ,  H04L12/803

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

公开(公告)号：US08160063B2

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

申请号：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 ,  H04J1/16

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负载平衡。 它将负载平衡的功能分解为一组常规服务器，从而可以在数据中心的机架之间分配负载平衡服务器硬件，从而实现更高的灵活性和更少的分段。 该架构创建了一个巨大的，灵活的交换域，以低成本支持任何服务器/任何服务，全面的网格敏捷性和未注册的服务器容量。

公开(公告)号：US07957266B2

公开(公告)日：2011-06-07

申请号：US11106410

申请日：2005-04-14

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

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

IPC: H04L12/26

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

Abstract: A scheme for routing packets of traffic to their destination after ensuring that they pass through one or more pre-determined intermediate nodes, thereby permitting all permissible traffic patterns to be handled without knowledge of the traffic matrix, subject to edge-link capacity constraints. In one embodiment, a request for a path with a service demand for routing data between the ingress point and the egress point is received. A set of two or more intermediate nodes between the ingress point and the egress point is selected. Based on a bandwidth of the network, respective fractions of the data to send from the ingress point to each node of the set of intermediate nodes are determined. The data is routed in the determined respective fractions from the ingress point to each node of the set of intermediate nodes, and routed from each node of the set of intermediate nodes to the egress point.

Abstract translation: 一种用于在确保它们通过一个或多个预定中间节点之后将流量分组路由到其目的地的方案，从而允许所有允许的业务模式在不了解业务矩阵的情况下被处理，而不受边缘链路容量限制。 在一个实施例中，接收到对于在入口点和出口点之间路由数据的服务需求的路径的请求。 选择入口点和出口点之间的两个或多个中间节点的集合。 基于网络的带宽，确定从入口点向中间节点集合中的每个节点发送的数据的各个分数。 将数据以确定的各个分数从入口点路由到中间节点集合中的每个节点，并从中间节点集合的每个节点路由到出口点。

公开(公告)号：US07835271B2

公开(公告)日：2010-11-16

申请号：US11321549

申请日：2005-12-29

Applicant: Mansoor Ali Khan Alicherry ,  Peter Hessler ,  Viswanath Poosala ,  Walter Rothkegel ,  Sudipta Sengupta

Inventor： Mansoor Ali Khan Alicherry ,  Peter Hessler ,  Viswanath Poosala ,  Walter Rothkegel ,  Sudipta Sengupta

IPC: G01R31/08

CPC classification number: H04J14/0227 ,  H04J3/085 ,  H04J14/0284 ,  H04J14/0291 ,  H04J2203/006 ,  H04L12/437

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

Abstract translation: 公开了使用信令协议的改进的p循环恢复技术。 例如，一种在数据通信网络的至少一个节点中用于从故障中恢复的技术，其中数据通信网络包括多个节点和用于连接多个节点的多个链路，包括以下步骤/操作。 在至少一个节点处获得故障的通知。 确定故障是单个链路故障还是节点故障和多个链路故障之一。 当故障是单个链路故障时，实施预配置的保护周期（p周期）计划，但是当故障是节点故障和多个链路故障之一时，则不实现，这样网络中的两个独立路径不连接 在实施预先配置的保护周期计划时。 预先配置的保护周期计划的实施还可以包括节点向数据通信网络中的另一节点发送至少一个消息和/或从数据通信网络中的另一个节点接收至少一个消息。

公开(公告)号：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相关联，所以优先级排序技术在确定用于在源节点和目的地节点之间路由的至少两个路径方面是非常有效的。