Topology Aggregation for Directed Graph
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Hierarchical routing in multi-domain optical networks
Computer Communications
LSSP: A novel local segment-shared protection for multi-domain optical mesh networks
Computer Communications
A survey of survivability in multi-domain optical networks
Computer Communications
Survivable lightpath routing: a new approach to the design of WDM-based networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications - Part Supplement
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Survivability has been widely recognized as an important design issue for optical networks. In practice, as the network scale keeps expanding, this design problem becomes more critical. Due to scalability and domain privacy, designing the protection scheme in multi-domain networks is more difficult than that in single domain networks. The path computation element (PCE) is known as an efficient architecture to compute optimal traffic engineering (TE) paths in multi-domain multilayer networks. Based on the PCE architecture, we first propose a new dynamic domain-sequencing scheme that considers the load balance of inter-domain links and then propose an improved segment-shared protection approach called DDSP. It can provide 100% protection ability for multiple failures that each single domain has only one failed link. Finally, the protection based on the optimal dynamic domain-sequencing scheme, called OPT, is designed, to evaluate performance of our algorithm and to provide the good bounding for the dynamic domain-sequencing scheme with limited intra TE information. Simulation evaluation shows that the proposed scheme is effective in multi-domain path protection with more efficient resource utilization, lower blocking probabilities and less inter-domain cost. Furthermore, the performance of it is near to OPT.