A single-source shortest path algorithm for dynamic graphs

Alshammari, Muteb; Rezgui, Abdelmounaam

doi:10.1016/j.akcej.2020.01.002

Cited by 8 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the edge updates are not known in advance, another group of methods can be used, such as the ones in [16][17][18]. They form Shortest Path Trees (SPTs) rooted at each vertex.…”

Section: Related Workmentioning

confidence: 99%

Path Algorithms for Contact Sequence Temporal Graphs

Gheibi,

Banerjee,

Ranka

et al. 2024

Algorithms

View full text Add to dashboard Cite

This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges (OSE) representation, which is faster than other known representations. While our proposed representation clearly outperforms the OSE representation for shallow neighborhood search problems, it is not evident that it does so for different problems. We demonstrate the competitiveness of our TRG representation for the single-source all-destinations fastest, min-hop, shortest, and foremost paths problems.

show abstract

“…When the edge updates are not known in advance, another group of methods can be used, such as the ones in [16][17][18]. They form Shortest Path Trees (SPTs) rooted at each vertex.…”

Section: Related Workmentioning

confidence: 99%

Path Algorithms for Contact Sequence Temporal Graphs

Gheibi,

Banerjee,

Ranka

et al. 2024

Algorithms

View full text Add to dashboard Cite

show abstract

“…Andrej Brodnik et al [48] presented an all-pairs shortest path algorithm for directed acrylic graphs and arbitrary edge lengths. Muteb Alshmmari et al [49] proposed an algorithm (single source shortest path) for dynamic graphs with large change frequency.…”

Section: Related Workmentioning

confidence: 99%

Implementing Dual Base Stations within an IoT Network for Sustaining the Fault Tolerance of an IoT Network through an Efficient Path Finding Algorithm

Sastry

Budaraju

2023

Sensors

View full text Add to dashboard Cite

The IoT networks for implementing mission-critical applications need a layer to effect remote communication between the cluster heads and the microcontrollers. Remote communication is affected through base stations using cellular technologies. Using a single base station in this layer is risky as the fault tolerance level of the network will be zero when the base stations break down. Generally, the cluster heads are within the base station spectrum, making seamless integration possible. Implementing a dual base station to cater for a breakdown of the first base station creates huge remoteness as the cluster heads are not within the spectrum of the second base station. Furthermore, using the remote base station involves huge latency affecting the performance of the IoT network. In this paper, a relay-based network is presented with intelligence to fetch the shortest path for communicating to reduce latency and sustain the fault tolerance capability of the IoT network. The results demonstrate that the technique improved the fault tolerance of the IoT network by 14.23%.

show abstract

“…DRAPSP is responsible for calculating and effectively managing the shortest routes between nodes in the SDN. POX-PLUS consists of three primary components as shown in figure 20: • DR-APSP: This module is the main routing component that operates on our dynamic routing all-pairs shortest path (APSP) algorithm [44] • POX Controller is the original POX controller that has been modified to take on the additional responsibility of updating DR-APSP with information regarding the initial topology, as well as any subsequent modifications to the network.…”

Section: Three Main Algorithms Constitute Damrmentioning

confidence: 99%

Software-defined network traffic routing optimization: A systematic literature review

2023

Kafrelsheikh Journal of Information Sciences

View full text Add to dashboard Cite

The recent surge of interest in Software Defined Networking (SDN) technology is attributed to its centralized administration and control approach, which enhances network management and streamlines infrastructure maintenance. Despite its apparent sudden emergence, SDN is rooted in a lineage of endeavors aimed at enhancing network programmability. SDN offers real-time responsiveness and meets demanding high availability criteria. However, this novel paradigm encounters various technological challenges, some intrinsic and others inherited from pre-existing technologies. This study focuses on illuminating routing traffic concerns within the realm of SDN and provides insights into the forthcoming challenges that confront this transformative network model, encompassing both protocol and architecture perspectives. Additionally, we aim to explore diverse extant solutions and mitigation strategies that tackle issues of SDN scalability, elasticity, dependability, reliability, high availability, resiliency, and performance. This study entails a systematic analysis of 16 scholarly articles addressing routing traffic matters in the context of SDN. Through inductive analysis, this paper discerns and elucidates solutions for recurrently highlighted issues within academic discourse.

show abstract

A single-source shortest path algorithm for dynamic graphs

Cited by 8 publications

References 12 publications

Path Algorithms for Contact Sequence Temporal Graphs

Path Algorithms for Contact Sequence Temporal Graphs

Implementing Dual Base Stations within an IoT Network for Sustaining the Fault Tolerance of an IoT Network through an Efficient Path Finding Algorithm

Software-defined network traffic routing optimization: A systematic literature review

Contact Info

Product

Resources

About