Convergence time analysis of open shortest path first routing protocol in internet scale networks

Malik, Saif Ur Rehman; Srinivasan, Sudarshan K.; Khan, Saiful

doi:10.1049/el.2012.2310

Cited by 19 publications

(12 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This protocol utilizes the mechanism of neighbor status verification by exchanging fast hello messages. Routing protocol detection ‐ fast failure detection by a routing protocol can be obtained by tuning its hello and dead/hold intervals. Because of the significant load incurred on routers' processors, this method is strongly discouraged …”

Section: Ip Fast Reroutementioning

confidence: 99%

The new Multicast Repair (M‐REP) IP fast reroute mechanism

Papán

Segeč

Palúch

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary The network convergence time may take hundreds of milliseconds or more. Since this repair performance may be unsatisfactory, IP fast reroute (IPFRR) approaches have been developed to decrease the network convergence time and minimize traffic loss. These IPFRR mechanisms are usually based on the proactive precomputation of a backup path before a failure occurs. Once a failure is detected, the router running IPFRR will immediately use this backup path in response to the failure, rather than computing a replacement path only after a failure has occurred. The computation of an alternative path in many IPFRR mechanisms requires that the computing node (router) knows the exact network topology. In this paper, we present a new IPFRR mechanism called the multicast repair (M‐REP) IPFRR mechanism, which provides an advanced fast reroute technique for Internet service providers‘ (ISP‘s) core networks. The M‐REP IPFRR mechanism is based on IP multicast and utilizes Protocol Independent Multicast – Dense Mode (PIM‐DM) with the modification of an internal reverse path forwarding (RPF) check. The M‐REP IPFRR mechanism does not depend on any particular routing protocol type (distance‐vector or link‐state) and requires less system resources because of its precomputation‐less character but still provides immediate reaction to failure.

show abstract

Section: Ip Fast Reroutementioning

confidence: 99%

The new Multicast Repair (M‐REP) IP fast reroute mechanism

Papán

Segeč

Palúch

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…S.U. Malik, et al, (2012) [12] proposed a novel method to compute the intra-area convergence time of open shortest path first (OSPF) based networks in the presence of designated routers (DRs) on Ethernet and non-broadcast multi-access segments.…”

Section: Growth In Industrymentioning

confidence: 99%

convergence delay in ospf: a brief review

2018

IJLTET

View full text Add to dashboard Cite

“…This section evaluates the proposed WARRA by comparing it with the typical baselines including open shortest path rst (OSPF) [24] and random routing [25]. The distance in the OSPF denotes the number of links between the gateway switch and the destination VM.…”

Section: Simulation Experimentsmentioning

confidence: 99%

Workload-aware request routing in cloud data center using software-defined networking

Yuan

2015

J. of Syst. Eng. Electron.

View full text Add to dashboard Cite

Large latency of applications will bring revenue loss to cloud infrastructure providers in the cloud data center. The existing controllers of software-de ned networking architecture can fetch and process traf c information in the network. Therefore, the controllers can only optimize the network latency of applications. However, the serving latency of applications is also an important factor in delivered user-experience for arrival requests. Unintelligent request routing will cause large serving latency if arrival requests are allocated to overloaded virtual machines. To deal with the request routing problem, this paper proposes the workload-aware software-de ned networking controller architecture. Then, request routing algorithms are proposed to minimize the total round trip time for every type of request by considering the congestion in the network and the workload in virtual machines (VMs). This paper nally provides the evaluation of the proposed algorithms in a simulated prototype. The simulation results show that the proposed methodology is ef cient compared with the existing approaches.

show abstract

Convergence time analysis of open shortest path first routing protocol in internet scale networks

Cited by 19 publications

References 4 publications

The new Multicast Repair (M‐REP) IP fast reroute mechanism

The new Multicast Repair (M‐REP) IP fast reroute mechanism

convergence delay in ospf: a brief review

Workload-aware request routing in cloud data center using software-defined networking

Contact Info

Product

Resources

About