A survivable routing algorithm with differentiated domain protection based on a virtual topology graph in multi-domain optical networks |
| |
Authors: | Lei Guo Xingwei Wang Jiannong Cao Xiaobing Zheng Weigang Hou |
| |
Affiliation: | a College of Information Science and Engineering, Northeastern University, Shenyang 110004, China b Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong |
| |
Abstract: | In this paper, we propose a novel differentiated domain protection (DDP) scheme to address survivability in multi-domain optical networks. Survivable routing in multi-domain networks is a challenging algorithmic problem because it requires choosing links that provide adequate protection both between domains and within domains that may offer different protection services. To satisfy the survivability requirements of different domains, DDP considers differentiated protection schemes, i.e., dedicated protection, shared protection, or no protection in different domains. In order to respect the principle of transparent management in multiple domains, DDP abstracts a multi-domain optical network to a virtual topology graph (VTG) for solving routing between domains. Simulation results show that DDP, unlike traditional schemes, can provide trade-off between protection methods and also allows better resource utilization. |
| |
Keywords: | Optical networks Multi-domains Virtual topology graph Differentiated protection |
本文献已被 ScienceDirect 等数据库收录! |
|