Segment protection

Last updated April 27, 2024

Segment protection is a type of backup technique that can be used in most networks. It can be implemented as a dedicated backup or as a shared backup protection. Overlapping segments and non-overlapping segments are allowed; each providing different advantages.

Technique

Terms

Working path Working path segment protection.gif — Working path

Segment alpha

Segment beta

Overlapped link

Overlapping protection

Non-overlapping protection

Working path - is the chosen route from source to destination.
Segment protection path - is the working path where the broken segment is using the protected path.
Primary segment - is a segment of the working path.
Protected segment - is the backup path of one segment.
End-to-end protection - is the protection of one segment where is source and destination are also the end points of the backup protection.

^[1]

Examples

In "Working path" animation on the right it can be seen that for a chosen route the primary path becomes the working path. This example illustrates that the source (node A) is routed to B,then C,D,E, and lastly the destination (node F). We can see that segment protection has been implemented. Segment $Alpha$ consists of nodes A, B, C, and D while segment $Beta$ consists of nodes C, D, E, and F. Lets assume that link B-C failed. Nodes B and C know that the link between them is down so they signal to their neighboring nodes that a link is down and to move to a backup path. Node A sends its traffic over to node D directly. Node D then sends the traffic over its route to E then finally destination F.

Note: in this case the segment protection path for segment $Alpha$ does not contain any intermediate nodes; this is usually not the case, but the example would follow respectively.

Overlapping vs. non-overlapping

Overlapping and non-overlapping segment protection have one main difference but provide different protections at different costs.^[2] The diagrams to the right, "overlapping protection" and "non-overlapping protection" illustrate the difference between the two. The overlapping scheme makes sure that there is at least one link that is protected by two segments, while the non-overlapping scheme begins a segment protection at the same node as the previous ended. Node protection is the main advantage of the overlapping scheme over the non-overlapping scheme.

Node protection that is provided allows a path to be provisioned if a node goes offline. In the diagram, "Overlapped link", we can see that link C-D has protection from segment $Alpha$ and segment $Beta$ . This type of protection allows node C to fail and for the backup of segment $Alpha$ to be used. The path would then be node A to D to E to F. This would work the same if node D failed. The corresponding path to that failure would be node A to B to C to F.

Non-overlapping segment protection does not provide node protection at every node. This scheme is only able to recover from a node failure that is not at the segment end node. In the diagram, "Non-overlapping protection", if node D fails a path cannot be provisioned from node A, the source, to node F, the Destination. Non-overlapping segment protection is a more cost efficient solution because only the end node of every segment requires to have extra ports. In the long term it is more cost efficient to implement overlapping segment protection because the a provisioned circuit's availability would be much higher.

Backup variations

Dedicated segment protection and shared segment protection are both available for use. Shared segment protection allows a more efficient network to be deployed. Both of these schemes can be implemented on an overlapping and a non-overlapping network topology. The "working path" diagram illustrates the dedicated-overlapping segment protection.

"Shared segment protection", on the right, illustrated a shared-non-overlapping segment protection. Working paths, A and B, both have segment protection. The first segment protection path consists of, node A to B to C to D and the second consists of, node D to E to F. In this example we can see that if part of working path A, node D to F, would fail that node D would use its shred segment protection for that segment. The new path for working path A would be, A to D to E to F. Of course, if a second failure occurred on the same segment before the first failure is fixed a recovery would not be possible.^[2]

Shared segment protection provides a higher efficiency. Although the networks provided here as examples are simple the benefits of sharing are noticeable. In the previous example we can see that a new backup segment protection is not necessary for each working path. When this scheme is scaled to a large network a substantial cost improvement can be seen.

Implementation

This protection scheme can be implemented in most mesh networks. Of course, the larger the network the more possibilities are available. Determining the working path is found by the routing algorithm. We are not limited to any one particular algorithm, but we must make modifications to allow for segments to be created with a protection path for each segment.

Another important parameter is the number of hops or distance that each segment should have to have an optimal network. Although there is no secret number that would work for any network, there have been studies which show their experiment results.^[3]

Algorithms

Generalized Segment Protection "The algorithm works as follows: K working paths are selected based on a predetermined criterion (shortest path, minimum unavailability, shortest hop count, etc.). Upon selecting the K-paths, for each working path, the links along the working path are reversed. The cost of every link that has at least one spare channel is degraded by a negligible coefficient ε. Each link that originates out of the working path but ends on the working path is modified so that its end point is moved to the previous node on the working path. Finally a path from source to destination is selected. Upon obtaining the path, the modified links are restored, and the connection is provisioned with the corresponding backup segments"^[2]^[4]^[5]

External papers

Cascaded Diverse Routing^[6] see more
Iterative Two-Step-Approach^[6] see more

Related Research Articles

In graph theory, the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum of the weights of its constituent edges is minimized.

<span class="mw-page-title-main">Dijkstra's algorithm</span> Graph search algorithm

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.

A wireless mesh network (WMN) is a communications network made up of radio nodes organized in a mesh topology. It can also be a form of wireless ad hoc network.

<span class="mw-page-title-main">Mesh networking</span> Network with multiple links between nodes

A mesh network is a local area network topology in which the infrastructure nodes connect directly, dynamically and non-hierarchically to as many other nodes as possible and cooperate with one another to efficiently route data to and from clients.

The routing and wavelength assignment (RWA) problem is an optical networking problem with the goal of maximizing the number of optical connections.

Pathfinding or pathing is the plotting, by a computer application, of the shortest route between two points. It is a more practical variant on solving mazes. This field of research is based heavily on Dijkstra's algorithm for finding the shortest path on a weighted graph.

In computer networking, linear network coding is a program in which intermediate nodes transmit data from source nodes to sink nodes by means of linear combinations.

The multi-commodity flow problem is a network flow problem with multiple commodities between different source and sink nodes.

MPLS Fast Reroute is a local restoration network resiliency mechanism. It is actually a feature of resource reservation protocol (RSVP) traffic engineering (RSVP-TE). In MPLS local protection each label-switched path (LSP) passing through a facility is protected by a backup path which originates at the node immediately upstream to that facility.

Cooperative diversity is a cooperative multiple antenna technique for improving or maximising total network channel capacities for any given set of bandwidths which exploits user diversity by decoding the combined signal of the relayed signal and the direct signal in wireless multihop networks. A conventional single hop system uses direct transmission where a receiver decodes the information only based on the direct signal while regarding the relayed signal as interference, whereas the cooperative diversity considers the other signal as contribution. That is, cooperative diversity decodes the information from the combination of two signals. Hence, it can be seen that cooperative diversity is an antenna diversity that uses distributed antennas belonging to each node in a wireless network. Note that user cooperation is another definition of cooperative diversity. User cooperation considers an additional fact that each user relays the other user's signal while cooperative diversity can be also achieved by multi-hop relay networking systems.

In telecommunications, subnetwork connection protection (SNCP), is a type of protection mechanism associated with synchronous optical networks such as synchronous digital hierarchy (SDH).

An optical mesh network is a type of optical telecommunications network employing wired fiber-optic communication or wireless free-space optical communication in a mesh network architecture.

In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length. The algorithm was conceived by John W. Suurballe and published in 1974. The main idea of Suurballe's algorithm is to use Dijkstra's algorithm to find one path, to modify the weights of the graph edges, and then to run Dijkstra's algorithm a second time. The output of the algorithm is formed by combining these two paths, discarding edges that are traversed in opposite directions by the paths, and using the remaining edges to form the two paths to return as the output. The modification to the weights is similar to the weight modification in Johnson's algorithm, and preserves the non-negativity of the weights while allowing the second instance of Dijkstra's algorithm to find the correct second path.

In graph theory, Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost. The algorithm was published by Jin Y. Yen in 1971 and employs any shortest path algorithm to find the best path, then proceeds to find K − 1 deviations of the best path.

Shared risk resource group is a concept in optical mesh network routing that different networks may suffer from a common failure if they share a common risk or a common SRG. SRG is not limited to Optical mesh networks: SRGs are also used in MPLS, IP networks, and synchronous optical networks.

A multicast session requires a "point-to-multipoint" connection from a source node to multiple destination nodes. The source node is known as the root. The destination nodes are known as leaves. In the modern era, it is important to protect multicast connections in an optical mesh network. Recently, multicast applications have gained popularity as they are important to protecting critical sessions against failures such as fiber cuts, hardware faults, and natural disasters.

Link protection is designed to safeguard networks from failure. Failures in high-speed networks have always been a concern of utmost importance. A single fiber cut can lead to heavy losses of traffic and protection-switching techniques have been used as the key source to ensure survivability in networks. Survivability can be addressed in many layers in a network and protection can be performed at the physical layer, Layer 2 and Layer 3 (IP).

Path protection in telecommunications is an end-to-end protection scheme used in connection oriented circuits in different network architectures to protect against inevitable failures on service providers’ network that might affect the services offered to end customers. Any failure occurred at any point along the path of a circuit will cause the end nodes to move/pick the traffic to/from a new route. Finding paths with protection, especially in elastic optical networks, was considered a difficult problem, but an efficient and optimal algorithm was proposed.

The p-Cycle protection scheme is a technique to protect a mesh network from a failure of a link, with the benefits of ring like recovery speed and mesh-like capacity efficiency, similar to that of a shared backup path protection (SBPP). p-Cycle protection was invented in late 1990s, with research and development done mostly by Wayne D. Grover, and D. Stamatelakis.

Fast automatic restoration (FASTAR) is an automated fast response system developed and deployed by American Telephone & Telegraph (AT&T) in 1992 for the centralized restoration of its digital transport network. FASTAR automatically reroutes circuits over a spare protection capacity when a fiber-optic cable failure is detected, hence increasing service availability and reducing the impact of the outages in the network. Similar in operation is real-time restoration (RTR), developed and deployed by MCI and used in the MCI network to minimize the effects of a fiber cut.

References

↑ Saradhi, C.V.; Murthy, C.S.R.; , "Segmented protection paths in WDM mesh networks," High Performance Switching and Routing, 2003, HPSR. Workshop on , vol., no., pp. 311- 316, 24–27 June 2003 doi: 10.1109/HPSR.2003.1226724
1 2 3 Kantarci, B.; Mouftah, H.T.; Oktug, S.; , "Availability analysis and Connection provisioning in overlapping shared segment protection for optical networks," Computer and Information Sciences, 2008. ISCIS '08. 23rd International Symposium on , vol., no., pp.1-6, 27-29 Oct. 2008 doi: 10.1109/ISCIS.2008.4717963
↑ Tewari, R.; Ramamurthy, B.; , "Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks," Advanced Networks and Telecommunication Systems (ANTS), 2009 IEEE 3rd International Symposium on , vol., no., pp.1-3, 14-16 Dec. 2009 doi: 10.1109/ANTS.2009.5409857
↑ C. Ou, S. Rai, and B. Mukherjee, “Extension of segment protection for bandwidth efficiency and differentiated quality of protection in optical/mpls networks,”Optical Switching and Networking, vol. 1, pp.19–33, January 2005.
↑ Tornatore. M, Carcagni. Matteo, Mukherjee. Biswanath Ou. Canhui, and Pattavina. Achille, “Efficient shared-segment protection exploiting the knowledge of connection holding time,” in Global Telecommunications Conference (GLOBECOM). IEEE, 2006, pp. 1–5.
1 2 Pin-Han Ho; Mouftah, H.T.; , "Allocation of protection domains in dynamic WDM mesh networks," Network Protocols, 2002. Proceedings. 10th IEEE International Conference on , vol., no., pp. 188- 189, 12-15 Nov. 2002 doi: 10.1109/ICNP.2002.1181400

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[Saradhi-1] Saradhi, C.V.; Murthy, C.S.R.; , "Segmented protection paths in WDM mesh networks," High Performance Switching and Routing, 2003, HPSR. Workshop on , vol., no., pp. 311- 316, 24–27 June 2003 doi: 10.1109/HPSR.2003.1226724

[Burak-2] 1 2 3 Kantarci, B.; Mouftah, H.T.; Oktug, S.; , "Availability analysis and Connection provisioning in overlapping shared segment protection for optical networks," Computer and Information Sciences, 2008. ISCIS '08. 23rd International Symposium on , vol., no., pp.1-6, 27-29 Oct. 2008 doi: 10.1109/ISCIS.2008.4717963

[Tewari-3] Tewari, R.; Ramamurthy, B.; , "Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks," Advanced Networks and Telecommunication Systems (ANTS), 2009 IEEE 3rd International Symposium on , vol., no., pp.1-3, 14-16 Dec. 2009 doi: 10.1109/ANTS.2009.5409857

[Ou-4] C. Ou, S. Rai, and B. Mukherjee, “Extension of segment protection for bandwidth efficiency and differentiated quality of protection in optical/mpls networks,”Optical Switching and Networking, vol. 1, pp.19–33, January 2005.

[Tornatore-5] Tornatore. M, Carcagni. Matteo, Mukherjee. Biswanath Ou. Canhui, and Pattavina. Achille, “Efficient shared-segment protection exploiting the knowledge of connection holding time,” in Global Telecommunications Conference (GLOBECOM). IEEE, 2006, pp. 1–5.

[Pin-Han-6] 1 2 Pin-Han Ho; Mouftah, H.T.; , "Allocation of protection domains in dynamic WDM mesh networks," Network Protocols, 2002. Proceedings. 10th IEEE International Conference on , vol., no., pp. 188- 189, 12-15 Nov. 2002 doi: 10.1109/ICNP.2002.1181400

[1]

[2]

[3]

[4]

[5]

[6]