Data networks (2nd ed.)
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
Adaptive wavelength routing in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
Multiwavelength optical networks with limited wavelength conversion
IEEE/ACM Transactions on Networking (TON)
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Worst-case analysis of dynamic wavelength allocation in optical networks
IEEE/ACM Transactions on Networking (TON)
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Models of blocking probability in all-optical networks with and without wavelength changers
IEEE Journal on Selected Areas in Communications
Benefits of wavelength translation in all-optical clear-channel networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Decoupling Packet Loss from Blocking in Proactive Reservation-Based Switching
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Wavelength Assignment for Realizing Parallel FFT on Regular Optical Networks
The Journal of Supercomputing
Benefits of wavelength conversion in optical WDM mesh networks with dynamic routing
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
On-line optimal wavelength assignment in WDM networks with shared wavelength converter pool
IEEE/ACM Transactions on Networking (TON)
WDM network design by ILP models based on flow aggregation
IEEE/ACM Transactions on Networking (TON)
Blocking analysis of dynamic traffic grooming in mesh WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks based on the bee colony optimization
AI Communications - Network Analysis in Natural Sciences and Engineering
Routing and wavelength assignment in optical networks using summarized information
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
MMSRP: multi-wavelength Markov-based split reservation protocol for DWDM optical networks
Proceedings of the 2010 ACM Symposium on Applied Computing
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
IEEE/ACM Transactions on Networking (TON)
Offline routing and wavelength assignment in transparent WDM networks
IEEE/ACM Transactions on Networking (TON)
Optimizing revenue for bandwidth auctions over networks with time reservations
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cross-layer survivability in WDM-based networks
IEEE/ACM Transactions on Networking (TON)
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Low-cost design approach to WDM mesh networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Review: Comparison of ILP formulations for the RWA problem
Optical Switching and Networking
On routing in large WDM networks
Optical Switching and Networking
A heuristic algorithm for lightpath scheduling in next-generation WDM optical networks
Photonic Network Communications
Indirect and direct multicost algorithms for online impairment-aware RWA
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
The problem of routing and wavelength assignment (RWA) is critically important for increasing the efficiency of wavelength-routed all-optical networks. Given the physical network structure and the required connections, the RWA problem is to select a suitable path and wavelength among the many possible choices for each connection so that no two paths sharing a link are assigned the same wavelength. In work to date, this problem has been formulated as a difficult integer programming problem that does not lend itself to efficient solution or insightful analysis. In this work, we propose several novel optimization problem formulations that offer the promise of radical improvements over the existing methods. We adopt a (quasi-)static view of the problem and propose new integer-linear programming formulations, which can be addressed with highly efficient linear (not integer) programming methods and yield optimal or near-optimal RWA policies. The fact that this is possible is surprising, and is the starting point for new and greatly improved methods for RWA. Aside from its intrinsic value, the quasi-static solution method can form the basis for suboptimal solution methods for the stochastic/dynamic settings.