OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: Keren Bergman and Vincent Chan
  • Vol. 1, Iss. 2 — Jul. 1, 2009
  • pp: A94–A105

Integrated Provisioning of Sliding Scheduled Services Over WDM Optical Networks [Invited]

Dragos Andrei, Hong-Hsu Yen, Massimo Tornatore, Charles U. Martel, and Biswanath Mukherjee  »View Author Affiliations

Journal of Optical Communications and Networking, Vol. 1, Issue 2, pp. A94-A105 (2009)

View Full Text Article

Enhanced HTML    Acrobat PDF (293 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



Many future Internet applications supported over optical networks may require large amounts of guaranteed bandwidth between two remote end hosts, but this bandwidth may not necessarily be needed immediately. To ensure a deterministic service, Internet customers may prefer to reserve network resources, e.g., lightpaths, in advance and may indicate an approximate time window in the future during which the bandwidth should be reserved for a certain period of time; however, the exact start time of the reservation is not specified, but can slide in the predefined time window. This type of user traffic is called “sliding scheduled traffic.” Optical network design for provisioning sliding scheduled traffic is a highly complex task that has been dealt with in the literature by two-step approaches, which first schedule user demands in time and then perform their routing and wavelength assignment (RWA). We propose a scalable integrated design for the sliding scheduling provisioning problem (SSPP), based on the Lagrangean relaxation (LR) approach, which can jointly perform the scheduling and RWA of the demands. We first develop a new mathematical model for SSPP, to which it is suitable to apply the relaxation of some of the model’s constraints. We use an integrated heuristic called IPSR (integrated provisioning of sliding requests), which is next enhanced with a cost assignment based on Lagrangean multiplier information, to serve as the primal algorithm for our LR approach (named IPSR-LR). We compare our approaches with an existing two-step heuristic algorithm for SSPP and show that both IPSR and IPSR-LR are able to outperform it. In addition, our numerical results show that IPSR-LR improves over IPSR under all typical experimental cases that we considered. Furthermore, we compare our approaches with the solutions provided by an integer linear program for the SSPP, which is, however, less scalable for large problem sizes compared with our algorithms.

© 2009 Optical Society of America

OCIS Codes
(060.4250) Fiber optics and optical communications : Networks
(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms

ToC Category:
Optical Networks for the Future Internet

Revised Manuscript: January 17, 2009
Manuscript Accepted: January 21, 2009
Published: June 24, 2009

Virtual Issues
Optical Networks for the Future Internet (2009) Journal of Optical Networking

Dragos Andrei, Hong-Hsu Yen, Massimo Tornatore, Charles U. Martel, and Biswanath Mukherjee, "Integrated Provisioning of Sliding Scheduled Services Over WDM Optical Networks [Invited]," J. Opt. Commun. Netw. 1, A94-A105 (2009)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. L. Shen, X. Yang, A. Todimala, B. Ramamurthy, “A two-phase approach for dynamic lightpath scheduling in WDM optical networks,” in IEEE Int. Conf. on Communications 2007. ICC ’07, Glasgow, Scotland, June 24–28, 2007, pp. 2412–2417.
  2. B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in 2nd Int. Conf. on Broadband Networks, 2005. BroadNets 2005, Boston, MA, Oct. 3–7, 2005, vol. 1, pp. 13–22.
  3. H. Zang, J. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, no. 1, pp. 47–60, Jan. 2000.
  4. B. Mukherjee, Optical WDM Networks, New York, NY: Springer Science+Business Media, Jan. 13, 2006.
  5. J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003. [CrossRef]
  6. L.-O. Burchard, H.-U. Heiss, C. De Rose, “Performance issues of bandwidth reservation for grid computing,” in Proc. 15th Symp. Computer Architecture and High Performance Computing 2003, Nov. 10–12, 2003, pp. 82–90.
  7. European Organization for Nuclear Research (CERN), www.cern.ch/.
  8. OptIPuter, http://www.optiputer.net/, 2008.
  9. R. Ahuja, T. Magnanti, J. Orlin, Network Flows—Theory, Algorithms, and Applications, Upper Saddle River, NJ: Prentice Hall, 1993.
  10. A. Jaekel, Y. Chen, “Demand allocation without wavelength conversion under a sliding scheduled traffic model,” in 4th Int. Conf. on Broadband Communications, Networks and Systems, 2007. BROADNETS 2007, Raleigh, NC, Sept. 10–14, 2007, pp. 495–503.
  11. C. V. Saradhi, M. Gurusamy, “Scheduling and routing of sliding scheduled lightpath demands in WDM optical networks,” in Conf. on Optical Fiber Communication and Nat. Fiber Optic Engineers Conf., 2007. OFC/NFOEC 2007, Anaheim, CA, March 25–29, 2007, pp. 1–3.
  12. D. Andrei, M. Tornatore, D. Ghosal, C. Martel, B. Mukherjee, “On-demand provisioning of data-aggregation requests over WDM mesh networks,” in IEEE Global Telecommunications Conf., 2008. IEEE GLOBECOM 2008, New Orleans, LA, Nov. 30–Dec. 4, 2008, pp. 1–5.
  13. R. A. Guerin, A. Orda, “Networks with advance reservations: the routing perspective,” in Proc. IEEE INFOCOM 2000. 19th Annu. Joint Conf. of the IEEE Computer and Communications Societies, Tel Aviv, Israel, March 26–30, 2000, vol. 1, pp. 118–127.
  14. J. Zheng, H. Mouftah, “Routing and wavelength assignment for advance reservation in wavelength-routed WDM optical networks,” in IEEE Int. Conf. on Communications, ICC 2002, Apr. 28–May 2, 2002, vol. 5, pp. 2722–2726.
  15. C. V. Saradhi, M. Gurusamy, R. Piesiewicz, “Routing fault-tolerant sliding scheduled traffic in WDM optical mesh networks,” in 5th Int. Conf. on Broadband Communications, Networks and Systems, 2008. BROADNETS 2008, London, Sept. 8–11, 2008, pp. 197–202. [CrossRef]
  16. A. Jaekel, “Lightpath scheduling and allocation under a flexible scheduled traffic model,” in IEEE Global Telecommunications Conf., 2006. GLOBECOM '06, San Francisco, CA, Nov. 27–Dec. 1, 2006, pp. 1–5.
  17. W. Su, G. Sasaki, C.-F. Su, A. Balasubramanian, “Scheduling of periodic connections with flexibility,” Opt. Switching Networking, vol. 3, pp. 158–172, Dec. 2006. [CrossRef]
  18. H. H. Yen, F. Y. Lin, “Near-optimal tree-based access network design,” Comput. Commun., vol. 28, pp. 236–245, Feb. 2005. [CrossRef]
  19. J. Yen, “Finding the K shortest loopless paths in a network,” Manage. Sci., vol. 17, no. 11, pp. 712–716, July 1971. [CrossRef]
  20. ILOG CPLEX version 9.0, http://www.ilog.com/products/cplex/.
  21. D. Andrei, H. H. Yen, M. Tornatore, “Integrated design for sliding scheduled traffic in WDM networks,” in Optical Fiber Communication Conf., OSA Technical Digest (CD), San Diego, CA, March 22–26, 2009, Washington, DC: Optical Society of America, 2009, paper OThO5.

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