Title :
Survivable delay-constrained least cost routing
Author :
Zhang, Qiong ; Gao, Chengyi ; Wang, Xi ; Palacharla, Paparao ; Sekiya, Motoyoshi
Author_Institution :
Fujitsu Labs. of America, Richardson, TX, USA
Abstract :
We address the problem of finding the least cost disjoint path pair with delay constraints, where working and protection paths require different delay constraints. A heuristic algorithm is proposed and compared with optimal ILP results.
Keywords :
integer programming; linear programming; telecommunication network reliability; telecommunication network routing; ILP result; heuristic algorithm; least cost disjoint path pair; survivable delay-constrained least cost routing; Algorithm design and analysis; Complexity theory; Delay; Heuristic algorithms; Lagrangian functions; Routing; USA Councils;
Conference_Titel :
Opto-Electronics and Communications Conference (OECC), 2012 17th
Conference_Location :
Busan
Print_ISBN :
978-1-4673-0976-9
Electronic_ISBN :
2166-8884
DOI :
10.1109/OECC.2012.6276498
