公开(公告)号：US20180109606A1

公开(公告)日：2018-04-19

申请号：US15294494

申请日：2016-10-14

Applicant: Google Inc.

Inventor： Jesse Louis Alpert ,  Uday Naik ,  Md Ahsan Arefin ,  David Andrew Schultz ,  Yossi Richter

IPC: H04L29/08 ,  H04L12/46 ,  H04L12/713 ,  H04L12/751 ,  H04L12/26 ,  H04L12/721 ,  H04L12/761

CPC classification number: H04L67/1025 ,  H04L12/4641 ,  H04L43/026 ,  H04L43/0894 ,  H04L43/16 ,  H04L45/02 ,  H04L45/16 ,  H04L45/38 ,  H04L45/586 ,  H04L47/2483

Abstract: Systems and methods for dynamically offloading network traffic flows in one or more virtual networks are disclosed. An example method begins with identifying a virtual router through which to route network traffic of a specific network flow, wherein the specific network flow has a source endpoint existing on a source host machine and a destination endpoint existing on a destination host machine. Flow statistics including statistics about the specific network flow are received. A determination is made as to whether the specific network flow meets an offload rule using the received flow statistics. In response to determining that the specific flow meets the offload rule, the specific network flow is offloaded from the virtual router.

公开(公告)号：US09400849B1

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

申请号：US14473563

申请日：2014-08-29

Applicant: Google Inc.

Inventor： Jesse Louis Alpert ,  Nissan Hajaj

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/3089 ,  G06F17/30424 ,  G06F17/30705 ,  G06F17/30864 ,  G06F17/30958 ,  H04L45/122 ,  H04L67/02 ,  H04L67/327

Abstract: Systems and methods for finding multiple shortest paths. A directed graph representing web resources and links are divided into shards, each shard comprising a portion of the graph representing multiple web resources. Each of the shards is assigned to a server, and a distance table is calculated in parallel for each of the web resources in each shard using a nearest seed computation in the server to which the shard was assigned.

Abstract translation: 查找多条最短路径的系统和方法。 表示网页资源和链接的有向图被划分成分片，每个分片包括表示多个网页资源的图表的一部分。 将每个分片分配给服务器，并且使用分配了分片的服务器中的最近的种子计算，并行计算每个分片中的每个网页资源的距离表。