Abstract: A method of reconfiguring a multi-wavelength communication network. The transition includes determining the union of the old and new topologies. During at least the start of the transition, the network supports the union topology. New connections are connected according to the new topology, and the old topology, as its connections expire, is gradually removed. In allocating wavelengths to a new topology, two algorithms are developed which assign wavelengths which do not color clash with the wavelength assignments of the old topology.

Abstract: A method for selecting the most cost-efficient configuration for backbone links in a distributed data network is disclosed. The method identifies candidate links between pairs of backbone nodes, evaluates the effect on the network of adding each candidate link to the network, and adds to the network those candidate links which produce a cost savings in the network. The method also routes data through the backbone to minimize transmission delays, and eliminates redundant lines from underutilized links, and removes from the network those links whose removal reduces the cost of the backbone.

Abstract: A method to produce near-optimal routes for the flow of data between clusters in a distributed data communications network. A backbone traffic matrix and a backbone topology at the cluster level are used to produce minimum hop routes, minimum delay routes, or routes which maximize throughput. The inputs of the system are the number of requirements, the number of backbone links, and the number of backbone nodes.