OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: K. Bergman and O. Gerstel
  • Vol. 5, Iss. 2 — Feb. 1, 2013
  • pp: 116–126

Batch Scheduling in Optical Networks

Yang Wang, Xiaojun Cao, Adrian Caciula, and Qian Hu  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 5, Issue 2, pp. 116-126 (2013)
http://dx.doi.org/10.1364/JOCN.5.000116


View Full Text Article

Enhanced HTML    Acrobat PDF (2994 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

Batch scheduling accommodates a group of tasks with the start/end time constraints to maximize the revenue from scheduling tasks over a number of servers, which has been extensively studied in the context of job–machine scheduling. In optical networks, batch scheduling refers to the process of scheduling a group of data units (i.e., the jobs) competing for the same set of wavelength channels (i.e., the machines). Classical job–machine scheduling studies have considered both the case of a pure-loss system, and the case with waiting rooms (i.e., buffers), which are generally in the form of random access memory (RAM). In optical networks, the buffering is achieved by feeding the optical signal into a fixed length of fiber, namely, a fiber delay line (FDL), since optical RAM is not yet available. The unique feature of the discrete and predefined buffering time in fact instantiates a new type of problem, namely, job–machine scheduling with discrete-time buffers. In this work, we comprehensively study batch scheduling in optical networks. We show that batch scheduling with and without FDLs corresponds to two different instances of the job–machine scheduling problem. While proving their NP-completeness, we mathematically model both cases using integer linear programming formulations to provide an optimal scheduling. Given the timeliness request for on-line batch scheduling and the dramatic problem size in optical networks, we also propose polynomial-time heuristic algorithms, which are shown to be near optimal in our simulations.

© 2013 OSA

OCIS Codes
(200.4490) Optics in computing : Optical buffers
(200.6715) Optics in computing : Switching

ToC Category:
Research Papers

History
Original Manuscript: April 9, 2012
Revised Manuscript: October 12, 2012
Manuscript Accepted: December 11, 2012
Published: January 10, 2013

Citation
Yang Wang, Xiaojun Cao, Adrian Caciula, and Qian Hu, "Batch Scheduling in Optical Networks," J. Opt. Commun. Netw. 5, 116-126 (2013)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-5-2-116

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited