DocumentCode :
1979863
Title :
Batch scheduling in optical networks with feedback/feed-forward fiber delay lines
Author :
Yang Wang ; Xiaojun Cao ; Caciula, Adrian ; Qian Hu
Author_Institution :
Dept. of Comput. Sci., Georgia State Univ., Atlanta, GA, USA
fYear :
2012
fDate :
3-7 Dec. 2012
Firstpage :
2965
Lastpage :
2970
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.
Keywords :
buffer circuits; circuit feedback; computational complexity; heuristic programming; mathematical analysis; optical delay lines; optical fibre networks; optical switches; optimisation; packet switching; scheduling; JDB; NP-complete problem; batch job-machine scheduling; buffer system; discrete-time buffer problem; feedback-feed-forward fiber delay line; heuristic algorithm; mathematical model; optical burst-packet switching network; pure-loss system; random access memory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Communications Conference (GLOBECOM), 2012 IEEE
Conference_Location :
Anaheim, CA
ISSN :
1930-529X
Print_ISBN :
978-1-4673-0920-2
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2012.6503568
Filename :
6503568
Link To Document :
بازگشت