公开(公告)号：US11159380B2

公开(公告)日：2021-10-26

申请号：US16241351

申请日：2019-01-07

Applicant: Google LLC

Inventor： David Mandle ,  Yaoyao Gu ,  Brian Barritt ,  Tatiana Kichkaylo

IPC: H04W56/00 ,  H04L12/24 ,  H04W40/24 ,  H04L12/26 ,  H04L12/751 ,  H04W16/28 ,  H04B7/185 ,  H04W40/02 ,  H04W84/00 ,  H04W84/06 ,  H04L12/721 ,  H04L12/753

Abstract: This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.

公开(公告)号：US20190394094A1

公开(公告)日：2019-12-26

申请号：US16241351

申请日：2019-01-07

Applicant: Google LLC

Inventor： David Mandle ,  Yaoyao Gu ,  Brian Barritt ,  Tatiana Kichkaylo

IPC: H04L12/24 ,  H04W40/24 ,  H04L12/26 ,  H04L12/751 ,  H04W16/28

Abstract: This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.