TY - GEN
T1 - OpenRoutes
T2 - 2013 9th International Conference on the Design of Reliable Communication Networks, DRCN 2013
AU - Daniel Philip, Venmani
AU - Gourhant, Yvon
AU - Zeghlache, Djamal
PY - 2013/8/9
Y1 - 2013/8/9
N2 - 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.
AB - 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.
KW - Maximally disjoint paths
KW - Multi-topology wireless backhaul networks
KW - Path computation algorithm
KW - Path-based proactive restoration scheme
M3 - Conference contribution
AN - SCOPUS:84881107773
SN - 9781479900497
T3 - 2013 9th International Conference on the Design of Reliable Communication Networks, DRCN 2013
SP - 179
EP - 186
BT - 2013 9th International Conference on the Design of Reliable Communication Networks, DRCN 2013
Y2 - 4 March 2013 through 7 March 2013
ER -