知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

7 records (took 0.014 seconds)

    Determining WCMP link capacities in multi-stage networks
    1.
    发明授权
    Determining WCMP link capacities in multi-stage networks 有权
    确定多级网络中的WCMP链路容量

    公开(公告)号：US09363162B1

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

    申请号：US14059015

    申请日：2013-10-21

    Applicant: Google Inc.

    Inventor： Junlan Zhou ,  Arjun Singh ,  Amin Vahdat

    IPC: H04J1/16 ,  H04L12/721

    CPC classification number: H04L45/123

    Abstract: Exemplary embodiments determine respective capacities of network links in a multi-stage network. Specifically, the capacities of the upstream links for a given network element are determined based on the capacities of the downstream links for that network element. According to the various embodiments, a network element determines the amount of data, i.e. traffic, which may be assigned to downstream links based on the determined capacities. A network element may not receive more traffic than the total direct downstream capacity of the network element. Thus, optimum throughput may be attained for the entire network.

    Abstract translation: 示例性实施例确定多级网络中的网络链路的相应容量。 具体地，基于用于该网络元件的下游链路的容量来确定给定网元的上行链路的容量。 根据各种实施例，网络元件基于所确定的容量确定可以分配给下游链路的数据量，即流量。 网络元件可能不会比网络元件的总直接下行容量接收更多的流量。 因此，可以为整个网络获得最佳的吞吐量。

    SYSTEM AND METHOD FOR SOFTWARE DEFINED ROUTING OF TRAFFIC WITHIN AND BETWEEN AUTONOMOUS SYSTEMS WITH ENHANCED FLOW ROUTING, SCALABILITY AND SECURITY
    2.
    发明申请
    SYSTEM AND METHOD FOR SOFTWARE DEFINED ROUTING OF TRAFFIC WITHIN AND BETWEEN AUTONOMOUS SYSTEMS WITH ENHANCED FLOW ROUTING, SCALABILITY AND SECURITY 有权
    软件系统和方法定义了自动系统之间和之间的交通路由，具有增强的流量路由，可扩展性和安全性

    公开(公告)号：US20150281066A1

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

    申请号：US14478217

    申请日：2014-09-05

    Applicant: Google Inc.

    Inventor： Bikash Koley ,  Steven Padgett ,  Ankur Jain ,  Arjun Singh ,  Amin Vahdat ,  Mahesh Kallahalla ,  Mukarram Tariq

    IPC: H04L12/741 ,  H04L12/947

    CPC classification number: H04L45/74 ,  H04L45/02 ,  H04L45/742 ,  H04L49/25 ,  H04L49/70

    Abstract: An autonomous network and a corresponding routing method include determining routing paths by a controller, and providing the determined routing paths to a data packet processor located remotely from the controller. The data packet processor routes outgoing data packets, based on information from the controller, through a plurality of switches remotely from the data packet processor. Each switch includes a plurality of network interfaces. For an outgoing data packet, the data packet processor determines a network interface over which to transmit the data packet, and adds an indication of the determined network interface in a header of the data packet. The data packet processor forwards the modified data packet to the switch including the determined network interface. The switch identifies the network interface based on the indication, and transmits the outgoing data packet over the identified network interface.

    Abstract translation: 自主网络和对应的路由方法包括由控制器确定路由路径，并将确定的路由路径提供给远离控制器的数据分组处理器。 数据分组处理器基于来自控制器的信息，通过远程从数据分组处理器的多个交换机来路由输出数据分组。 每个交换机包括多个网络接口。 对于输出数据分组，数据分组处理器确定发送数据分组的网络接口，并将确定的网络接口的指示添加到数据分组的报头中。 数据分组处理器将修改的数据分组转发到包括确定的网络接口的交换机。 交换机根据指示识别网络接口，并通过识别的网络接口发送出站数据包。

    Multi-stage switching topology
    3.
    发明授权
    Multi-stage switching topology 有权
    多级交换拓扑

    公开(公告)号：US09503395B1

    公开(公告)日：2016-11-22

    申请号：US14457392

    申请日：2014-08-12

    Applicant: Google Inc.

    Inventor： Junlan Zhou ,  Amin Vahdat ,  Arjun Singh

    IPC: H04L12/58 ,  H04L12/933 ,  H04L12/54 ,  H04L12/823

    CPC classification number: H04L49/1515 ,  H04L12/56 ,  H04L47/32 ,  H04Q11/08 ,  H04Q2213/1338

    Abstract: The present technology considers multi-stage network topologies where it is not possible to evenly stripe uplinks from a lower stage of the network topology to switching units in an upper stage of the topology. This technology proposes techniques to both improve overall throughput and to deliver uniform performance to all end hosts with uneven connectivity among the different stages while delivering uniform performance to all hosts. To achieve improved network performance in case of asymmetric connectivity, more flows may be sent to some egress ports than to others, thus weighting some ports more than others, resulting in Weighted Cost Multi Path (WCMP) flow distribution.

    Abstract translation: 本技术考虑到多级网络拓扑，其中不可能均匀地将上行链路从网络拓扑的较低级别划分到拓扑的上级中的交换单元。 该技术提出了提高总体吞吐量并为所有终端主机提供统一性能的技术，不同阶段之间的连接不均衡，同时为所有主机提供均匀的性能。 为了在不对称连接的情况下实现改进的网络性能，可以向某些出口端口发送比其他端口更多的流，因此比其他端口更多地加权一些端口，导致加权成本多径（WCMP）流分布。

    Shortest first longer next routing with congestion reduction
    4.
    发明授权
    Shortest first longer next routing with congestion reduction 有权
    最短的第一次下一次路由，拥塞减少

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

    Traffic distribution over multiple paths in a network
    7.
    发明授权
    Traffic distribution over multiple paths in a network 有权
    流量分布在网络中的多条路径上

    公开(公告)号：US09565096B1

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

    申请号：US14288972

    申请日：2014-05-28

    Applicant: Google Inc.

    Inventor： Arjun Singh ,  Ashish Vibhakar Naik ,  Subhasree Mandal

    IPC: G06F13/00 ,  H04L12/707 ,  H04L12/755

    CPC classification number: H04L45/24 ,  H04L45/021 ,  H04L45/54 ,  H04L45/7453 ,  H04L47/125

    Abstract: System and methods for efficiently distributing data packets in a multi-path network having a plurality of equal cost paths each having the same number of hops are provided. In one aspect, a system and method includes reordering the entries in the routing table of one or more peer routing devices, such that succeeding equal cost next hop routing devices that are interconnected in a Clos formation to the peer routing devices received unbiased traffic from each of the peer routing devices, thus enabling the succeeding next hop routing devices to distribute data traffic evenly over additional equal cost multiple hops further into the network.

    Abstract translation: 提供了一种用于在具有多个具有相同跳数的等价成本路径的多路径网络中有效分配数据分组的系统和方法。 一方面，系统和方法包括重新排序一个或多个对等路由设备的路由表中的条目，使得在Clos形式中互连到对等路由设备的成功的等价成本下一跳路由设备从每个路由设备接收到无偏差业务 的对等路由设备，从而使后续的下一跳路由设备能够将数据流量均匀地分布到进一步进入网络的额外的等成本多跳中。

Patent Agency Ranking