×

A survivable routing algorithm with differentiated domain protection based on a virtual topology graph in multi-domain optical networks. (English) Zbl 1178.68101

Summary: 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 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.

MSC:

68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
68R10 Graph theory (including graph drawing) in computer science
68W05 Nonnumerical algorithms
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Barbehenn, M., A note on the complexity of Dijkstra’s algorithm for graphs with weighted vertices, IEEE Transactions on Computers, 47, 263 (1998) · Zbl 1392.68197
[2] Choi, H.; Subramaniam, S.; Choi, H., Loopback recovery from double-link failures in optical mesh networks, IEEE/ACM Transactions on Networking, 12, 1119-1130 (2004)
[3] Guo, L.; Wang, X.; Song, Q.; Hou, W.; Yang, T.; Yang, F., New insights on survivability in multi-domain optical networks, Information Sciences, 178, 3635-3644 (2008)
[4] Guo, L., LSSP: a novel local segment shared protection for multi-domain optical mesh networks, Computer Communications, 30, 1794-1801 (2007)
[5] Guo, L.; Li, L.; Cao, J.; Yu, H.; Wei, X., On finding feasible solutions with shared backup resources for surviving double-link failures in path-protected WDM mesh networks, Journal of Lightwave Technology, 25, 287-296 (2007)
[6] He, R.; Wen, H.; Li, L.; Wang, G., Shared sub-path protection algorithm in traffic-grooming WDM mesh networks, Photonic Network Communications, 8, 239-249 (2004)
[7] Ou, C.; Zhang, J.; Zang, H.; Sahasrabuddhe, L.; Mukherjee, B., New and improved approaches for shared-path protection in WDM mesh networks, Journal of Lightwave Technology, 22, 1223-1232 (2004)
[8] Ramamurthy, S.; Sahasrabuddhe, L.; Mukherjee, B., Survivable WDM mesh networks, Journal of Lightwave Technology, 21, 870-883 (2003)
[9] Schupke, D.; Prinz, R., Capacity efficiency and restorability of path protection and rerouting in WDM networks subject to dual failures, Photonic Network Communications, 8, 191-207 (2004)
[10] Shen, L.; Yang, X.; Ramamurthy, B., Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks, IEEE/ACM Transactions on Networking, 13, 918-931 (2005)
[11] Szigeti, J.; Gyarmati, L.; Cinkler, T., Multidomain shared protection with limited information via MPP and \(p\)-cycles, Journal of Optical Networking, 7, 400-409 (2008)
[12] Truong, D.; Thiongane, B., Dynamic routing for shared path protection in multi domain optical mesh networks, Journal of Optical Networking, 5, 58-74 (2006)
[13] Truong, D.; Jaumard, B., Multidomain optical networks: issues and challenges – recent progress in dynamic routing for shared protection in multidomain networks, IEEE Communications Magazine, 46, 112-119 (2008)
[14] Xu, D.; Xiong, Y.; Qiao, C., Novel algorithms for shared segment protection, IEEE Journal on Selected Areas in Communications, 21, 1320-1331 (2003)
[15] Yang, X.; Ramamurthy, B., Dynamic routing in translucent WDM optical networks: the intra-domain case, Journal of Lightwave Technology, 23, 955-971 (2005)
[16] Zhou, D.; Subramaniam, S., Survivability in optical networks, IEEE Network, 14, 16-23 (2000)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.