Network design platform

Patent metadata

Field	Value
Publication number	US-10693739-B1
Application number	US-201916559384-A
Country	US
Kind code	B1
Filing date	Sep 3, 2019
Priority date	May 29, 2019
Publication date	Jun 23, 2020
Grant date	Jun 23, 2020

Abstract

A device may obtain incomplete geospatial coordinate data associated with a telecommunications network. The device may generate a network graph representation of the telecommunications network based on the incomplete geospatial coordinate data. The device may determine, for candidate sites, a candidate site score based on a quantity of candidate segments to connect the candidate site to a candidate hub. The device may determine, for candidate segments, a candidate segment score based on a quantity of candidate sites that connect to a candidate hub via the candidate segment. The device may determine a prioritization of the candidate segments based on the candidate site scores and the candidate segment scores. The device may generate a recommendation for selecting or ordering the candidate segments. The device may provide the recommendation for display via a user interface.

First claim

What is claimed is:

1. A device, comprising:
a memory; and
one or more processors operatively coupled to the memory, the memory and the one or more processors configured to:
obtain incomplete geospatial coordinate data associated with a telecommunications network,
wherein the incomplete geospatial coordinate data includes first data identifying candidate segments of the telecommunications network, second data identifying candidate sites of the telecommunications network, and third data identifying candidate hubs of the telecommunications network;

generate a network graph representation of the telecommunications network based on the incomplete geospatial coordinate data,
wherein the network graph representation includes edges corresponding to the candidate segments, a first set of nodes corresponding to the candidate sites and a second set of nodes corresponding to the candidate hubs,

wherein the one or more processors, when generating the network graph representation of the telecommunications network, are configured to:
define a neighborhood around a candidate segment end, corresponding to a candidate segment of the candidate segments, that is parametrized based on a segment length of the candidate segment, and
selectively connect a candidate site, of the candidate sites, to the candidate segment based on a location of the candidate site with respect to the neighborhood and based on a set of candidate site constraints;

determine, for each candidate site, a candidate site score based on a quantity of candidate segments to connect the candidate site to a candidate hub;
determine, for each candidate segment, a candidate segment score based on a quantity of the candidate sites that connect to a candidate hub via the candidate segment;
determine a prioritization of the candidate segments for traversal of the network graph representation based on the candidate site scores and the candidate segment scores;
generate a recommendation for selecting or ordering the candidate segments based on the prioritization of the candidate segments; and
provide the recommendation for display via a user interface.

2. The device of claim 1 , wherein the one or more processors, when generating the network graph representation of the telecommunications network, are configured to:
interconnect the candidate segments; and
connect the candidate sites to the candidate segments based on interconnecting the candidate segments, such that in a resulting network graph representation each candidate site is connected via a route to a corresponding candidate hub.

3. The device of claim 1 , wherein the one or more processors when generating the network graph representation of the telecommunications network are configured to:
define a neighborhood around a candidate segment end, corresponding to a candidate segment of the candidate segments, that is parametrized based on a segment length of the candidate segment; and
selectively connect a candidate splice to the candidate segment based on a location of the candidate splice with respect to the neighborhood and based on a set of candidate site constraints,
wherein the candidate splice is an existing candidate splice or a newly created candidate splice.

4. The device of claim 1 , wherein the one or more processors, when generating the network graph representation of the telecommunications network, are configured to:
identify one or more disconnected nodes of the first set of nodes;
define one or more neighborhoods around the one or more disconnected nodes; and
connect the one or more disconnected nodes to one or more closest splices within the one or more neighborhoods based on proximity in the neighborhood and a set of constraints relating to network topology and connectivity logic.

5. The device of claim 1 , wherein the one or more processors, when generating the network graph representation of the telecommunications network, are configured to:
generate a directed graph based on the incomplete geospatial coordinate data;
search the directed graph to identify one or more orphan roots that do not correspond to the candidate sites; and
connect the one or more orphan roots to one or more closest nodes, of the directed graph, that correspond to a candidate site of the candidate sites in accordance with a set of constraints.

6. The device of claim 1 , wherein the one or more processors when generating the network graph representation of the telecommunications network are configured to:
propose, using a machine learning model of telecommunications networks, one or more new candidate segments, candidate sites, or candidate hubs not identified in the incomplete geospatial coordinate data; and
add the one or more new candidate segments, the candidate sites, or the candidate hubs to the network graph representation of the telecommunications network.

7. A non-transitory computer-readable medium storing one or more instructions, the one or more instructions comprising:
one or more instructions that, when executed by one or more processors of a device, cause the one or more processors to:
obtain network connection data associated with a point-to-point hub-and-spoke architecture network,
wherein the network connection data includes first data identifying candidate segments of the point-to-point hub-and-spoke architecture network and second data identifying candidate sites of the point-to-point hub-and-spoke architecture network;

generate a network graph representation of the point-to-point hub-and-spoke architecture network based on the network connection data,
wherein the network graph representation includes edges corresponding to the candidate segments and nodes corresponding to the candidate sites;

assign candidate site scores to the candidate sites based on a quantity of candidate segments associated with the candidate sites;
assign, for each candidate segment, a segment score based on a quantity of the candidate sites associated with the candidate segment; and
determine a prioritization based on the candidate site scores and the segment scores,
wherein the one or more instructions, that cause the one or more processors to determine the prioritization, cause the one or more processors to:
generate a branching reversed digraph based on the network graph representation of the point-to-point hub-and-spoke architecture network,
apply a page ranking type algorithm to determine node ranks based on the branching reversed digraph,
adjust the node ranks based on a node type criterion relating to whether a node corresponds to a splice or a candidate site,
map the adjusted node ranks to incoming segment edges as segment priorities for the candidate segments, and
normalize and discretize the segment priorities;

generate a recommendation for selecting or ordering the candidate segments based on the prioritization; and
provide the recommendation for display via a user interface.

8. The non-transitory computer-readable medium of claim 7 , wherein the one or more instructions, that cause the one or more processors to determine the prioritization, cause the one or more processors to:
rank each edge corresponding to a candidate segment based on an importance of the edge to a network topology of the network graph representation of the point-to-point hub-and-spoke architecture network.

9. The non-transitory computer-readable medium of claim 7 , wherein the one or more instructions, that cause the one or more processors to determine the prioritization, cause the one or more processors to:
rank an edge, of the edges, corresponding to a candidate segment of the candidate segments based on at least one of:
a quantity of other edges of the edges connecting to the edge,
a value of the candi

Assignees

• Accenture Global Solutions Ltd

Inventors

• Naseri Hassan
• Intriligator Joshua
• Webb Jason P
• Agai Ben
• Chauhan Sachin Kumar

Classifications

• H04L41/145 Primary

  involving simulating, designing, planning or modelling of a network · CPC title

• G06F16/29 Primary

  Geographical information databases · CPC title

• G06N20/00

  Machine learning · CPC title

• H04W16/18

  Network planning tools · CPC title

• H04L41/22

  comprising specially adapted graphical user interfaces [GUI] · CPC title