Bandwidth packing: a tabu search approach
Management Science
Approaches for capacity and revenue optimization in suvivable WDM networks
Journal of High Speed Networks - Survivable optical networks - part I
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE/ACM Transactions on Networking (TON)
Reconfiguration of spare capacity for MPLS-based recovery in the internet backbone networks
IEEE/ACM Transactions on Networking (TON)
Optical layer survivability: a services perspective
IEEE Communications Magazine
Issues for routing in the optical layer
IEEE Communications Magazine
Challenges for MPLS in optical network restoration
IEEE Communications Magazine
Optical layer survivability-an implementation perspective
IEEE Journal on Selected Areas in Communications
Survivable lightpath routing: a new approach to the design of WDM-based networks
IEEE Journal on Selected Areas in Communications
Novel algorithms for shared segment protection
IEEE Journal on Selected Areas in Communications
Optical networking and real-time provisioning: an integrated vision for the next-generation Internet
IEEE Network: The Magazine of Global Internetworking
Journal of Network and Computer Applications
Efficient path protection in bi-directional WDM systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved quasi-path restoration in mesh networks
IEEE/ACM Transactions on Networking (TON)
New insights on survivability in multi-domain optical networks
Information Sciences: an International Journal
Multi-layer survivable routing mechanism in GMPLS based optical networks
Journal of Systems and Software
Routing connections with differentiated reliability requirements in WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Information Sciences: an International Journal
Efficient and scalable provisioning of always-on multicast streaming services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Resilience analysis of packet-witched communication networks
IEEE/ACM Transactions on Networking (TON)
Computers and Operations Research
Journal of Global Optimization
Multi-links recovery algorithm in survivable WDM optical network
Photonic Network Communications
IEEE/ACM Transactions on Networking (TON)
Diverse routing in networks with probabilistic failures
IEEE/ACM Transactions on Networking (TON)
SRG-disjoint design with dedicated and shared protection
INOC'11 Proceedings of the 5th international conference on Network optimization
Differentiated quality-of-protection in survivable WDM mesh networks using p-structures
Computer Communications
Hi-index | 0.00 |
The static provisioning problem in wavelength-routed optical networks has been studied for many years. However, service providers are still facing the challenges arising from the special requirements for provisioning services at the optical layer. In this paper, we incorporate some realistic constraints into the static provisioning problem, and formulate it under different network resource availability conditions. We consider three classes of shared risk link group (SRLG)-diverse path protection schemes: dedicated, shared, and unprotected. We associate with each connection request a lightpath length constraint and a revenue value. When the network resources are not sufficient to accommodate all the connection requests, the static provisioning problem is formulated as a revenue maximization problem, whose objective is maximizing the total revenue value. When the network has sufficient resources, the problem becomes a capacity minimization problem with the objective of minimizing the number of used wavelength-links. We provide integer linear programming (ILP) formulations for these problems. Because solving these ILP problems is extremely time consuming, we propose a tabu search heuristic to solve these problems within a reasonable amount of time. We also develop a rerouting optimization heuristic, which is based on previous work. Experimental results are presented to compare the solutions obtained by the tabu search heuristic and the rerouting optimization heuristic. For both problems, the tabu search heuristic outperforms the rerouting optimization heuristic.