Batch Scheduling in Optical Networks

Yang Wang, Xiaojun Cao, Adrian Caciula, and Qian Hu

Your library or personal account may give you access

• Abstract
• Full Article

• Figures (10)
• Tables (3)
• Equations (20)
• References (20)
• Cited By(1)
• Back to Top

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 ofjob–machine scheduling. In optical networks, batch scheduling refers to the process of scheduling a group of data units (i.e., thejobs) competing for the same set of wavelength channels (i.e., themachines). Classicaljob–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 thejob–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 Optical Society of America

Optical and Electronic Combined Buffer Architecture for Optical Packet Switches

Takahiro Hirayama, Takaya Miyazawa, Hideaki Furukawa, and Hiroaki Harai
J. Opt. Commun. Netw.7(8) 776-784 (2015)

Three-Domain Burst Scheduling in Optically Burst-Switched WDM Networks

Kouji Hirata, Takahiro Matsuda, and Tetsuya Takine
J. Opt. Commun. Netw.2(6) 332-343 (2010)

Cost-Optimized Reservation and Routing for Scheduled Traffic in Optical Networks

Hui Ding, Pan Yi, and Byrav Ramamurthy
J. Opt. Commun. Netw.5(11) 1215-1226 (2013)

Joint Jobs Scheduling and Lightpath Provisioning in Fog Computing Micro Datacenter Networks

Zhen Liu, Jiawei Zhang, Yanan Li, Lin Bai, and Yuefeng Ji
J. Opt. Commun. Netw.10(7) B152-B163 (2018)

Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective

Sahar Talebi, Evripidis Bampis, Giorgio Lucarelli, Iyad Katib, and George N. Rouskas
J. Opt. Commun. Netw.6(8) 754-763 (2014)

Cited By

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

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (10)

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

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (3)

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

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (20)

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

Contact your librarian or system administrator
or
Login to access Optica Member Subscription