Please use this identifier to cite or link to this item:
|Title:||Scheduling network and computing resources for sliding demands in optical grids|
|Source:||Nguyen, H.-H., Gurusamy, M., Zhou, L. (2009-06-15). Scheduling network and computing resources for sliding demands in optical grids. Journal of Lightwave Technology 27 (12) : 1827-1836. ScholarBank@NUS Repository. https://doi.org/10.1109/JLT.2009.2021163|
|Abstract:||In this paper, we consider the problem of scheduling lightpaths and computing resources for sliding grid demands in WDM networks. Each sliding grid demand is represented by a tuple (v,R,c,p,q,l), where v is the client node, R is the resource-group which includes a group of predefined resource nodes, is the required amount of computing resources, [p, q] is the time window and l is the demand duration. With each demand, the scheduling algorithm is required to decide the start time t (p < t < q - l), reserve an amount of c computing resources at a resource node v′ ∈ R and provision a primary lightpath as well as a backup lightpath from v′ to v. The reserved computing resources and lightpaths are used during [t,t + l]. Unlike the sequential approach wherein the start time, the network resources (lightpaths) and the computing resources are considered one after another, in our work we use the joint scheduling approach wherein the resources and the start time are examined jointly. We consider sliding demands with static and dynamic arrival patterns. We develop an integer linear programming (ILP) formulation to obtain optimal results. For the reason of scalability, we propose heuristic algorithms based on joint resource scheduling and study their effectiveness through simulation experiments. © 2009 IEEE.|
|Source Title:||Journal of Lightwave Technology|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 14, 2017
WEB OF SCIENCETM
checked on Nov 17, 2017
checked on Dec 10, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.