Abstract: An illustrative method of estimating a temperature for at least one of a plurality of sites based on temperature information from at least one of a plurality of temperature measurement stations includes several steps. The sites are clustered into a plurality of clusters. Respective centroids for the clusters are determined. The centroids are associated with respective measurement stations. One of a preselected plurality of estimating techniques is respectively assigned to the measurement stations. The assigned estimating technique provides a temperature estimate at the measurement station that is more accurate than others of the preselected plurality of estimating techniques. A temperature at the at least one of the plurality of sites is estimated using the estimating technique assigned to the measurement station associated with the centroid of the cluster that includes the site of interest.

Abstract: The present disclosure generally discloses a cross-layer link discovery capability configured to support discovery of cross-layer links of a communication network. The cross-layer link discovery capability may be configured to support discovery of cross-layer links between packet network elements and optical network elements of a communication network. The cross-layer link discovery capability may be configured to support automated and reliable discovery of cross-layer links between ports of packet network elements and ports of optical network elements of a communication network. The cross-layer link discovery capability may be configured to support discovery of cross-layer links between ports of packet network elements and ports of optical network elements based on various port matching techniques, such as port classification, port isolation based on port identification, port isolation based on port probing (e.g.

Abstract: The present disclosure generally discloses a cross-layer link discovery capability configured to support discovery of cross-layer links of a communication network. The cross-layer link discovery capability may be configured to support discovery of cross-layer links between packet network elements and optical network elements of a communication network. The cross-layer link discovery capability may be configured to support automated and reliable discovery of cross-layer links between ports of packet network elements and ports of optical network elements of a communication network. The cross-layer link discovery capability may be configured to support discovery of cross-layer links between ports of packet network elements and ports of optical network elements based on various port matching techniques, such as port classification, port isolation based on port identification, port isolation based on port probing (e.g.

Abstract: This disclosure generally discloses a path search mechanism for determining mutually compatible paths within a network includes nodes and links. The path search mechanism for determining mutually compatible paths may be configured to determine a set of mutually compatible paths for a set of demands where the demands may include requests for paths between pairs of nodes of the network. The path search mechanism for determining mutually compatible paths may be configured to determine a set of mutually compatible paths for a set of demands where compatibility may be based on edge disjointness, node disjointness, or the like, as well as various combinations thereof. The path search mechanism for determining mutually compatible paths may be configured to determine a set of mutually compatible paths for a set of demands subject to an objective.

Abstract: This disclosure generally discloses a path search mechanism for determining mutually compatible paths within a network includes nodes and links. The path search mechanism for determining mutually compatible paths may be configured to determine a set of mutually compatible paths for a set of demands where the demands may include requests for paths between pairs of nodes of the network. The path search mechanism for determining mutually compatible paths may be configured to determine a set of mutually compatible paths for a set of demands where compatibility may be based on edge disjointness, node disjointness, or the like, as well as various combinations thereof. The path search mechanism for determining mutually compatible paths may be configured to determine a set of mutually compatible paths for a set of demands subject to an objective.

Abstract: An illustrative method of evaluating a condition of a plurality of transformers that are located remotely from each other, includes: obtaining an ambient temperature for respective sites of the transformers at a plurality of times during a period; determining respective loading at the transformers at the plurality of times; and determining respective aging rates of the transformers during the period based on the respective ambient temperatures and loadings.

Abstract: An illustrative method of estimating a temperature for at least one of a plurality of sites based on temperature information from at least one of a plurality of temperature measurement stations includes several steps. The sites are clustered into a plurality of clusters. Respective centroids for the clusters are determined. The centroids are associated with respective measurement stations. One of a preselected plurality of estimating techniques is respectively assigned to the measurement stations. The assigned estimating technique provides a temperature estimate at the measurement station that is more accurate than others of the preselected plurality of estimating techniques. A temperature at the at least one of the plurality of sites is estimated using the estimating technique assigned to the measurement station associated with the centroid of the cluster that includes the site of interest.

Abstract: An illustrative method of evaluating a condition of a plurality of transformers that are located remotely from each other, includes: obtaining an ambient temperature for respective sites of the transformers at a plurality of times during a period; determining respective loading at the transformers at the plurality of times; and determining respective aging rates of the transformers during the period based on the respective ambient temperatures and loadings.

Abstract: A method and system for efficiently provisioning a multiple service, multiple layer mesh network in a manner enabling restoration from multiple failures.

Abstract: A method and system for identifying and, optionally, managing protection resource sharing opportunities, such as within a large-scale wavelength-division multiplexing (WDM) mesh network.

Abstract: The invention comprises a method and apparatus that prevents the activation of a congestion controlling process that would otherwise be activated in response any packet loss condition. The congestion controlling process is inhibited when a congestion parameter associated indicates that the packet loss condition is not caused by congestion.

Abstract: The invention comprises a method and apparatus for determining a network connectivity in a network having a plurality of nodes. In particular, one embodiment of the method includes generating a candidate link for each of a plurality of node pairs, predicting a performance of each candidate link by evaluating an expected impact of at least one condition on each candidate link, and determining the network topology using the predicted performances of the candidate links. The performance of each candidate link may be predicted by identifying at least one condition, determining the expected impact of the at least one condition on the candidate link, and predicting the performance of the candidate link by adjusting an expected performance of the candidate link using the expected impact of the at least one condition on the candidate link.

Abstract: A restoration path planner that minimizes the worst-case number of cross-connections that must be performed in a network in the event of a single element failure involves a two-phase optimization. The first phase involves finding two node-disjoint paths for each service demand within a network such that the maximum link bandwidth in the network is minimized and the link bandwidths within the network are leveled. The second phase involves identifying the primary and restoration paths for each service demand within the network such that the worst-case number of cross-connections at any node within the network is minimized across all possible single-event failures. Embodiments also consider service demand-bundling that groups service demands with the same source-destination node pairs and routes them along identical primary and restoration paths, and banding, which consolidates multiple low-rate demands into a high-rate demand and consequently decreases cross-connections required in the event of a failure.

Abstract: A restoration path planner minimizes cost while meeting restoration-time constraints of a network by reducing the worst-case number of cross-connections that must be performed in a network in the event of a single element failure. The planner involves optimization that identifies primary and restoration path plans for demands within the network such that the worst-case number of cross-connections at any node within the network is minimal and/or bounded. Embodiments further constrain the cost of the path plan. In one embodiment, restoration time is bounded and cost is relaxed until a solution is found. In another embodiment, the restoration time bound is relaxed to a limit while path plans and their costs are stored. These plans can later be chosen amongst for the desired balance of cost and restoration time. At least one approach to minimization of network cost involves maximizing sharing within restoration path plans.

Abstract: A method and system for identifying and, optionally, managing protection resource sharing opportunities, such as within a large-scale wavelength-division multiplexing (WDM) mesh network.

Abstract: A method and system for efficiently provisioning a multiple service, multiple layer mesh network in a manner enabling restoration from multiple failures.

Abstract: A joint “packet-optical” layer restoration mechanism protects against single, packet-layer router failures by managing network resources from both the packet layer and the optical transport layer in a synergistic manner. It reuses packet-layer router service-ports and/or transport-layer service wavelengths associated with optical switch-ports instead of reserving additional standby packet-layer router service-ports. It can reuse resources from primary paths that are unaffected by router failures and paths that exist for link-failure protection at the optical layer. Embodiments feature a modified node structure that includes both an IP router and a dynamically reconfigurable OXC, which dynamically establishes connectivity between IP-router ports and transport-layer optical fibers. The joint-layer router provides fine-granularity grooming at the IP layer and full-fledged wavelength networking via dynamic wavelength switching and/or wavelength translation at the optical layer.

Abstract: A restoration path planner minimizes cost while meeting restoration-time constraints of a network by reducing the worst-case number of cross-connections that must be performed in a network in the event of a single element failure. The planner involves optimization that identifies primary and restoration path plans for demands within the network such that the worst-case number of cross-connections at any node within the network is minimal and/or bounded. Embodiments further constrain the cost of the path plan. In one embodiment, restoration time is bounded and cost is relaxed until a solution is found. In another embodiment, the restoration time bound is relaxed to a limit while path plans and their costs are stored. These plans can later be chosen amongst for the desired balance of cost and restoration time. At least one approach to minimization of network cost involves maximizing sharing within restoration path plans.

Abstract: A restoration path planner that minimizes the worst-case number of cross-connections that must be performed in a network in the event of a single element failure involves a two-phase optimization. The first phase involves finding two node-disjoint paths for each service demand within a network such that the maximum link bandwidth in the network is minimized and the link bandwidths within the network are leveled. The second phase involves identifying the primary and restoration paths for each service demand within the network such that the worst-case number of cross-connections at any node within the network is minimized across all possible single-event failures. Embodiments also consider service demand-bundling that groups service demands with the same source-destination node pairs and routes them along identical primary and restoration paths, and banding, which consolidates multiple low-rate demands into a high-rate demand and consequently decreases cross-connections required in the event of a failure.