System and method of determining minimum cost path
First Claim
Patent Images
1. A computer-implemented method comprising:
- representing a network using a graph, the graph comprising a plurality of vertices and a plurality of edges, the plurality of vertices comprising a source vertex, a destination vertex and a vertex u, the plurality of edges linking corresponding adjacent pairs of the plurality of vertices, the plurality of edges comprising edges corresponding to existing fiber optic cables;
augmenting the graph with additional edges representing potential new fiber optic cables such that an additional edge is added between any pair of adjacent vertices directly connected by an edge corresponding to one of the existing fiber optic cables, the additional edge having a cost corresponding to the cost of laying the new fiber optic cable; and
determining, in a processor, a minimum cost path in the graph from the source vertex to the destination vertex, wherein the vertex u is in the minimum cost path, and wherein an edge from the vertex u in the minimum cost path introduces an additional capital expenditure cost that is dependent on how the minimum cost path traverses from the source vertex to the vertex u.
7 Assignments
0 Petitions
Accused Products
Abstract
A network is represented using a graph. The graph comprises a plurality of vertices and a plurality of edges. The vertices comprise a source vertex, a destination vertex and a vertex u. The edges link corresponding adjacent pairs of the vertices. A minimum cost path in the graph is determined from the source vertex to the destination vertex, wherein the vertex u is in the minimum cost path. An edge from the vertex u in the minimum cost path introduces an additional capital expenditure cost that is dependent on how the minimum cost path traverses from the source vertex to the vertex u.
18 Citations
24 Claims
-
1. A computer-implemented method comprising:
-
representing a network using a graph, the graph comprising a plurality of vertices and a plurality of edges, the plurality of vertices comprising a source vertex, a destination vertex and a vertex u, the plurality of edges linking corresponding adjacent pairs of the plurality of vertices, the plurality of edges comprising edges corresponding to existing fiber optic cables; augmenting the graph with additional edges representing potential new fiber optic cables such that an additional edge is added between any pair of adjacent vertices directly connected by an edge corresponding to one of the existing fiber optic cables, the additional edge having a cost corresponding to the cost of laying the new fiber optic cable; and determining, in a processor, a minimum cost path in the graph from the source vertex to the destination vertex, wherein the vertex u is in the minimum cost path, and wherein an edge from the vertex u in the minimum cost path introduces an additional capital expenditure cost that is dependent on how the minimum cost path traverses from the source vertex to the vertex u. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A computer system comprising:
a processor programmed to; represent a network using a graph, the graph comprising a plurality of vertices and a plurality of edges, the plurality of vertices comprising a source vertex, a destination vertex and a vertex u, the plurality of edges linking corresponding adjacent pairs of the plurality of vertices, the plurality of edges comprising edges corresponding to existing fiber optic cables; augment the graph with additional edges representing potential new fiber optic cables such that an additional edge is added between any pair of adjacent vertices directly connected by an edge corresponding to one of the existing fiber optic cables, the additional edge having a cost corresponding to the cost of laying the new fiber optic cable; and determine a minimum cost path in the graph from the source vertex to the destination vertex, wherein the vertex u is in the minimum cost path, and wherein an edge from the vertex u in the minimum cost path introduces an additional capital expenditure cost that is dependent on how the minimum cost path traverses from the source vertex to the vertex u.
-
24. A non-transitory computer-readable storage medium encoded with a computer program, the computer program to cause a computer system to:
-
represent a network using a graph, the graph comprising a plurality of vertices and a plurality of edges, the plurality of vertices comprising a source vertex, a destination vertex and a vertex u, the plurality of edges linking corresponding adjacent pairs of the plurality of vertices, the plurality of edges comprising edges corresponding to existing fiber optic cables; augment the graph with additional edges representing potential new fiber optic cables such that an additional edge is added between any pair of adjacent vertices directly connected by an edge corresponding to one of the existing fiber optic cables, the additional edge having a cost corresponding to the cost of laying the new fiber optic cable; and determine a minimum cost path in the graph from the source vertex to the destination vertex, wherein the vertex u is in the minimum cost path, and wherein an edge from the vertex u in the minimum cost path introduces an additional capital expenditure cost that is dependent on how the minimum cost path traverses from the source vertex to the vertex u.
-
Specification