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. 11 — Nov. 1, 2013
  • pp: 1215–1226

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

Hui Ding, Pan Yi, and Byrav Ramamurthy  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 5, Issue 11, pp. 1215-1226 (2013)
http://dx.doi.org/10.1364/JOCN.5.001215


View Full Text Article

Enhanced HTML    Acrobat PDF (867 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

Connection requests for data-intensive applications can require a specific start time and end time/duration when they are submitted. With the additional time domain information, cost-efficient connections can be established. In this paper, we propose two capital expenditure (CapEx) optimized approaches: the multilayer (ML) approach and a transponder/regenerator reuse (TRR) approach. Integer linear programming (ILP) is used to formulate the routing, wavelength assignment, and regenerator/multiplexer placement problem in a complex multilayer optical network to provide lower bounds for the optimized CapEx value. Due to the time and space complexity of ILP when it deals with large networks and traffic demands, we also propose a greedy heuristic and a tabu-search (TS) heuristic to solve the same problem in a less time- and resource-consuming manner. Finally, we compare the results in terms of computing time and optimized CapEx value across the ILP, greedy heuristic, and TS heuristic methods with the ML approaches for the Internet2 topology and a six-node ring topology. The performance of all three methods with the TRR approach is also tested with the same input traffic, which is composed of a mix of 10, 40, and 100 Gbps demands. The results show 30%–40% less CapEx when comparing ML with TRR. Further, our TS heuristic performs better than the greedy heuristic, and it can achieve near-optimal results compared to the ILPs.

© 2013 Optical Society of America

OCIS Codes
(060.4510) Fiber optics and optical communications : Optical communications
(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms
(060.4256) Fiber optics and optical communications : Networks, network optimization

ToC Category:
Research Papers

History
Original Manuscript: May 1, 2013
Revised Manuscript: July 27, 2013
Manuscript Accepted: August 16, 2013
Published: October 23, 2013

Citation
Hui Ding, Pan Yi, and Byrav Ramamurthy, "Cost-Optimized Reservation and Routing for Scheduled Traffic in Optical Networks," J. Opt. Commun. Netw. 5, 1215-1226 (2013)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-5-11-1215


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. B. Ramamurthy, K. K. Ramakrishnan, and R. K. Sinha, “Cost and reliability considerations in designing the next-generation IP over WDM backbone networks,” in Proc. 20th Int. Conf. on Computer Communications and Networks (ICCCN), Aug. 2011, pp. 1–6.
  2. I. Kaminow, T. Li, and A. E. Willner, Optical Fiber Telecommunications VB: Systems and Networks. Academic, 2010.
  3. R. Jensen, “Optical switch architectures for emerging colorless/directionless/contentionless ROADM networks,” in Optical Fiber Communication Conf., 2011, paper OThR3.
  4. A. M. Clarke, A. Borghesani, D. W. Smith, P. Ossieur, P. Townsend, R. Jensen, and N. Parsons, “Demonstration of wavelength agile metro node using reflective colorless components,” in Optical Fiber Communication Conf., 2011, paper OMN2.
  5. W. I. Way, “Optimum architecture for M×N multicast switch-based colorless, directionless, contentionless, and flexible-grid ROADM,” in National Fiber Optic Engineers Conf., 2012, paper NW3F.5.
  6. B. Sai Kishore, P. Ganesan, K. Sandesha, A. Devarajan, K. Venkataramaniah, R. Johnson, and P. Voruganti, “CAPEX minimization through node degree reduction in a colorless and directionless ROADM architecture for flexible optical networks,” Opt. Switching Networking, vol.  7, pp. 141–152, 2010.
  7. Y. Li, L. Gao, G. Shen, and L. Peng, “Impact of ROADM colorless, directionless, and contentionless (CDC) features on optical network performance [invited],” J. Opt. Commun. Netw., vol.  4, no. 11, pp. B58–B67, 2012. [CrossRef]
  8. K. Thompson, G. J. Miller, and R. Wilder, “Wide-area Internet traffic patterns and characteristics,” IEEE Netw., vol.  11, no. 6, pp. 10–23, 1997. [CrossRef]
  9. D. Xu, G. Li, B. Ramamurthy, A. Chiu, D. Wang, and R. Doverspike, “SRLG-diverse routing of multiple circuits in a heterogeneous optical transport network,” in 8th Int. Workshop on the Design of Reliable Communication Networks (DRCN), Oct. 2011, pp. 180–187.
  10. A. N. Patel, C. Gao, J. P. Jue, X. Wang, Q. Zhang, P. Palacharla, and T. Naito, “Cost efficient traffic grooming and regenerator placement in impairment-aware optical WDM networks,” Opt. Switching Networking, vol.  9, no. 3, pp. 225–239, 2012.
  11. D. Shen, G. Li, A. Chiu, D.-m. Hwang, D. Xu, D. Wang, C.-K. Chan, and R. Doverspike, “On multiplexing optimization in DWDM networks,” in Optical Fiber Communication Conf., 2011, paper OTuR3.
  12. W. Hou, L. Guo, X. Wei, and X. Gong, “Multi-granularity and robust grooming in power-and port-cost-efficient IP over WDM networks,” Comput. Netw., vol.  56, no. 10, pp. 2383–2399, 2012. [CrossRef]
  13. A. Somani, Survivability and Traffic Grooming in WDM Optical Networks. Cambridge University, 2006.
  14. R. Dutta, A. E. Kamal, and G. N. Rouskas, Traffic Grooming for Optical Networks: Foundations, Techniques, and Frontiers.Springer, 2008.
  15. J. López Vizcíano, Y. Ye, and I. Tafur Monroy, “Energy efficiency analysis for flexible-grid OFDM-based optical networks,” Comput. Netw., vol.  56, no. 10, pp. 2400–2419, 2012. [CrossRef]
  16. A. Castro, L. Velasco, M. Ruiz, M. Klinkowski, J. P. Fernández-Palacios, and D. Careglio, “Dynamic routing and spectrum (re)allocation in future flexgrid optical networks,” Comput. Netw., vol.  56, no. 12, pp. 2869–2883, 2012. [CrossRef]
  17. E. Palkopoulou, C. Meusburger, D. Schupke, L. Wosinska, and T. Bauschert, “Combining multi-period and multi-layer network planning: Ignored potential,” in 36th European Conf. and Exhibition on Optical Communication (ECOC), Sept. 2010, pp. 1–3.
  18. P. Angu and B. Ramamurthy, “Continuous and parallel optimization of dynamic bandwidth scheduling in WDM networks,” in IEEE Global Telecommunications Conf. (GLOBECOM 2010), 2010, pp. 1–6.
  19. N. Charbonneau, V. Vokkarane, C. Guok, and I. Monga, “Advance reservation frameworks in hybrid IP-WDM networks,” IEEE Commun. Mag., vol.  49, no. 5, pp. 132–139, 2011. [CrossRef]
  20. C. Xie, F. Xu, N. Ghani, E. Chaniotakis, C. Guok, and T. Lehman, “Load-balancing for advance reservation connection rerouting,” IEEE Commun. Lett., vol.  14, no. 6, pp. 578–580, 2010. [CrossRef]
  21. T. Wallace, A. Shami, and C. Assi, “Advance lightpath reservation for WDM networks with dynamic traffic,” J. Opt. Netw., vol.  6, no. 7, pp. 913–924, 2007. [CrossRef]
  22. N. Charbonneau and V. M. Vokkarane, “A survey of advance reservation routing and wavelength assignment in wavelength-routed WDM networks,” IEEE Commun. Surveys Tutorials, vol.  14, no. 4, pp. 1037–1064, 2012. [CrossRef]
  23. W. Lu and Z. Zhu, “Dynamic service provisioning of advance reservation requests in elastic optical networks,” J. Lightwave Technol., vol.  31, no. 10, pp. 1621–1627, 2013. [CrossRef]
  24. H. Ding, P. Yi, and B. Ramamurthy, “CAPEX optimized routing for scheduled traffic in multi-layer optical networks,” in 19th IEEE Int. Workshop on Local and Metropolitan Area Networks, 2013, pp. 1–6.
  25. B. Ramamurthy, R. K. Sinha, and K. K. Ramakrishnan, “Multi-layer design of IP over WDM backbone networks: Impact on cost and survivability,” in DRCN, Budapest, Hungary, 2013.
  26. T. Wuth, M. W. Chbat, and V. F. Kamalov, “Multi-rate (100G/40G/10G) transport over deployed optical networks,” in Optical Fiber Communication Conf. and the Nat. Fiber Optic Engineers Conf. (OFC/NFOEC), 2008, pp. 1–9.
  27. R. Huelsermann, M. Gunkel, C. Meusburger, and D. A. Schupke, “Cost modeling and evaluation of capital expenditures in optical multilayer networks,” J. Opt. Netw., vol.  7, no. 9, pp. 814–833, Sept. 2008.
  28. J. Simmons, Optical Network Design and Planning. Springer, 2008.
  29. R. Ramaswami and K. N. Sivarajan, “Routing and wavelength assignment in all-optical networks,” IEEE/ACM Trans. Netw., vol.  3, no. 5, pp. 489–500, 1995. [CrossRef]
  30. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms.MIT & McGraw-Hill, 2011.
  31. E. Q. Martins and M. M. Pascoal, “A new implementation of Yens ranking loopless paths algorithm,” Q. J. Belgian, French Ital. Oper. Res. Soc., vol.  1, no. 2, pp. 121–133, 2003. [CrossRef]
  32. F. Glover and C. McMillan, “The general employee scheduling problem: An integration of MS and A,” Comput. Oper. Res., vol.  13, pp. 563–573, May 1986, Special Issue on Applications of Integer Programming. [CrossRef]
  33. S. Zhang and B. Ramamurthy, “Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks,” IEEE J. Sel. Areas Commun., vol.  21, no. 7, pp. 1165–1172, 2003. [CrossRef]
  34. B. Wang, T. Li, X. Luo, Y. Fan, and C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in 2nd Int. Conf. Broadband Networks (BroadNets), 2005, pp. 13–22.
  35. Internet2 Network [Online]. Available: http://www.internet2.edu/network/ .
  36. IBM ILOG CPLEX [Online]. Available: http://www-01.ibm.com/software/integration/optimization/cplex-optimization-studio/ .

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