QUANTIFYING AND DESIGNING OPTIMAL CONNECTING NETWORKS

摘要

A method for optimizing network design includes identifying a set of terminal-to-terminal shortest paths in a network, wherein a terminal-to-terminal shortest path is a best connection between two terminals, evaluating a terminal betweenness for each non-terminal vertex in the network, wherein the terminal betweenness of a vertex is a fraction of the total number of terminal-to-terminal shortest paths that include said vertex, calculating an average terminal betweenness for each terminal-to-terminal shortest path based on the terminal betweenness of the vertices in the path, iteratively adding the terminal-to-terminal shortest paths to an output graph in order of decreasing average terminal betweenness until all terminals are represented on the output graph, and using the output graph to design or adjust a network. The method may also include displaying the output graph to a user. A computer program product and computer system corresponding to the method are also disclosed.

主权项

1. A method for optimizing network design, the method comprising:
identifying a set of terminal-to-terminal shortest paths in a network, wherein a terminal-to-terminal shortest path is a best connection between two terminals; evaluating a terminal betweenness for each non-terminal vertex in the network, wherein the terminal betweenness of a vertex is a fraction of the total number of terminal-to-terminal shortest paths that include said vertex; calculating an average terminal betweenness for each terminal-to-terminal shortest path based on the terminal betweenness of the vertices in the path; iteratively adding the terminal-to-terminal shortest paths to an output graph in order of decreasing average terminal betweenness until all terminals are represented on the output graph; and using the output graph to design or adjust a network.