Area Avoidance Routing in Distance-Vector Networks

Zlatokrilov, Haim; Levy, Hanoch

doi:10.1109/infocom.2008.95

Cited by 10 publications

(14 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zlatokrilov et al [23] proposed an approach to find paths to bypass certain failure areas in the network using distance-vector protocols. However, their method relies on the assumption that the failure area is a circle whose center and radius are known in advance.…”

Section: Related Workmentioning

confidence: 99%

Optimal Recovery from Large-Scale Failures in IP Networks

Zheng

Porta

Swami

2012

2012 IEEE 32nd International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures have received increasing attention in recent years. We propose an approach called Reactive Two-phase Rerouting (RTR) for intra-domain routing to quickly recover from largescale failures with the shortest recovery paths. To recover a failed routing path, RTR first forwards packets around the failure area to collect information on failures. Then, in the second phase, RTR calculates a new shortest path and forwards packets along it through source routing. RTR can deal with large-scale failures associated with areas of any shape and location, and is free of permanent loops. For any failure area, the recovery paths provided by RTR are guaranteed to be the shortest. Extensive simulations based on ISP topologies show that RTR can find the shortest recovery paths for more than 98.6% of failed routing paths with reachable destinations. Compared with prior works, RTR achieves better performance for recoverable failed routing paths and uses much less network resources for irrecoverable failed routing paths.

show abstract

Section: Related Workmentioning

confidence: 99%

Optimal Recovery from Large-Scale Failures in IP Networks

Zheng

Porta

Swami

2012

2012 IEEE 32nd International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

show abstract

“…One can verify that the source must query at least |V|/2-2 nodes to reach the target; otherwise it is not guaranteed to avoid v |V| . Details of the proof are in [21].…”

Section: Propositionmentioning

confidence: 99%

“…To enhance this, we offer a heuristic approach based on the conditions for area avoidance routing. Due to lack of space we leave the details of this approach in [21].…”

Section: Hub Based Area Avoidance Routingmentioning

confidence: 99%

“…The high complexity of the greedy algorithm is: O(|RN| 2 |V| 3 log(|V|)). Due to lack of space we leave the details of the algorithm, the proof of correctness and the complexity analysis in [21].…”

Section: Claimmentioning

confidence: 99%

“…The complexity of the algorithm is: O(|RN| 2 |V|log(|V|)), that is similar to the complexity of the HubBasedAreaAvoidanceRouting algorithm presented in the previous section) and significantly lower that the complexity of the greedy algorithm (with the cost of possibly longer paths). Due to lack of space we leave the details, the proof of correctness and the complexity analysis of RestrictedAARouting in [21].…”

Section: Claimmentioning

confidence: 99%

See 2 more Smart Citations

Area Avoidance Routing in Distance-Vector Networks

Zlatokrilov¹,

Levy²

2008

2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications

Self Cite

View full text Add to dashboard Cite

Network routing may be required, under certain applications, to avoid certain areas (or nodes). These areas can be of potential security threat, possess poor quality or have other undesired characteristics. Thus, protocols that can perform area avoidance routing can be beneficial for many objectives. Such routing is particularly challenging in distancevector networks, where only the shortest-distance information is available to the nodes. We address this challenge by algorithms that retrieve distance-vector information from other nodes in the network, referred to as reference nodes, and exploit it for computing guaranteed area-avoiding paths. Having these paths, the source can direct the packets using loose source routing towards the destination. We lay out the model for area avoidance routing and study several algorithms for calculating area-avoiding paths. In addition, we address the problem of dynamically selecting reference nodes. We show, through analysis and extensive simulation, that in many cases a small number of reference nodes are sufficient for area avoidance routing 1 .

show abstract

Multi-path Based Avoidance Routing in Wireless Networks

Sakai

Sun

et al. 2015

2015 IEEE 35th International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Area Avoidance Routing in Distance-Vector Networks

Cited by 10 publications

References 16 publications

Optimal Recovery from Large-Scale Failures in IP Networks

Optimal Recovery from Large-Scale Failures in IP Networks

Area Avoidance Routing in Distance-Vector Networks

Multi-path Based Avoidance Routing in Wireless Networks

Contact Info

Product

Resources

About