A Fast Re-Route Method

Rosenberg, Eric S.; Uttaro, Jim

doi:10.1109/lcomm.2013.070113.130921

Cited by 5 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Totally stub areas can't contain area border routers of autonomous systems. In a totally stub area, all the external and inter-area routes are blocked, that is, the routing table of the routers, located inside a totally stub area, contains only intraarea routes and a default route to the area border router [14]. The comparison of the processes of dissemination of the topology information in a totally stub area and a standard area is shown in Figure 5.…”

Section: Configuring Totally Stub Areasmentioning

confidence: 99%

The Development of the Routing Pattern of the Backbone Data Transmission Network for the Automation of the Krasnoyarsk Railway

Makarov¹,

Abdulnazarov²,

Anarbekov³

2016

ijacsa

View full text Add to dashboard Cite

Abstract-The paper deals with the data transmission network of the Krasnoyarsk Railway, its structure, the topology of data transmission and the routing protocol, which supports its operation, as well as the specifics of data transmission networking. The combination of the railway automation applications and the data transmission network make up the automation systems, making it possible to improve performance, increase the freight traffic volume, and improve the quality of passenger service. The objective of this paper is to study the existing data transmission network of the Krasnoyarsk Railway and to develop ways of its modernization, in order to improve the reliability of the network and the automated systems that use this network. It was found that the IS-IS and OSPF routing protocols have many differences, primarily due to the fact that the IS-IS protocol does not use IP addresses as paths. On the one hand, it makes it possible to use the IS-IS protocol for the operation in IPv6 networks, whereas OSPF version 2 doesn't provide this opportunity; therefore, OSPF version 3 was developed to solve this problem. However, on the other hand, in case of using IPv4, the routing configuration by means of the IS-IS protocol will imply the need to study a significant volume of information and use unusual methods of routing configuration.

show abstract

Section: Configuring Totally Stub Areasmentioning

confidence: 99%

The Development of the Routing Pattern of the Backbone Data Transmission Network for the Automation of the Krasnoyarsk Railway

Makarov¹,

Abdulnazarov²,

Anarbekov³

2016

ijacsa

View full text Add to dashboard Cite

show abstract

“…The most commonly used method to handle these kind of link failures is based on the fast re-route (FRR) methodology [10]: re-transmit the data packet locally while ensuring reachability. For example, the loopfree alternative (LFA) [11] and remote LFA (rLFA) [12] methods guide the entrance router of the failed link to re-direct the data packet to a neighbor or remote node that meets specific requirements; in the works [13], [14], additional elaborate tags are required to be added into the packet header to guide the reroute path. The major drawback of the FRR-based methods is that they can only ensure the reachability of the new route but cannot guarantee the performance, which is not preferred in the WAMS scenario with stringent QoS requirements.…”

Section: Introductionmentioning

confidence: 99%

Dataplane-Based Fast Failover in SDN-Enabled Wide Area Measurement System of Smart Grid

Duan

Dinavahi

2023

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

In the wide area measurement system (WAMS) of smart grid, the real-time monitoring and protection applications have stringent requirements for the end-to-end transmission delays between PMUs and PDC, and fast failover is required to ensure the communication performance after link failures. In this work, the software-defined network (SDN) technology is utilized to enable datapath failover upon a link failure with a global view of the communication network. Then, a novel dataplane based fast failover (DFF) mechanism is proposed to directly re-route the data packet in dataplane without interacting with the SDN controller. Based on the mathematical analysis over the WAMS topology features, the proposed DFF optimizes two procedures of failover: backup path construction, and backup path installation. Using the proposed backup path construction algorithms, the 3-approximate and (1+2ε)-approximate (0 < ε < 1) backup paths can be constructed, theoretically guaranteeing the data transmission delays both during and after failover. Using the proposed LinkID-based FF group table installation method, the conflict of forwarding rules between original and backup paths can be eliminated, while the storage cost is also optimized. The simulation results on six IEEE benchmark test power systems show that the proposed DFF mechanism could achieve lower data transmission delays during and after failover compared to the existing control plane based and dataplane based failover mechanisms.

show abstract

“…However, such a qualified neighbor does not always exist, and thus several extensions of LFA have been proposed such as the remote LFA [5] and recursive LFA [6]. Another kind of FRR method popular in research is to add some tags into the packet header to carry the path information and guide the re-route path selection, as proposed in [7], [8]. The main goal of the above FRR based methods is to quickly find a feasible path to the destination, but cannot guarantee the performance of the new route, which is not suitable for the WAMS scenario with stringent transmission latency requirements.…”

Section: Introductionmentioning

confidence: 99%

Fast Path Recovery for Single Link Failure in SDN-Enabled Wide Area Measurement System

Duan

Dinavahi

2022

IEEE Trans. Smart Grid

View full text Add to dashboard Cite

In the wide area measurement system (WAMS), the end-to-end transmission delay between the phasor measurement unit (PMU) and phasor data concentrator (PDC) is strictly constrained for real-time monitoring and protection applications. When a communication link failure happens, fast path recovery is required to reduce the impact of measurement losses. In this work, the promising software-defined network (SDN) technique is leveraged to compute the re-routing path in a global view upon a single link failure. More specifically, a hybrid fast path recovery algorithm (HFPR-A) is proposed based on the principle of simplicity: in some cases, the shortest path or approximate shortest path between PMU and PDC can be recovered by adding only one edge to the original forwarding tree; while in the other cases, the shortest paths can be recovered with lower computational complexity than the traditional Dijkstra's algorithm. The proposed HFPR-A is implemented on the Ryu + Mininet testbed, and the simulation results on different IEEE benchmark test power systems show that the proposed HFPR-A could find shorter re-routing paths than the existing methods with a low-enough response time.

show abstract

A Fast Re-Route Method

Cited by 5 publications

References 5 publications

The Development of the Routing Pattern of the Backbone Data Transmission Network for the Automation of the Krasnoyarsk Railway

The Development of the Routing Pattern of the Backbone Data Transmission Network for the Automation of the Krasnoyarsk Railway

Dataplane-Based Fast Failover in SDN-Enabled Wide Area Measurement System of Smart Grid

Fast Path Recovery for Single Link Failure in SDN-Enabled Wide Area Measurement System

Contact Info

Product

Resources

About