A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices
IEEE Transactions on Computers
Hierarchical routing in multi-domain optical networks
Computer Communications
LSSP: A novel local segment-shared protection for multi-domain optical mesh networks
Computer Communications
Automatic protection switching for p-cycles in WDM networks
Optical Switching and Networking
IEEE Journal on Selected Areas in Communications
Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks
IEEE Network: The Magazine of Global Internetworking
A novel multi-link fault-tolerant algorithm for survivability in multi-domain optical networks
Photonic Network Communications
An efficient critical protection scheme for intra-domain routing using link characteristics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Since current optical network is actually divided into multiple domains each of which has its own network provider for independent management, the development of multidomain networks has become the trend of next-generation intelligent optical networks, and then the survivability has also become an important and challenging issue in fault-tolerant multidomain optical networks. In this paper, we study protection algorithms in multi-domain optical networks and propose a new heuristic algorithm called Multi-domain Hamiltonian Cycle Protection (MHCP) to tolerate the single-fiber link failure. In MHCP, we present the Local Hamiltonian Cycle (LHC) method based on the physical topology of each single-domain and the Global Hamiltonian Cycle (GHC) method based on the abstracted virtual topology of multi-domains to protect the intra-fiber link and inter-fiber link failures, respectively. We also present the link-cost formulas to encourage the load balancing and proper links selection for computing the working path of each connection request. Simulation results show that, compared with previous multi-domain protection algorithm, MHCP can obtain better performances in resource utilization ratio, blocking probability, and computation complexity.