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)

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



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

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

Yang Wang, Xiaojun Cao, Adrian Caciula, and Qian Hu, "Batch Scheduling in Optical Networks," J. Opt. Commun. Netw. 5, 116-126 (2013)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. E. M. Arkin and E. B. Silverberg, “Scheduling jobs with fixed start and end times,” Discrete Appl. Math., vol. 18, no. 1, pp. 1–8, 1987. [CrossRef]
  2. W. Nawijn, “Minimum loss scheduling problems,” Eur. J. Oper. Res., vol. 56, no. 3, pp. 364–369, 1992. [CrossRef]
  3. V. Gabrel, “Scheduling jobs within time windows on identical parallel machines: New model and algorithms,” Eur. J. Oper. Res., vol. 83, pp. 321–329, 1995. [CrossRef]
  4. T. Cheng and C. Sin, “A state-of-the-art review of parallel-machine scheduling research,” Eur. J. Oper. Res., vol. 47, pp. 271–292, 1990. [CrossRef]
  5. K. I. Bouzina and H. Emmons, “Interval scheduling on identical machines,” J. Global Optim., vol. 9, pp. 379–393, 1996. [CrossRef]
  6. A. Agnetis, D. Pacciarelli, and F. Rossi, “Batch scheduling in a two-machine flow shop with limited buffer,” Discrete Appl. Math., vol. 72, no. 3, pp. 243–260, 1997. [CrossRef]
  7. Y. Wang and X. Cao, “Distributive waveband assignment in multi-granular optical networks,” in IEEE IPDPS, Apr. 2010, pp. 1–9.
  8. S. Charcranoon, T. El-Bawab, H. Cankaya, and J.-D. Shin, “Group-scheduling for optical burst switched (OBS) networks,” in Proc. IEEE GLOBECOM, 2003, pp. 2745–2749.
  9. M. H. Phung, K. C. Chua, G. Mohan, M. Motani, T. C. Wong, and P. Y. Kong, “On ordered scheduling for optical burst switching,” Comput. Netw., vol. 48, no. 6, pp. 891–909, 2005. [CrossRef]
  10. X. Cao, Y. Wang, and A. Zelikovsky, “Batch scheduling algorithms using interval graphs in optical burst switching networks,” in Proc. IEEE GLOBECOM, 2009, pp. 1–5.
  11. A. Kaheel and H. Alnuweiri, “Batch scheduling algorithms: A class of wavelength schedulers in optical burst switching networks,” in Proc. IEEE ICC, 2005, pp. 1713–1719.
  12. F. Farahmand and J. Jue, “Look-ahead window contention resolution in optical burst switched networks,” in Workshop on High Performance Switching and Routing (HPSR), Sept. 2003, pp. 147–151.
  13. B. Mukherjee, Optical WDM Networks. Springer, 2006.
  14. R. Ramaswami, K. Sivarajan, and G. Sasaki, Optical Networks: A Practical Perspective, 3rd ed.Morgan Kaufmann, San Francisco, CA, 2009.
  15. L. Li, S. D. Scott, and J. S. Deogun, “A novel fiber delay line buffering architecture for optical packet switching,” in Proc. IEEE GLOBECOM, 2003, vol. 5, pp. 2809–2813.
  16. D. Hunter, M. Chia, and I. Andonovic, “Buffering in optical packet switches,” J. Lightwave Technol., vol. 16, no. 2, pp. 2081–2094, 1998. [CrossRef]
  17. M. Enachescu, Y. Ganjali, A. Goel, N. McKeown, and T. Roughgarden, “Routers with very small buffers,” in Proc. IEEE INFOCOM, 2006, pp. 1–11.
  18. F. Gavril, “Algorithms for maximum k-coloring and k-covering of transitive graphs,” Comput. Chem. Eng., vol. 17, pp. 465–470, 1997.
  19. Y. Chen, C. Qiao, and X. Yu, “Optical burst switching: A new area in optical networking research,” IEEE Network, vol. 18, no. 1, pp. 16–23, May–June2004. [CrossRef]
  20. Y. Xiong, M. Vandenhoute, and H. Cankaya, “Control architecture in optical burst-switched WDM networks,” IEEE J. Sel. Areas Commun., vol. 18, no. 10, pp. 1838–1851, 2000. [CrossRef]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited