摘要:
A method and system for determining location and value of dispersion compensating modules (DCMs) in an optical network is provided. The method comprises evaluating possible DCM values and locations and successively adding selected combinations to the network until the dispersion limits of the network are met. This systematic method is applicable to a variety of network topologies. In one embodiment, the method for determining the location and value of the DCMs uses the amount of compensated effective dispersion over all lightpaths that pass through the DCM to select the combinations. In another embodiment, the method is repeated a number of times with different selections of DCM value and location combinations, and the method providing the least number of DCMs and the lowest DCM values is chosen.
摘要:
A real-time network-analysis system comprises a network appliance and a plurality of management devices. The network appliance continuously monitors an object network and synthesizes a current network image comprising contemporaneous indicators of connectivity, occupancy, and performance of the object network. A management-client device may gain access to the network image for timely control and for use in producing long-term network-evolution plans. To enable the creation of a real-time network image, optimized topology synthesis algorithms are devised to minimize the computational effort. The real-time network-analysis system is adapted for use with an object network employing a variety of routing protocols, such as link-state protocols, and network-management protocols, such as the Simple-Network-Management protocol.
摘要:
A real-time network-analysis system comprises a network appliance and a plurality of management devices. The network appliance continuously monitors an object network and synthesizes a current network image comprising contemporaneous indicators of connectivity, occupancy, and performance of the object network. A management-client device may gain access to the network image for timely control and for use in producing long-term network-evolution plans. To enable the creation of a real-time network image, optimized topology synthesis algorithms are devised to minimize the computational effort. The real-time network-analysis system is adapted for use with an object network employing a variety of routing protocols, such as link-state protocols, and network-management protocols, such as the Simple-Network-Management protocol.
摘要:
Methods, systems, computer readable media are provided which facilitate the selection of multiple paths through a network represented by a network topology which take into account shared risk which may exist between network resources. The method involves identifying a first path through the network topology from a source node to a destination node, the first path comprising a first sequence of network resources. For at least one shared risk group, a determination is made if any of the at least one shared risk group includes any of the first sequence of network resources, a shared risk group being a group of network resources within the network topology which have a shared risk. A topology transformation is performed of the network topology into a virtual topology which discourages the use of network resources in any shared risk group determined. A second path through the virtual topology is identified from the source node to the destination. The method may be adapted to encourage node and/or edge disjointness.
摘要:
A real-time network-analysis system comprises a network appliance and a plurality of management devices. The network appliance continuously monitors an object network and synthesizes a current network image comprising contemporaneous indicators of connectivity, occupancy, and performance of the object network. A management-client device may gain access to the network image for timely control and for use in producing long-term network-evolution plans. To enable the creation of a real-time network image, optimized topology synthesis algorithms are devised to minimize the computational effort. The real-time network-analysis system is adapted for use with an object network employing a variety of routing protocols, such as link-state protocols, and network-management protocols, such as the Simple-Network-Management protocol.
摘要:
A real-time network-analysis system comprises a network appliance and a plurality of management devices. The network appliance continuously monitors an object network and synthesizes a current network image comprising contemporaneous indicators of connectivity, occupancy, and performance of the object network. A management-client device may gain access to the network image for timely control and for use in producing long-term network-evolution plans. To enable the creation of a real-time network image, optimized topology synthesis algorithms are devised to minimize the computational effort. The real-time network-analysis system is adapted for use with an object network employing a variety of routing protocols, such as link-state protocols, and network-management protocols, such as the Simple-Network-Management protocol.
摘要:
A method for selecting two maximally disjoint shortest paths between a source node and destination node in a network is provided. The method comprises determining a first explicit route between the source and destination nodes by using an original link cost for each link in the network, transforming the network by introducing conditional link costs, determining a second explicit route between the source and destination nodes in the transformed network taking into account the conditional link costs, and determining the two maximally disjoint shortest paths between the source and destination nodes by coalescing the first and second explicit routes. Beneficially, the step of introducing conditional link costs comprises adding additional parameters to links in the network and determining the conditional link costs depending on the position of each link relative to the first explicit route. Corresponding method for determining “N” maximally disjoint paths in a network, wherein “N” is equal or greater than two, is also provided.