Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
IEEE/ACM Transactions on Networking (TON)
Efficient algorithms for routing dependable connections in WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Virtual-topology adaptation for WDM mesh networks under dynamic traffic
IEEE/ACM Transactions on Networking (TON)
A genetic algorithm for solving virtual topology configuration transition problem in WDM network
Computer Communications
A study of the backup reprovisioning problem for FIPP p-cycles on WDM networks
Photonic Network Communications
Policy-driven automated reconfiguration for performance management in WDM optical networks
IEEE Communications Magazine
Design of logical topologies for wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
A highly efficient path-restoration protocol for management of optical network transport integrity
IEEE Journal on Selected Areas in Communications
Dynamic load balancing in WDM packet networks with and without wavelength constraints
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this article, for the given wavelength division multiplexing (WDM) network, the demand traffic matrix, the old and new survivable virtual topologies which are protected by the failure-independent path-protecting p-cycles (FIPP p-cycles) protection scheme, the virtual topology transition sequence (VTTS) problem is studied. The goal of this problem is to find an optimal sequence to transfer the old virtual topology into new one, and during the transiting process, the services are not disrupted. Moreover, each lightpath in the virtual topology is protected by the FIPP p-cycle and can survive against a single-link failure. In this article, a heuristic algorithm and a genetic algorithm are proposed to solve this problem. Simulations are also performed to evaluate the performance of proposed algorithms.