Integer and combinatorial optimization
Integer and combinatorial optimization
Optical networks: a practical perspective
Optical networks: a practical perspective
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Proceedings of the 8th International Symposium on Parallel Processing
Preemptive Task Scheduling for Distributed Systems (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Survivability and Traffic Grooming in WDM Optical Networks
Survivability and Traffic Grooming in WDM Optical Networks
CNSR '06 Proceedings of the 4th Annual Communication Networks and Services Research Conference
Quality of service based resource allocation for scheduled lightpath demands
Computer Communications
Dissemination of Information in Optical Networks: From Technology to Algorithms (Texts in Theoretical Computer Science. An EATCS Series)
SNPD '08 Proceedings of the 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 01
Joint computing and network resource scheduling in a lambda grid network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
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
A practical approach to operating survivable WDM networks
IEEE Journal on Selected Areas in Communications
Traffic grooming in an optical WDM mesh network
IEEE Journal on Selected Areas in Communications
Routing and wavelength assignment of scheduled lightpath demands
IEEE Journal on Selected Areas in Communications
A Value Based Dynamic Resource Provisioning Model in Cloud
International Journal of Cloud Applications and Computing
A Value Based Dynamic Resource Provisioning Model in Cloud
International Journal of Cloud Applications and Computing
Hi-index | 0.00 |
Recent research has clearly established that holding-time-aware routing-and-wavelength-assignment (RWA) schemes lead to significant improvements in resource utilization for scheduled traffic. Two different models have been proposed for scheduled traffic in the literature - (i) the fixed window model, where the setup and the teardown times of the scheduled demands are known in advance and (ii) the sliding window model, where a demand can be allocated anytime within a larger time-window. In this paper, we introduce a new model, the segmented sliding window model, where a demand may be decomposed into two or more components and each component can be sent separately. We present an integer linear program (ILP) formulation for resource allocation under the proposed segmented sliding window model and show that both the fixed and the traditional sliding window models can be treated as a special case of our generalized segmented sliding window model. We consider networks both with and without wavelength converters, and include the option of path protection for each lightpath. For larger networks, we also present a heuristic algorithm for allocating resources. Finally, we show through simulations that our approach leads to significantly higher throughput, even compared to the recent holding-time-aware RWA schemes, which have already been shown to outperform holding-time-unaware models.