公开(公告)号：US08964546B1

公开(公告)日：2015-02-24

申请号：US13755277

申请日：2013-01-31

Applicant: Google Inc.

Inventor： Sushant Jain ,  Alok Kumar ,  Rui Zhang-Shen ,  Michael Alex Frumkin ,  Aspi Homi Siganporia ,  Matthew Jonathan Holliman

IPC: H04L12/28 ,  H04L12/825 ,  H04L12/26

CPC classification number: H04L43/0894 ,  H04L43/0882 ,  H04L47/24

Abstract: Systems and methods are disclosed herein for measuring the traffic flow on a link. The system includes a processor that is configured to generate aggregate egress data for multiple origin endpoints by aggregating amounts of egress traffic detected by servers processing the egress traffic at the origin endpoints. The processor is also configured to obtain the proportions of traffic flows that traverse each path between each endpoint pair, which includes an origin endpoint and a destination endpoint. Each path includes multiple network links such that a single network link may be shared across multiple paths. Finally, the processor computes an amount of traffic flow on a shared link based on the aggregate egress data and the obtained proportions.

Abstract translation: 本文公开了用于测量链路上的业务流的系统和方法。 该系统包括处理器，其被配置为通过聚合由处理在源端点处的出口业务的服务器检测到的出口流量的总量来生成多个原始端点的聚合出口数据。 处理器还被配置为获得遍历每个端点对（其包括源端点和目的端点）之间的每个路径的业务流的比例。 每个路径包括多个网络链路，使得单个网络链路可以跨多个路径共享。 最后，处理器基于聚合出口数据和获得的比例来计算共享链路上的业务流量。

公开(公告)号：US09553794B1

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

申请号：US14152548

申请日：2014-01-10

Applicant: Google Inc.

Inventor： Jonathan Edward Zolla ,  Aspi Homi Siganporia ,  Uday Ramakrishma Naik ,  Alok Kumar ,  Sushant Jain ,  Michael Alex Frumkin

IPC: H04L12/729 ,  H04L12/803 ,  H04L12/721 ,  H04L12/917 ,  H04L12/801 ,  H04L12/751 ,  H04L12/911

CPC classification number: H04L45/125 ,  H04L45/02 ,  H04L45/123 ,  H04L47/11 ,  H04L47/122 ,  H04L47/18 ,  H04L47/76 ,  H04L47/829

Abstract: A traffic engineering process seeks to optimize network utilization and creating paths in the network such that the network is used efficiently. The exemplary embodiments seek to maintain fairness across allocation of flows while honoring constraints on the number of paths used per flow and the granularity of splits allowed. Exemplary embodiments provide a solution in a speedy manner and get close to optimal solutions for allocation of the network traffic.

Abstract translation: 流量工程流程旨在优化网络利用率并在网络中创建路径，从而有效利用网络。 示例性实施例旨在在分配流中保持公平性，同时遵守对每个流使用的路径的数量的限制以及允许的分割的粒度。 示例性实施例以快速的方式提供解决方案并且接近用于分配网络业务的最佳解决方案。

公开(公告)号：US09369338B1

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

申请号：US14143593

申请日：2013-12-30

Applicant: Google Inc.

Inventor： Rajesh Krishnaswamy ,  Michael Alex Frumkin

IPC: H04L12/28 ,  H04L12/24

CPC classification number: H04L41/0668 ,  H04L41/0672 ,  H04L41/0896 ,  H04L43/0882 ,  H04L45/123 ,  H04L45/125 ,  H04L47/746

Abstract: A system and method is provided for identifying network links for augmentation based on potential link failures. In one aspect, the links are selected by identifying multiple shortest paths between a node pair and generating augmentation recommendations for a single link by accumulating recommendations based on multiple node pairs.

Abstract translation: 提供了一种系统和方法，用于基于潜在的链路故障识别用于增强的网络链路。 在一个方面，通过识别节点对之间的多个最短路径并通过基于多个节点对的累积推荐来为单个链路生成增强建议来选择链路。