Skip to main content
SpringerLink
Log in

Optimized dimensioning of resilient optical grids with respect to grade of services

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

An optical grid network geographically integrates distributed computing/information resources with high speed communications. Network dimensioning, maximization of services, and job scheduling are some of today key arising issues in optical grids. Since the last decade, many projects have been conducted in order to provide computational and information facilities in the academic as well as in the business communities. In this paper, we study the network dimensioning and the maximization of IT services in optical grids.

We propose a scalable optimization model for maximizing IT services under link transport capacities. We assume the use of the anycast routing principle to identify the server nodes for executing the jobs, and a shared path protection mechanism in order to offer protection against single link/node failures. We also investigate different calculation methods of the link transport capacities in order to maximize the grade of services, while taking into account the bandwidth requirements.

Computational results are presented on different traffic distributions. They show that the proposed link dimensioning can save more than 35 % bandwidth in optical grid networks, in comparison with the classical link dimensioning strategies. We also investigate the different protection schemes against single link failures, single node failures, single node and server node failures, and compare their bandwidth requirements, as well as their impact on the grade of services (GoS). Results show that there is no significant increase of the bandwidth requirements and no meaningful impact on the GoS when moving from a single link protection scheme to a single node (including server nodes) protection scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. There might be some degeneracy, preventing from strictly improving the value of the objective function of the RMP at each iteration.

References

  1. Baldine, I., Yufeng, X., Mandal, A., Renci, C., Chase, U., Marupadi, V., Yumerefendi, A., & Irwin, D. (2010). Networked cloud orchestration: a GENI perspective. In IEEE global telecommunications conference—GLOBECOM (pp. 573–578).

    Google Scholar 

  2. Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., & Vance, P. (1998). Branch-and-price: column generation for solving huge integer programs. Operations Research, 46(3), 316–329.

    Article  Google Scholar 

  3. Buysse, J., Leenheer, M. D., Develder, C., & Dhoedt, B. (2009). Exploiting relocation to reduce network dimensions of resilient optical grids. In Proceedings of IEEE/VDE workshop on design of reliable communication networks—DRCN.

    Google Scholar 

  4. Buysse, J., Leenheer, M. D., Dhoedt, B., & Develder, C. (2010). On the impact of relocation on network dimensions in resilient optical grids. In Optical network design and modeling—ONDM.

    Google Scholar 

  5. Charbonneau, N., & Vokkarane, V. (2011). A survey of advance reservation routing and wavelength assignment in wavelength-routed WDM networks. IEEE Communications Surveys & Tutorials, 1–28.

  6. Chtepen, M., Claeys, F., Dhoedt, B., Turck, F., Demeester, P., & Vanrolleghem, P. (2009). Adaptive task checkpointing and replication: toward efficient fault-tolerant grids. IEEE Transactions on Parallel and Distributed Systems, 20(2), 180–190.

    Article  Google Scholar 

  7. Chvatal, V. (1983). Linear programming. New York: Freeman.

    Google Scholar 

  8. DeFanti, T., Brown, M., Leigh, J., Yu, O., He, E., Mambretti, J., Liillethun, D., & Weinberger, J. (2003). Optical switching middleware for the optiputer. IEICE Transactions Fundamentals/Communication/Electronics/Ingénierie & Systems, E86-B(8), 2263–2272.

    Google Scholar 

  9. Din, D. R. (2005). Anycast routing and wavelength assignment problem on WDM network. IEICE Transactions on Communications, E88-B(10), 3941–3951.

    Article  Google Scholar 

  10. Din, D. R. (2007). A hybrid method for solving ARWA problem on WDM network. Journal of Computer Communications, 30, 385–395.

    Article  Google Scholar 

  11. Foster, I. & Kesselman, C. (Eds.) (2004). The grid: blueprint for a new computing infrastructure (2nd ed.). San Francisco: Morgan Kaufmann.

    Google Scholar 

  12. Gladysz, J., & Walkowiak, K. (2009). Modeling of survivable network design problems with simultaneous unicast and anycast flows. In 2nd international symposium on Logistics and Industrial Informatics (LINDI), Linz, Austria (pp. 75–80).

    Google Scholar 

  13. Isazadeh, A., & Heydarian, M. (2012). Distributed multicast multichannel paths. Telecommunications Systems, 50, 55–70.

    Article  Google Scholar 

  14. Jaumard, B., Buysse, J., Shaikh, A., Leenheer, M., & Develder, C. (2010). Column generation for dimensioning resilient optical grid networks exploiting relocation. In IEEE global telecommunications conference—GLOBECOM.

    Google Scholar 

  15. Jaumard, B., Meyer, C., & Thiongane, B. (2006). ILP formulations for the RWA problem for symmetrical systems. In P. Pardalos & M. Resende (Eds.), Handbook for optimization in telecommunications (pp. 637–678). Norwell: Kluwer Academic. Chap 23.

    Chapter  Google Scholar 

  16. Jaumard, B., Meyer, C., & Thiongane, B. (2007). Comparison of ILP formulations for the RWA problem. Optical Switching and Networking, 4(3–4), 157–172.

    Article  Google Scholar 

  17. Jaumard, B., Meyer, C., & Thiongane, B. (2009). On column generation formulations for the RWA problem. Discrete Applied Mathematics, 157, 1291–1308.

    Article  Google Scholar 

  18. Juttner, A., Cinkler, T., & Dezso, B. (2007). A randomized cost smoothing approach for optical network design. In 9th international conference on transparent optical networks (ICTON) (pp. 75–78).

    Google Scholar 

  19. Lasdon, L. (1970). Optimization theory for large systems. New York: Macmillan Co.

    Google Scholar 

  20. Medeiros, R., Cirne, W., Brasileiro, F., & Sauve, J. (2002). Faults in grids: why are they so bad and what can be done about it. In Fourth international workshop on grid computing (pp. 2722–2726).

    Google Scholar 

  21. Orlowski, S., Pióro, M., Tomaszewski, A., & Wessäly, R. (2007). SNDlib 1.0–Survivable Network Design Library. In Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium.

    Google Scholar 

  22. Rak, J., & Walkowiak, K. (2011). Reliable anycast and unicast routing: protection against attacks. Telecommunications Systems, 40(1–2), 1–18.

    Google Scholar 

  23. Shaikh, A., Buysse, J., Jaumard, B., & Develder, C. (2011). Anycast routing for survivable optical grids: scalable solution methods and the impact of relocation. Journal of Optical Communications and Networking, 3, 767–779.

    Article  Google Scholar 

  24. Speitkamp, B., & Bichler, M. (2010). A mathematical programming approach for server consolidation problems in virtualized data centers. IEEE Transactions on Services Computing, 3, 266–278.

    Article  Google Scholar 

  25. Vicat-Blanc, P. P., Soudan, S., & Verchere, D. (2009). Virtualizing and scheduling optical network infrastructure for emerging IT services. Journal of Optical Communications and Networking, 1, A121–A132.

    Article  Google Scholar 

  26. Walkowiak, K., & Rak, J. (2010). Joint optimization of anycast and unicast flows in survivable optical networks. In 14th international telecommunications network strategy and planning symposium (NETWORKS) (pp. 1–6).

    Chapter  Google Scholar 

  27. Wu, J., Zhang, J., & Savoie, M. (2011). Lightpath scheduling and routing for green data centres. Telecommunication Systems, 1–14.

  28. Wu, R., & Ji, Y. (2009). Application-driven network resource scheduling scheme for real-time multimedia in optical grids. In Communication and networking in China, ChinaCom-2009 (pp. 1–5).

    Google Scholar 

  29. Xiao, H., Wu, H., & Chi, X. S. C. (2009). Grid environment for scientific computing. Networks for Grid Applications (pp. 35–42).

  30. Zang, H., Ou, C., & Mukherjee, B. (2003). Path-protection routing and wavelength assignment RWA in WDM mesh networks under duct-layer constraints. IEEE/ACM Transactions on Networking, 11(2), 248–258.

    Article  Google Scholar 

  31. Zheng, J., & Mouftah, H. (2002). Routing and wavelength assignment for advance reservation in wavelength-routed WDM optical networks. In IEEE international conference on communications—ICC (pp. 2722–2726).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CSE, Concordia University, Montreal, QC, Canada

    Ali Shaikh & Brigitte Jaumard

  2. CURC Chair (Tier I) on the Optimization of Communication Networks, Montreal, QC, Canada

    Brigitte Jaumard

Authors
  1. Ali Shaikh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Brigitte Jaumard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Brigitte Jaumard.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shaikh, A., Jaumard, B. Optimized dimensioning of resilient optical grids with respect to grade of services. Telecommun Syst 56, 189–200 (2014). https://doi.org/10.1007/s11235-013-9828-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-013-9828-5

Keywords

Search

Navigation