Paper Info
Title
Batch scheduling in optical networks with feedback/feed-forward fiber delay lines
Abstract
Batch scheduling has been extensively studied in the context of Job-machine scheduling, where a group of time-constrained tasks are scheduled to run over a limited number of servers, with the goal of maximizing the overall revenue from successfully scheduled tasks. Depending on whether buffers are employed, batch scheduling can be in the form of a pure-loss system or system with buffers. In optical burst/packet switching networks, bursts/packets (i.e., tasks) that simultaneously arrive or locate within the same time window can be treated as a batch, and scheduled over a limited number of available wavelengths (i.e., servers). Due to the unavailability of Random Access Memory in optical networks, buffering is generally achieved with Fiber Delay Lines, which can only offer discrete and predefined duration of buffering. The discrete feature of FDLs hence leads to a new Job-machine scheduling with Discrete-time Buffers (JDB) problem, which can be shown to be NP-Complete. In this work, we study how to optimally co-schedule FDLs and wavelengths in the batch scheduling process over two types of FDL architectures, namely feed-forward and feedback FDLs. We mathematically model the JDB problem over both feed-forward and feedback FDLs, and propose a heuristic algorithm to enable fast on-line scheduling. The performance of proposed schemes over feed-forward and feedback FDLs are simulated and compared.
Year
DOI
Venue
2012
10.1109/GLOCOM.2012.6503568
GLOBECOM
Keywords
Field
DocType
packet switching,optimisation,scheduling,feedback-feed-forward fiber delay line,optical delay lines,jdb,optical fibre networks,circuit feedback,batch job-machine scheduling,random access memory,mathematical model,np-complete problem,mathematical analysis,heuristic algorithm,heuristic programming,computational complexity,buffer circuits,discrete-time buffer problem,optical switches,pure-loss system,optical burst-packet switching network,buffer system
Fair-share scheduling,Heuristic (computer science),Computer science,Scheduling (computing),Computer network,Real-time computing,Job scheduler,Packet switching,Dynamic priority scheduling,Feed forward,Distributed computing,Random access
Conference
ISSN
ISBN
Citations 
1930-529X E-ISBN : 978-1-4673-0919-6
978-1-4673-0919-6
0
PageRank 
References 
Authors
0.34
4
4
Name
Order
Citations
PageRank
Yang Wang110212.48
Xiaojun Cao253074.55
Adrian Caciula3224.51
Qian Hu4545.44