The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Nov. 17, 2020

Filed:

Oct. 08, 2018
Applicant:

Fujitsu Limited, Kawasaki, JP;

Inventors:

Nannan Wang, Plano, TX (US);

Xi Wang, Murphy, TX (US);

Paparao Palacharla, Richardson, TX (US);

Tadashi Ikeuchi, Plano, TX (US);

Weisheng Xie, Plano, TX (US);

Assignee:

Fujitsu Limited, Kawasaki, JP;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H04L 12/26 (2006.01); H04L 12/733 (2013.01); H04L 12/721 (2013.01); G06F 16/901 (2019.01);
U.S. Cl.
CPC ...
H04L 45/126 (2013.01); G06F 16/9024 (2019.01); H04L 43/026 (2013.01); H04L 45/124 (2013.01); H04L 45/38 (2013.01);
Abstract

Systems and methods for identifying a service region that includes sub-regions; calculating, for each pair of neighboring sub-regions, traffic data of computing devices traveling between the pair of sub-region; generating a directed graph representing the service region, the directed graph including nodes representing the sub-regions and the links between the nodes representing the first and the second traffic data; partitioning the directed graph into graph partitions, each graph partition including sub-graphs; calculating, for each sub-graph of each graph partition, a net traffic flow for the sub-graph based on a difference of the first and the second traffic data of the sub-regions that correspond to the nodes of the sub-graph; calculating, for each graph partition, a net traffic flow for the graph partition based on a summation of the net traffic flow of each sub-graph of the graph partition; identifying a particular graph partition having a smallest net traffic flow.


Find Patent Forward Citations

Loading…