公开(公告)号：US09608917B1

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

申请号：US14058749

申请日：2013-10-21

Applicant: Google Inc.

Inventor： Glen Anderson ,  Steven Padgett ,  Junlan Zhou ,  Uday Ramakrishna Naik ,  Alok Kumar ,  Amin Vahdat ,  Sushant Jain

IPC: H04L12/851 ,  H04L12/801

CPC classification number: H04L47/2441 ,  H04L47/10 ,  H04L47/24 ,  H04L47/72

Abstract: Systems and methods for achieving high utilization of a network link are provided. A first communication protocol can be selected for transmitting network flows of a first type. A first quality of service can be assigned to network flows of the first type. A second communication protocol can be selected for transmitting network flows of a second type. A second quality of service, lower than the first quality of service, can be assigned to network flows of the second type. A first percentage of available bandwidth can be allocated to the network flows of both the first and second types. The remaining bandwidth, plus a second percentage of available bandwidth, can be allocated to the network flows of the second type, such that the total allocated bandwidth exceeds the available bandwidth of the network link.

公开(公告)号：US09559949B1

公开(公告)日：2017-01-31

申请号：US14732214

申请日：2015-06-05

Applicant: Google Inc.

Inventor： Junlan Zhou ,  Zhengrong Ji ,  Yuguang Wu

IPC: H04L12/723 ,  H04L12/701 ,  H04L12/801

CPC classification number: H04L45/50 ,  H04L45/00 ,  H04L47/10

Abstract: A router residing in a network comprises at least one ingress port, at least one egress port, and a processor programmed to compare at least two label switch paths, determine potential conflicts between the at least two label switch paths based on the ingress ports and egress ports utilized by the label switch paths, and determine a selected identifier to be assigned relative to each label switch path. The processor is configured to assign a common identifier if no conflict exists. A storage medium is operatively coupled to the processor for storing the selected identifiers related to the label switch paths. The processor may be configured to determine that a conflict exists between two label switch paths if they utilize the same ingress port on the router and different egress ports on the router.

Abstract translation: 驻留在网络中的路由器包括至少一个进入端口，至少一个出口端口和被编程为比较至少两个标签交换路径的处理器，基于入口端口和出口确定至少两个标签交换路径之间的潜在冲突 由标签交换路径使用的端口，并且确定要相对于每个标签交换路径分配的所选择的标识符。 处理器配置为在没有冲突存在的情况下分配公共标识符。 存储介质可操作地耦合到处理器，用于存储与标签交换路径相关的所选标识符。 处理器可以被配置为如果它们利用路由器上的相同入口端口和路由器上的不同出口端口，则确定两个标签交换路径之间存在冲突。

公开(公告)号：US09537714B1

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

申请号：US14327050

申请日：2014-07-09

Applicant: Google Inc.

Inventor： Junlan Zhou ,  Amin Vahdat ,  Peter Peresini

IPC: H04L12/751 ,  H04L12/24

CPC classification number: H04L41/084 ,  H04L41/0813 ,  H04L41/0823 ,  H04L41/0883 ,  H04L41/12 ,  H04L41/145

Abstract: The present disclosure presents a system and method for determining a logical topology of a network, given the network's physical topology. More particularly, a logical topology is implemented across a plurality of optical circuit switches that interconnect the nodes of a network. Each of the optical circuit switches includes an initial internal configuration. The internal configuration of the optical circuit switches are swapped to generate new logical topologies. A fitness is determined for each of the generated topologies. The fitnesses of the topologies are then ranked and the most fit logical topology is implemented in the network.

Abstract translation: 本公开提供了给定网络的物理拓扑的用于确定网络的逻辑拓扑的系统和方法。 更具体地说，在互连网络的节点的多个光学电路交换机之间实现逻辑拓扑。 每个光电路开关包括初始内部配置。 交换光电路交换机的内部配置以产生新的逻辑拓扑。 确定每个生成的拓扑的适应度。 然后对拓扑结构的适应度进行排序，并在网络中实现最合适的逻辑拓扑。

公开(公告)号：US20160119696A1

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

申请号：US14986016

申请日：2015-12-31

Applicant: Google Inc.

Inventor： Ryohei Urata ,  Hong Liu ,  Amin Vahdat ,  Christopher Lyle Johnson ,  Junlan Zhou ,  Alexander Shraer

IPC: H04Q11/00

CPC classification number: H04Q11/0005 ,  G06F13/4022 ,  H04Q11/0062 ,  H04Q2011/0015 ,  H04Q2011/0052 ,  Y02D10/14 ,  Y02D10/151

Abstract: Systems and methods for increasing bandwidth in a computer network are provided. A computer network can include a first lower level switch, first and second upper level switches, and first and second passive optical splitters, and a mirror. The first passive optical splitter can have a first port directly coupled to the first upper level switch, a second port directly coupled to the second upper level switch. The second passive optical splitter can have a port directly coupled to a port of the first passive optical splitter, and a port directly coupled to the first lower level switch. The mirror can be coupled to a port of the second passive optical splitter and reflect an optical signal received from the second passive optical splitter to the first upper level switch and second upper level switch through the second passive optical splitter and the first passive optical splitter.

Abstract translation: 提供了一种用于增加计算机网络带宽的系统和方法。 计算机网络可以包括第一下级开关，第一和第二上级开关以及第一和第二无源分光器以及反射镜。 第一无源分光器可以具有直接耦合到第一上级开关的第一端口，直接耦合到第二上级开关的第二端口。 第二无源光分路器可以具有直接耦合到第一无源分光器的端口的端口，以及直接耦合到第一下级开关的端口。 反射镜可以耦合到第二无源光分路器的端口，并且将从第二无源光分路器接收的光信号反射到通过第二无源分光器和第一无源分光器的第一上级开关和第二上级开关。

公开(公告)号：US09276771B1

公开(公告)日：2016-03-01

申请号：US14039586

申请日：2013-09-27

Applicant: Google Inc.

Inventor： Junlan Zhou ,  Ji Zhengrong

IPC: H04J1/16 ,  H04L12/54

CPC classification number: H04L12/56 ,  H04L45/02 ,  H04L45/24 ,  H04L45/745

Abstract: Exemplary embodiments provide compression of data that will be saved to a multipath table for a given set of routing rules. Thus, the total space required in the multipath table for storing a given set of routing rules is reduced. A routing rule associated with a network switch may be represented using a building block that includes one or more entries. The one or more entries form an unordered enumeration of egress ports of the network switch. In the routing rule, the weight of an egress port is represented by the number of times the egress port appears in the building block. Compression of data may be accomplished by combining one or more of the routing rules into a same building block having one or more entries. The building block may be stored in the multipath table, hereby programming the one or more of the rules into the multipath table.

Abstract translation: 示例性实施例提供了对于给定的一组路由规则将被保存到多路径表的数据的压缩。 因此，减少了用于存储给定路由规则集的多路径表中所需的总空间。 可以使用包括一个或多个条目的构建块来表示与网络交换机相关联的路由规则。 一个或多个条目形成网络交换机的出口端口的无序枚举。 在路由规则中，出口端口的权重由出站端口出现在构建块中的次数表示。 可以通过将一个或多个路由规则组合成具有一个或多个条目的相同构建块来实现数据的压缩。 构建块可以存储在多路径表中，因此将一个或多个规则编程到多路径表中。

公开(公告)号：US09154440B2

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

申请号：US13848430

申请日：2013-03-21

Applicant: Google Inc.

Inventor： Junlan Zhou ,  Zhengrong Ji ,  Yuguang Wu

IPC: H04L12/863 ,  H04L12/701 ,  H04L12/707 ,  H04L12/26

CPC classification number: H04L47/622 ,  H04L43/12 ,  H04L45/00 ,  H04L45/128 ,  H04L45/24

Abstract: Aspects of the invention pertain to transmitting packet data across a computer network. The packets may be sent via one or more distinct routes from a source to a destination. Each route may employ multiple routers disposed along the network. Non-colliding routes are determined by transmitting pairs of probe packets along the routes. A first probe packet has a maximal length, and a second probe packet has a minimal length. Depending on the order of arrival of the probe packets, the system determines whether two transport layer ports at the destination device collide. If there is a collision, then the system searches for a set of non-colliding ports. Once the non-colliding ports are determined, application data may be sent as packets along the different routes to those ports.

Abstract translation: 本发明的各方面涉及通过计算机网络发送分组数据。 可以通过一个或多个不同的路由从源向目的地发送分组。 每个路由可以使用沿着网络布置的多个路由器。 通过沿路由发送探测数据包对来确定非冲突路由。 第一探测分组具有最大长度，并且第二探测分组具有最小长度。 根据探测报文的到达顺序，系统确定目的设备的两个传输层端口是否相撞。 如果存在冲突，则系统将搜索一组非冲突端口。 一旦确定了非冲突端口，应用数据可以作为沿着不同路由的分组发送到那些端口。

公开(公告)号：US20130215766A1

公开(公告)日：2013-08-22

申请号：US13848430

申请日：2013-03-21

Applicant: Google Inc.

Inventor： Junlan Zhou ,  Zhengrong Ji ,  Yuguang Wu

IPC: H04L12/70

CPC classification number: H04L47/622 ,  H04L43/12 ,  H04L45/00 ,  H04L45/128 ,  H04L45/24

Abstract: Aspects of the invention pertain to transmitting packet data across a computer network. The packets may be sent via one or more distinct routes from a source to a destination. Each route may employ multiple routers disposed along the network. Non-colliding routes are determined by transmitting pairs of probe packets along the routes. A first probe packet has a maximal length, and a second probe packet has a minimal length. Depending on the order of arrival of the probe packets, the system determines whether two transport layer ports at the destination device collide. If there is a collision, then the system searches for a set of non-colliding ports. Once the non-colliding ports are determined, application data may be sent as packets along the different routes to those ports.

Abstract translation: 本发明的各方面涉及通过计算机网络发送分组数据。 可以通过一个或多个不同的路由从源向目的地发送分组。 每个路由可以使用沿着网络布置的多个路由器。 通过沿路由发送探测数据包对来确定非冲突路由。 第一探测分组具有最大长度，并且第二探测分组具有最小长度。 根据探测报文的到达顺序，系统确定目的设备的两个传输层端口是否相撞。 如果存在冲突，则系统将搜索一组非冲突端口。 一旦确定了非冲突端口，应用数据可以作为沿着不同路由的分组发送到那些端口。