2017
DOI: 10.1109/lcomm.2017.2691698
|View full text |Cite
|
Sign up to set email alerts
|

A Geographical Proximity Aware Multi-Path Routing Mechanism for Resilient Networking

Abstract: Geographical correlated failures are threats that cause major interruptions and damage to networking systems. To mitigate this rarely addressed challenge, this paper presents a novel geographical location aware route selection algorithm to support uninterrupted networking. The multi-path routing method developed calculates multiple paths that satisfy different constraints while ensuring the prescribed geographical distance metric between selected paths. It is used with existing overlay routing mechanisms to ma… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 12 publications
0
8
0
Order By: Relevance
“…Proximity analysis uses a mapped feature of interest to compute and determine its spatial relationship in distance with its neighbors, thus enabling suitable site or event selection, respectively (Stillwell and Clarke 2006;Wang et al 2017). Proximity analysis has found major use in the transportation sectors to determine distance to destinations (Wu and Carson 2008).…”
Section: Proximity Analysismentioning
confidence: 99%
“…Proximity analysis uses a mapped feature of interest to compute and determine its spatial relationship in distance with its neighbors, thus enabling suitable site or event selection, respectively (Stillwell and Clarke 2006;Wang et al 2017). Proximity analysis has found major use in the transportation sectors to determine distance to destinations (Wu and Carson 2008).…”
Section: Proximity Analysismentioning
confidence: 99%
“…They also consider the vulnerability regions to assess the susceptible components (nodes and/or links) of D-geodiverse paths pair between two network nodes belonging to the same region. Similarly, a geographical location-aware algorithm proposed by Wang et al in Reference [101] that calculates multiple paths separated by at least a given spatial distance, known as pre-defined distance threshold r. Two variants of the algorithm based on a penalty adjustment are proposed and tested. Wang et al evaluated the performance using the proximity factor and concurrent failures to measure the resilience of the algorithm.…”
Section: Disaster-aware Network Survivabilitymentioning
confidence: 99%
“…This work needs to extend from spatially close fibers to spatially close disjoint paths for risk-averse path provisioning. Similarly, Reference [101] presented the geographic proximity-aware route selection algorithm to discover backup paths with appropriate proximity factor. The study is based on a grid-based network, whereas fiber links are deployed in a zig-zag (irregular geometry) manner in real-life networks.…”
Section: Challenges In Disaster-resilient Optical Network Survivabilitymentioning
confidence: 99%
“…They proposed an ILP to solve the problem. In the same context, Wang et al [20] presented a geographic aware route selection algorithm for finding alternative paths with appropriate geographical separation, referred to as the proximity factor. Contrary to their work, our proposed algorithm is based on the Yen's algorithm [21], such that the running time and accuracy of our algorithm can be tuned based on the selected K value.…”
Section: Related Workmentioning
confidence: 99%