TRIDENT: an automated approach to traffic engineering in IP/MPLS over ASON/GMPLS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quality of service based resource allocation for scheduled lightpath demands
Computer Communications
Dynamic scheduling of network resources with advance reservations in optical grids
International Journal of Network Management
Dynamic scheduling of survivable connections with delay tolerance in WDM networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Service differentiation based on flexible time constraints in market-oriented grids
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Provisioning of deadline-driven requests with flexible transmission rates in WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
On the efficiency of dynamic routing of connections with known duration
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Multi-hour network planning based on domination between sets of traffic matrices
Computer Networks: The International Journal of Computer and Telecommunications Networking
Assigning routes and wavelengths for collaboration over optical networks
Photonic Network Communications
A new model for allocating resources to scheduled lightpath demands
Computer Networks: The International Journal of Computer and Telecommunications Networking
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
RWA on scheduled lightpath demands in WDM optical transport networks with time disjoint paths
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
IEEE/ACM Transactions on Networking (TON)
Survivable scheduled service provisioning in WDM optical networks with iterative routing
Optical Switching and Networking
Resource provisioning for survivable WDM networks under a sliding scheduled traffic model
Optical Switching and Networking
Scheduling of periodic connections with flexibility
Optical Switching and Networking
A heuristic algorithm for lightpath scheduling in next-generation WDM optical networks
Photonic Network Communications
Towards an optimized abstracted topology design in cloud environment
Future Generation Computer Systems
RWA algorithm for scheduled lightpath demands in WDM networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
(Non-)reconfigurable virtual topology design under multihour traffic in optical networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.07 |
We present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in advance. We formulate separately the routing problem and the wavelength assignment problem as spatio-temporal combinatorial optimization problems. For the former, we propose a branch and bound algorithm for exact resolution and an alternative tabu search algorithm for approximate resolution. A generalized graph coloring approach is used to solve the wavelength assignment problem. We compared the proposed algorithms to an RWA algorithm that sequentially computes the route and wavelength assignment for the scheduled lightpath demands.