DocumentCode
606798
Title
OpenRoutes: Multi-operator cooperative routing over maximally disjoint paths for the survivability of wireless backhaul
Author
Philip, V.D. ; Gourhant, Y. ; Zeghlache, Djamal
Author_Institution
Orange Labs., France Telecom R&D, Lannion, France
fYear
2013
fDate
4-7 March 2013
Firstpage
179
Lastpage
186
Abstract
In this paper, we present OpenRoutes- a cost-effective restoration scheme which aims to re-route disrupted connections according to their respective QoS requirements (as per traffic classes) over maximally disjoint paths constructed across a backhaul network topology, which is evolved out of sharing between “different” Mobile Network Operators (MNOs). Our approach enables to assign the most optimal path for a disrupted connection by appropriately selecting it from a list of pre-computed 3C different end-to-end alternative paths, in a wireless backhaul network, in which the topology and the traffic demands change over time due to link/node failures and/or traffic spikes. The proposed restoration scheme is developed and evaluated with proof of correctness specifically including (i) a simple illustrative model which characterizes the computation of 3C alternative maximally disjoint paths with optimal capacity (ii) completely new ILP based formulations based on the model definitions (iii) three distinct efficient heuristic algorithms for different traffic classes which solves the formulated ILP model and (iv) performance evaluation on arbitrary network topologies.
Keywords
cooperative communication; integer programming; linear programming; mobility management (mobile radio); telecommunication network reliability; telecommunication network routing; telecommunication network topology; telecommunication traffic; ILP; OpenRoutes; QoS; alternative maximally disjoint path; cost effective restoration scheme; disrupted connection; end-to-end alternative path; heuristic algorithms; mobile network operator; multioperator cooperative routing; node failure; optimal capacity; optimal path assignment; traffic demand; traffic spikes; wireless backhaul network survivability; wireless backhaul network topology; Algorithm design and analysis; Bandwidth; Computational modeling; Delays; Heuristic algorithms; Network topology; Quality of service; Maximally disjoint paths; Multi-topology wireless backhaul networks; Path computation algorithm; Path-based proactive restoration scheme;
fLanguage
English
Publisher
ieee
Conference_Titel
Design of Reliable Communication Networks (DRCN), 2013 9th International Conference on the
Conference_Location
Budapest
Print_ISBN
978-1-4799-0049-7
Type
conf
Filename
6529858
Link To Document