公开(公告)号：US20140105023A1

公开(公告)日：2014-04-17

申请号：US14106672

申请日：2013-12-13

Applicant: Google Inc.

Inventor： Yuguang Wu ,  Junlan Zhou

IPC: H04L12/891

CPC classification number: H04L47/41 ,  H04L45/125 ,  H04L45/38 ,  H04L47/2441

Abstract: A method includes, receiving a plurality of data flows. A respective data flow includes a respective source address and a respective destination address. The method further includes generating, without regard to priorities associated with the plurality of data flows, an ordering of the plurality of data flows; and iteratively modifying, without regard to the priorities, the ordering of the plurality of data flows by applying a randomization algorithm to the plurality of data flows, until a cost associated with path assignments for the ordering of the plurality of data flows satisfies a predetermined condition. A respective path assignment for a respective data flow specifies a respective path from a respective source address to a respective destination address. The method also includes executing the data flows based on the path assignments for the ordering of the plurality of data flows having the cost that satisfies the predetermined condition.

Abstract translation: 一种方法包括：接收多个数据流。 相应的数据流包括相应的源地址和相应的目的地地址。 该方法还包括：生成与多个数据流相关联的优先级，多个数据流的排序; 并且通过对所述多个数据流应用随机化算法来迭代地修改所述多个数据流的顺序，直到与所述多个数据流的顺序的路径分配相关联的成本满足预定条件 。 相应数据流的相应路径分配指定从相应源地址到相应目的地地址的相应路径。 该方法还包括基于具有满足预定条件的成本的多个数据流的顺序的路径分配来执行数据流。

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

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

公开(公告)号：US20160070770A1

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

申请号：US13663372

申请日：2012-10-29

Applicant: GOOGLE INC.

Inventor： Jianming He ,  Yuguang Wu

IPC: G06F17/30

CPC classification number: G06F16/9024 ,  G06F16/9535 ,  G06Q50/01

Abstract: A system and computer-implemented method for suggesting social groups is provided. Direct contacts connected to a user of a social networking service are identified. Secondary contacts are further identified, where each of the secondary contacts is connected to at least one of the direct contacts. A set of direct contacts is determined from the direct contacts based on connections between the direct contacts and the secondary contacts. The set of direct contacts is provided as a suggested social group.

Abstract translation: 提供了一种用于建议社会群体的系统和计算机实现的方法。 识别连接到社交网络服务的用户的直接联系人。 进一步识别次触点，其中每个次触点连接到至少一个直接触点。 基于直接触点和次触点之间的连接，从直接触点确定一组直接触点。 提供一组直接联系作为建议的社会团体。

公开(公告)号：US09077660B1

公开(公告)日：2015-07-07

申请号：US14148027

申请日：2014-01-06

Applicant: Google Inc.

Inventor： Junlan Zhou ,  Zhengrong Ji ,  Yuguang Wu

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