Demonstration of single link failure recovery using Bellman Ford and Dijikstra algorithm in SDN

Waleed, Syed; Faizan, Muhammad; Iqbal, Maheen; Anis, M.

doi:10.1109/icieect.2017.7916533

Cited by 20 publications

(8 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• In the work of Waleed et al, 16 the Dijkstra Algorithm is more efficient in calculating a path, compared to the Bellman Ford Algorithm. Hence, when computing a route whose source and destination are src and dst in a packet, Dijkstra Algorithm is applied in this section.…”

Section: Hyperflow Controllermentioning

confidence: 99%

See 1 more Smart Citation

Modeling and verifying SDN under Multi‐controller architectures using CSP

Xiao

Zhu

Xiang

et al. 2019

Concurrency and Computation

View full text Add to dashboard Cite

Software Defined Networking (SDN) with multiple controllers draws more attention for the increasing scale of the network. Multi-controller architectures can handle what SDN with single controller is not able to address. In order to understand what these architectures can accomplish and face precisely, we analyze them with formal methods. In this paper, we apply Communicating Sequential Processes (CSP) to model the routing service of SDN under multi-controller architectures, in particular the HyperFlow architecture and the Kandoo architecture based on OpenFlow protocol. By using model checker Process Analysis Toolkit (PAT), we verify that the models satisfy three properties, namely deadlock freeness, consistency, and fault tolerance. In addition, for studying the security of those models, some extension is added. We find that the extended models are capable of coping with Denial of Service and may suffer from Information Disclosure. Moreover, a fake path and a tampered message could be present in SDN.

show abstract

Section: Hyperflow Controllermentioning

confidence: 99%

“…Otherwise, the port's value will be shown by the application of the function getNext and the another situation is described in formula (16).…”

Section: Controllerprocessormentioning

confidence: 99%

Modeling and verifying SDN under Multi‐controller architectures using CSP

Xiao

Zhu

Xiang

et al. 2019

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…To reduce the number of messages between the controller and switches, Zhang et al aggregated the affected flows to a single flow with a new label and then calculated the restoration paths to recover the network. Waleed et al, used Bellman Ford and Dijkstra algorithms to restore the network from a link failure. The presented model provided a shortest path with reducing delay and offered more efficient bandwidth through redundant links.…”

Section: Related Workmentioning

confidence: 99%

CFR: A cooperative link failure recovery scheme in software‐defined networks

Wang

Yao

et al. 2018

Int J Communication

View full text Add to dashboard Cite

Summary Software‐defined networking that separates the control plane from the data plane is envisioned as a promising technology to enable resilient and flexible network management. Tolerating link failures is a fundamental problem in enhancing such network resilience in software‐defined networking. Reactive and proactive fault tolerant schemes for conventional networks may not well balance the fault recovery time and network performance, since the proactive scheme typically underutilizes resources and the reactive scheme usually incurs a longer recovery time. In this paper, we propose a cooperative link failure recovery scheme to find a fine‐grained trade‐off between resource utilization and recovery time by combining reactive and proactive methods. We formalize the problem of link failure recovery as a multiobjective optimization problem and devise a 2‐stage algorithm for it. The first stage of the algorithm guarantees connectivity restoration in an acceptable recovery interval based on fast failover feature supported in OpenFlow protocol, meanwhile it assigns virtual local area network tags to back up paths for achieving a lower memory consumption. The second stage of the algorithm guarantees the quality of service for different applications by adjusting the backup paths after rapid connectivity restoration. Extensive simulations highlight that cooperative link failure recovery scheme can satisfy both the carrier‐grade recovery requirements and quality of service requirements in terms of delay and network bandwidth.

show abstract

“…The physical distance is calculated by the distance vector (DV) routing parameters, such as number of hops using the Bellman-Ford algorithm, and the logical distance is determined using well-established methods, such as the link state (LS) cost-based link state routing using the Dijkstra algorithm and hybrid Bellman-Ford-Dijkstra algorithm [16]. These algorithms aid in the reduction of convergence delays for link failure recovery [17]. The status of normal, congested, abnormal, and so on can be determined by a comparison with previous traffic data.…”

Section: Inference Engine Using Threshold Tablementioning

confidence: 99%

Trusted Time-Based Verification Model for Automatic Man-in-the-Middle Attack Detection in Cybersecurity

Kang

Fahd²,

Venkatraman³

2018

Cryptography

View full text Add to dashboard Cite

Due to the prevalence and constantly increasing risk of cyber-attacks, new and evolving security mechanisms are required to protect information and networks and ensure the basic security principles of confidentiality, integrity, and availability—referred to as the CIA triad. While confidentiality and integrity can be achieved using Secure Sockets Layer (SSL)/Transport Layer Security (TLS) certificates, these depend on the correct authentication of servers, which could be compromised due to man-in-the-middle (MITM) attacks. Many existing solutions have practical limitations due to their operational complexity, deployment costs, as well as adversaries. We propose a novel scheme to detect MITM attacks with minimal intervention and workload to the network and systems. Our proposed model applies a novel inferencing scheme for detecting true anomalies in transmission time at a trusted time server (TTS) using time-based verification of sent and received messages. The key contribution of this paper is the ability to automatically detect MITM attacks with trusted verification of the transmission time using a learning-based inferencing algorithm. When used in conjunction with existing systems, such as intrusion detection systems (IDS), which require comprehensive configuration and network resource costs, it can provide a robust solution that addresses these practical limitations while saving costs by providing assurance.

show abstract

Demonstration of single link failure recovery using Bellman Ford and Dijikstra algorithm in SDN

Cited by 20 publications

References 6 publications

Modeling and verifying SDN under Multi‐controller architectures using CSP

Modeling and verifying SDN under Multi‐controller architectures using CSP

CFR: A cooperative link failure recovery scheme in software‐defined networks

Trusted Time-Based Verification Model for Automatic Man-in-the-Middle Attack Detection in Cybersecurity

Contact Info

Product

Resources

About