Abstract: In an automatically switched optical network operating according to a wavelength plan, the wavelengths are assigned to an optical path based on availability, performance and SRS wavelength coupling reduction. First, the wavelengths are grouped in static bins based on their reach versus cost performance, and each bin assumes a ?Q of a middle wavelength. Then, the bins are moved into subsets of dynamic bins, constructed using bin constraints that account for the particulars of the respective optical path. The path is characterized taking into account the wavelength currently accessing at the end nodes, and the wavelength tandeming through the end nodes. Wavelength selection starts with the bins that satisfy the maximum number of constraints, and the wavelengths are checked sequentially against wavelength constraints; relaxed constraints are also applied when it is not possible to exactly satisfy one or more constraints.

Abstract: In an automatically switched optical network operating according to a wavelength plan, the wavelengths are assigned to an optical path based on availability, performance and SRS wavelength coupling reduction. First, the wavelengths are grouped in static bins based on their reach versus cost performance, and each bin assumes a ?Q of a middle wavelength. Then, the bins are moved into subsets of dynamic bins, constructed using bin constraints that account for the particulars of the respective optical path. The path is characterized taking into account the wavelength currently accessing at the end nodes, and the wavelength tandeming through the end nodes. Wavelength selection starts with the bins that satisfy the maximum number of constraints, and the wavelengths are checked sequentially against wavelength constraints; relaxed constraints are also applied when it is not possible to exactly satisfy one or more constraints.

Abstract: In an automatically switched optical network operating according to a wavelength plan, the wavelengths are assigned to an optical path based on availability, performance and SRS wavelength coupling reduction. First, the wavelengths are grouped in static bins based on their reach versus cost performance, and each bin assumes a ?Q of a middle wavelength. Then, the bins are moved into subsets of dynamic bins, constructed using bin constraints that account for the particulars of the respective optical path. The path is characterized taking into account the wavelength currently accessing at the end nodes, and the wavelength tandeming through the end nodes. Wavelength selection starts with the bins that satisfy the maximum number of constraints, and the wavelengths are checked sequentially against wavelength constraints; relaxed constraints are also applied when it is not possible to exactly satisfy one or more constraints.

Abstract: In an automatically switched optical network operating according to a wavelength plan, the wavelengths are assigned to an optical path based on availability, performance and SRS wavelength coupling reduction. First, the wavelengths are grouped in static bins based on their reach versus cost performance, and each bin assumes a ?Q of a middle wavelength. Then, the bins are moved into subsets of dynamic bins, constructed using bin constraints that account for the particulars of the respective optical path. The path is characterized taking into account the wavelength currently accessing at the end nodes, and the wavelength tandeming through the end nodes. Wavelength selection starts with the bins that satisfy the maximum number of constraints, and the wavelengths are checked sequentially against wavelength constraints; relaxed constraints are also applied when it is not possible to exactly satisfy one or more constraints.

Abstract: In an automatically switched optical network operating according to a wavelength plan, the wavelengths are assigned to an optical path based on availability, performance and SRS wavelength coupling reduction. First, the wavelengths are grouped in static bins based on their reach versus cost performance, and each bin assumes a ?Q of a middle wavelength. Then, the bins are moved into subsets of dynamic bins, constructed using bin constraints that account for the particulars of the respective optical path. The path is characterized taking into account the wavelength currently accessing at the end nodes, and the wavelength tandeming through the end nodes. Wavelength selection starts with the bins that satisfy the maximum number of constraints, and the wavelengths are checked sequentially against wavelength constraints; relaxed constraints are also applied when it is not possible to exactly satisfy one or more constraints.

Abstract: An agile transparent network with a trail routing and switching (also called “engineering”) mechanism is provided that enables efficient use of regenerators and wavelengths available in the network, while maintaining a very efficient time-to-service. The trail engineering mechanism allows fast, automatic establishment of new connections based on the current network architecture, connectivity and loading and also on conditions in the connection request. Selection of regenerator sites and of the wavelengths used on each regenerator segment is performed with optimal use of current network resources, while ensuring that the quality of the selected trail is adequate for the respective call. The mechanism provides for both distance and performance balancing, and it optimizes the network response time.

Abstract: A connection between a source node and a destination node is automatically routed and switched in a WDM photonic network, on receipt of a connection request. A switching and routing mechanism selects a plurality of valid link paths using a path tree, where invalid branches are eliminated based on constraints received in the connection request, and on a link and path cost functions. A regenerator placement tree is used for determining a plurality of viable regenerator paths for each valid link path. On the regenerator placement tree, non-viable branches are eliminated based on constraints received with the request and on regenerator availability at the intermediate nodes along the respective path, and on the specification of these available regenerators. Next, the switching and routing mechanism assigns a set of wavelengths to each viable regenerator path, and estimates the performance of the path using a Q estimator.

Abstract: A connection between a source node and a destination node is automatically routed and switched in a WDM photonic network, on receipt of a connection request. A switching and routing mechanism selects a plurality of valid link paths using a path tree, where invalid branches are eliminated based on constraints received in the connection request, and on a link and path cost functions. A regenerator placement tree is used for determining a plurality of viable regenerator paths for each valid link path. On the regenerator placement tree, non-viable branches are eliminated based on constraints received with the request and on regenerator availability at the intermediate nodes along the respective path, and on the specification of these available regenerators. Next, the switching and routing mechanism assigns a set of wavelengths to each viable regenerator path, and estimates the performance of the path using a Q estimator.