公开(公告)号：US09363584B1

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

申请号：US14217950

申请日：2014-03-18

Applicant: GOOGLE INC.

Inventor： Abdul Kabbani

IPC: H04J14/00 ,  H04Q11/00 ,  H04L12/24 ,  H04B10/27

CPC classification number: H04Q11/0062 ,  H04B10/27 ,  H04L41/0813 ,  H04L41/0823 ,  H04L41/12 ,  H04Q11/0071 ,  H04Q2011/0086

Abstract: A non-transitory computer-readable storage medium may include instructions stored thereon that. When executed by at least one processor, the instructions may be configured to cause a computing system to at least determine which links connecting old super blocks to old spine blocks via a plurality of Optical Circuit Switches (OCSs) in a network to disconnect to accommodate at least one new super block and at least one new spine block being added to a switching network, the determining including determining a maximum of m links per OCS to disconnect, connect the old super blocks to the at least one new spine block via the OCSs associated with the links to be disconnected, and connect the at least one new super block to the old spine blocks via the OCSs associated with the links to be disconnected.

Abstract translation: 非暂时的计算机可读存储介质可以包括存储在其上的指令。 当由至少一个处理器执行时，所述指令可以被配置为使得计算系统至少确定经由网络中的多个光学电路交换机（OCS）将旧的超级块与旧的脊柱连接的链接以断开以适应 至少一个新的超级块和至少一个新的脊柱块被添加到交换网络中，所述确定包括确定每个OCS的m个链路的最大值以断开连接，经由相关联的OCS将旧的超级块连接到所述至少一个新的脊柱块 其中链路将被断开，并且通过与要断开的链路相关联的OCS将至少一个新的超级块连接到旧的脊柱块。

公开(公告)号：US09313147B1

公开(公告)日：2016-04-12

申请号：US14164666

申请日：2014-01-27

Applicant: GOOGLE INC.

Inventor： Abdul Kabbani

IPC: H04L12/933 ,  H04L12/24 ,  H04Q11/00

CPC classification number: H04L49/15 ,  H04L41/0816 ,  H04L41/0836 ,  H04L41/12 ,  H04Q11/0005 ,  H04Q11/0062 ,  H04Q2011/0064

Abstract: A non-transitory computer-readable storage medium may include instructions stored thereon that, when executed by at least one processor, are configured to cause a computing system to at least cut a surplus link at a first switch between an old super block and an old spine block, add a first new link between the old super block and a new spine block, add a second new link between the old spine block and a new super block, continue to cut surplus links and add new links until determining that adding a new link at the first switch would result in an excess of links, and swap a link from the first switch with a link from a second switch.

Abstract translation: 非暂时性计算机可读存储介质可以包括存储在其上的指令，当由至少一个处理器执行时，其被配置为使得计算系统至少在旧的超级块和旧的超级块之间的第一切换中剪切剩余链路 在旧的超级块和新的脊柱块之间添加第一个新链接，在旧的脊柱块和新的超级块之间添加第二个新的链接，继续剪切剩余的链接并添加新的链接，直到确定添加新的 在第一交换机处的链路将导致链路过多，并且用第二交换机的链路从第一交换机交换链路。

公开(公告)号：US10097474B1

公开(公告)日：2018-10-09

申请号：US13886069

申请日：2013-05-02

Applicant: Google Inc.

Inventor： Abdul Kabbani ,  Amin Vahdat

IPC: G06F15/16 ,  H04L12/891

Abstract: A system includes a plurality of rate limiters and a rate limiter management module. The rate limiter management module causes a processor to analyze and compare a plurality of flows each having at least one aggregation attribute, to aggregate a first group of the plurality of flows into a first aggregate flow based on the at least one aggregation attribute, and to assign the first aggregate flow to a rate limiter having at least one membership criterion. The first aggregate flow includes flows having the at least one aggregation attribute that satisfies the at least one membership criterion.

公开(公告)号：US09473408B1

公开(公告)日：2016-10-18

申请号：US14154452

申请日：2014-01-14

Applicant: GOOGLE INC.

Inventor： Abdul Kabbani ,  Arjun Singh

IPC: H04L12/803

CPC classification number: H04L47/122

Abstract: A technique includes transmitting traffic to a destination via at least a first path of a plurality of paths to the destination, each path including one or more path segments, a plurality of ports being associated with each path segment, receiving port congestion information for each of the ports, determining whether each of the plurality of path segments is congested based on the port congestion information, making a first determination that the first path is congested and that one or more second paths are not congested, each of the paths is determined to be congested if one or more path segments of the path is congested, and re-routing at least some traffic directed to the destination from the congested first path to one or more of the uncongested second paths in response to the first determination.

Abstract translation: 一种技术包括通过到达目的地的多个路径的至少第一路径向目的地发送业务，每个路径包括一个或多个路径段，与每个路径段相关联的多个端口，接收每个路径段的每个端口的拥塞信息 所述端口基于所述端口拥塞信息来确定所述多个路径段中的每一个是否拥塞，进行所述第一路径拥塞并且所述一条或多条第二路径不拥塞的第一确定，所述路径中的每一条被确定为 响应于第一确定，路径的一个或多个路径段拥塞，并且将指向目的地的至少一些流量从拥塞的第一路径重新路由到一个或多个未占用的第二路径重新路由。

公开(公告)号：US09455870B1

公开(公告)日：2016-09-27

申请号：US13921578

申请日：2013-06-19

Applicant: Google Inc.

Inventor： Abdul Kabbani ,  Amin Vahdat

IPC: G06F15/177 ,  H04L12/24

CPC classification number: H04L41/12

Abstract: Systems and methods of configuring a computer network are provided. N network nodes can each form M communication links with other network nodes. A number of communication links equal to the largest integer not greater than the quotient of M divided by (N−1) can be assigned between each pair of network nodes. The remaining communication links can be assigned such that a graph represented by the network nodes and communication links is substantially geometrically symmetric.

Abstract translation: 提供了配置计算机网络的系统和方法。 N个网络节点可以与其他网络节点形成M个通信链路。 可以在每对网络节点之间分配等于不大于M除以（N-1）的商的最大整数的多个通信链路。 可以分配剩余的通信链路，使得由网络节点和通信链路表示的图形基本上是几何对称的。

公开(公告)号：US09262372B1

公开(公告)日：2016-02-16

申请号：US13917042

申请日：2013-06-13

Applicant: Google Inc.

Inventor： Abdul Kabbani ,  Robert Felderman

IPC: G06F15/16 ,  G06F15/177 ,  H04L12/947

CPC classification number: G06F15/177 ,  H04L41/12 ,  H04L49/25 ,  H04L49/70

Abstract: Systems and methods of configuring a computer network are provided. The network can include a first stage of M nodes and a second stage of N nodes. Each node in the first stage can form F communication links with nodes in the second stage and each node in the second stage can form S communication links with nodes in the first stage. Nodes in the first stage are connected to each other only through communication links connecting nodes in the first stage to nodes in the second stage. Communication links between the nodes can be assigned such that the minimum value of the throughput between any pair of nodes in the first stage is maximized.

Abstract translation: 提供了配置计算机网络的系统和方法。 网络可以包括M个节点的第一阶段和N个节点的第二阶段。 第一级中的每个节点可以与第二级中的节点形成F通信链路，并且第二级中的每个节点可以与第一级中的节点形成S通信链路。 第一级中的节点仅通过将第一级中的节点连接到第二级中的节点的通信链路相互连接。 可以分配节点之间的通信链路，使得在第一阶段中的任何一对节点之间的吞吐量的最小值被最大化。

公开(公告)号：US09166886B1

公开(公告)日：2015-10-20

申请号：US13921871

申请日：2013-06-19

Applicant: Google Inc.

Inventor： Abdul Kabbani ,  Amin Vahdat

IPC: H04L12/24 ,  H04L12/947 ,  H04L12/933 ,  H04L12/721

CPC classification number: H04L41/12 ,  H04L43/0894 ,  H04L45/12 ,  H04L49/1515 ,  H04L49/25

Abstract: A system determines a physical topology of a network including a plurality of nodes. Each node includes a multi-chip higher-tier switch, and each chip in the multi-chip higher-tier switch includes a plurality of ports. A network configuration module is configured to assign physical connections to respective ports of chips of the higher-tier switches through an iterative process. The iterative process includes selecting a first route of a plurality of routes, assigning for the source node of the selected route, a first port on a first chip having an odd number of free ports. For at least one intermediate node of the selected route, second and third ports on a second chip having an even number of free ports are assigned. For a destination port for the selected route, a fourth port on a third chip having an odd number of free ports is assigned.

Abstract translation: 系统确定包括多个节点的网络的物理拓扑。 每个节点包括多芯片高层交换机，并且多芯片高层交换机中的每个芯片包括多个端口。 网络配置模块被配置为通过迭代过程将物理连接分配给较高层交换机的各个芯片的端口。 迭代过程包括选择多个路由的第一路由，为所选路由的源节点分配具有奇数个空闲端口的第一芯片上的第一端口。 对于所选路由的至少一个中间节点，分配具有偶数个空闲端口的第二芯片上的第二和第三端口。 对于所选路由的目的地端口，分配具有奇数个空闲端口的第三芯片上的第四端口。

公开(公告)号：US09166692B1

公开(公告)日：2015-10-20

申请号：US14166011

申请日：2014-01-28

Applicant: Google Inc.

Inventor： Robert Felderman ,  Abdul Kabbani

IPC: H04J14/00 ,  H04B10/27 ,  H04L12/751 ,  H04L12/933 ,  H04Q11/00 ,  H04L12/24 ,  H04L12/947

CPC classification number: H04B10/27 ,  H04L41/12 ,  H04L45/02 ,  H04L49/15 ,  H04L49/25 ,  H04Q11/0005 ,  H04Q11/0071 ,  H04Q2011/005 ,  H04Q2011/0052 ,  H04Q2011/0054 ,  H04Q2011/0086 ,  H04Q2011/009

Abstract: The present disclosure describes systems and methods for reconfiguring the links made by a plurality of optical circuit switches between the nodes of the first layer and the nodes of the second layer that reduces the throughput loss when the network transitions form a first logical topology to a second logical topology. More particularly, the first logical topology is realized by a specific physical topology, while the second logical topology may be realized by one or more physical topologies. The disclosure describes a method for selecting a second physical topology from the one or more physical topologies that will realize the second logical topology while reducing the number of links within each of the optical circuit switches that must be reconfigured (i.e, disconnected from their present ports and reconnected to new ports within the optical circuit switch) to transition from the first to second logical topology.

Abstract translation: 本公开描述了用于重新配置由第一层的节点和第二层的节点之间的多个光电路交换机所做的链路的系统和方法，当网络从第一逻辑拓扑转换到第二层时，吞吐量损失降低 逻辑拓扑。 更具体地，第一逻辑拓扑通过特定物理拓扑实现，而第二逻辑拓扑可以由一个或多个物理拓扑来实现。 本公开描述了一种用于从将实现第二逻辑拓扑的一个或多个物理拓扑中选择第二物理拓扑的方法，同时减少必须重新配置的每个光电路交换机内的链路的数量（即，与其当前端口断开连接） 并重新连接到光电路交换机内的新端口）从第一逻辑拓扑转换到第二逻辑拓扑。

公开(公告)号：US09692639B1

公开(公告)日：2017-06-27

申请号：US13932703

申请日：2013-07-01

Applicant: Google Inc.

Inventor： Abdul Kabbani ,  Amin Vahdat

IPC: G06F15/177 ,  H04L12/24

CPC classification number: H04L41/12

Abstract: Systems and methods of configuring a computer network are provided. A first stage having F switches and a second stage having S switches can be provided. Each switch in the first stage of switches can form M communication links with switches in the second stage of switches. Each switch in the second stage can form N communication links with switches in the first stage of switches. Communication links between respective switch pairs can be assigned. Each switch pair can include one witch in the first stage of switches and one switch in the second stage of switches. The number of communication links assigned to at least one switch pair can differ from the number of communication links assigned to at least a second switch pair.

公开(公告)号：US09608913B1

公开(公告)日：2017-03-28

申请号：US14223645

申请日：2014-03-24

Applicant: GOOGLE INC.

Inventor： Abdul Kabbani ,  Jahangir Hasan ,  Amin Vahdat

IPC: H04L12/803 ,  H04L12/743

CPC classification number: H04L47/125 ,  H04L45/7457

Abstract: A method for weighted data traffic routing can include generating an integer hash value based on a header of a data packet and encoding the integer hash value to generate a search key for a content addressable memory included in the data switch. The method can also include performing a lookup in the content addressable memory to match the search key with one of a plurality of prefixes stored in the content addressable memory, the plurality of prefixes including an encoded set of routing weights associated with a plurality of egress ports of the data switch. The method can further include forwarding the data packet on an egress port of the plurality of egress ports associated with the one of the plurality of prefixes in the content addressable memory.