At&t Intellectual Property I, L.p.

Orlando Echeverria-Calvet

Jian Li

Canhui Ou

Steven Gemelos

Howard Scott Mountford

Jerold Osato

Brent Edward Jacobson

Thomas Cronin

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.

System and method of determining minimum cost path

A distributed network including at least two Reconfigurable Optical Add/Drop Multiplexers (ROADMs) may be designed by a method including simulating routing of data traffic in a distributed network. The method may also include identifying a first location for placement of a first ROADM based at least partially on the simulated routing of the data traffic. The method may also include simulating rerouting of data traffic in the distributed network including the first ROADM at the first location. The method may further include identifying a second location for placement of a second ROADM based at least partially on the simulated rerouting of the data traffic.

Methods of placing reconfigurable optical add/drop multiplexers (ROADMS) in a network

Growing community of inventors

San Ramon, CA, United States of America

Orlando Echeverria-Calvet