Integer SPM: intelligent path selection for resilient networks

Authors:
Rüdiger Martin;Michael Menth;Ulrich Spörlein
Affiliations:
University of Würzburg, Institute of Computer Science, Germany;University of Würzburg, Institute of Computer Science, Germany;University of Würzburg, Institute of Computer Science, Germany
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 8
Cited 0

A quantitative comparison of graph-based models for Internet topology

IEEE/ACM Transactions on Networking (TON)
Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration

IEEE/ACM Transactions on Networking (TON)
Survivable Networks: Algorithms for Diverse Routing

Survivable Networks: Algorithms for Diverse Routing
Network topology generators: degree-based vs. structural

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Achieving sub-second IGP convergence in large IP networks

ACM SIGCOMM Computer Communication Review
An evaluation of IP-based fast reroute techniques

CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Engineering end-to-end IP resilience using resilience-differentiated QoS

IEEE Communications Magazine

Quantified Score

Hi-index	0.01

Visualization

Abstract

The self-protecting multipath (SPM) is a simple and efficient end-to-end protection switching mechanism. It distributes traffic according to a path failure specific load balancing function over several disjoint paths and redistributes it if one of these paths fails. SPMs with optimal load balancing functions (oSPMs) are unnecessarily complex because traffic aggregates potentially need to be split which is an obstacle for the deployment of SPMs in practice. The contribution of this paper is the proposal of an integer SPM (iSPM), i.e., the load balancing functions take only 0/1 values and effectively become path selection functions. In addition, we propose a greedy heuristic to optimize the 0/1 distributions. Finally, we show that the iSPM is only little less efficient than the oSPM and that the computation time of the heuristic for the iSPM is clearly faster than the linear program solver for the oSPM such that the iSPM can be deployed in significantly larger networks.