Skip to main content
SpringerLink
Log in

An optimal and a heuristic algorithm for solving the route and spectrum allocation problem in OFDM networks

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

Orthogonal frequency division multiplexing (OFDM) has recently emerged as a promising technology. A network using OFDM- based spectrum-sliced elastic optical path (SLICE) has a higher spectrum efficiency, due to the fine granularity of subcarrier frequencies used. To minimize the utilized spectrum in SLICE networks, the routing and spectrum allocation problem (RSA) has to be efficiently solved. We have solved the RSA problem using a mixed integer linear programming formulation and have compared our approaches with another recent formulation.

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

Similar content being viewed by others

Notes

  1. We were limited to networks with 15 or fewer nodes since, for larger networks, the formulations often fail to converge, within a reasonable time.

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ (1993)

    MATH  Google Scholar 

  2. Bandyopadhyay, S.: Dissemination of Information in Optical Networks: From Technology to Algorithms. Springer, Berlin (2008)

    Google Scholar 

  3. Christodoulopoulos, K., Tomkos, I., Varvarigos, E.A.: Routing and Spectrum Allocation in OFDM-Based Optical Networks with Elastic Bandwidth Allocation, pp. 1–6. Globecom (2010)

  4. Jinno, M., Kozicki, B., Takara, H., Watanabe, A., Sone, Y., Tanaka, T., Hirano, A.: Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network. In: IEEE Communications Magazine, pp. 138–145 (2010)

  5. Klinkowski, M.: A genetic algorithm for solving RSA problem in elastic optical networks with dedicated path protection. In: International Joint Conference CISIS’12-ICEUTE 12-SOCO, pp. 167–176 (2013)

  6. Klinkowski, M., Walkowiak, K.: Routing and spectrum assignment in spectrum sliced elastic optical path network. In: IEEE Communications Letters, pp. 884–886 (2011)

  7. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)

    Book  MATH  Google Scholar 

  8. Shirazipourazad, S., Zhou, C., Derakhshandeh, Z., Sen, A.: On routing and spectrum allocation in spectrum-sliced optical networks. In: IEEE INFOCOM, pp. 385–389 (2013)

  9. Wang, Y., Cao, X., Hu, Q.: Routing and Spectrum Allocation in Spectrum-Sliced Elastic Optical Path Networks, pp. 1–5. ICC (2011)

  10. Wang, Y., Cao, X., Pan, Y.: A Study of the Routing and Spectrum Allocation in Spectrum-SlicedElastic Optical Path Networks, pp. 1503–1511. INFOCOM (2011)

  11. Yen, J.Y.: Finding the \(k\)-Shortest Loopless Paths in a Network, pp. 712–716. Management Science (1971)

  12. Zhang, G., De Leenheer, M., Morea, A., Mukherjee, B.: A survey on ofdm-based elastic core optical networking. In: IEEE Communications Surveys Tutorials (2013)

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Windsor, 401 Sunset Avenue, Windsor, N9B 3P4, Canada

    Arijit Paul, Quazi Rahman, Subir Bandyopadhyay & Yash P. Aneja

Authors
  1. Arijit Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Quazi Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Subir Bandyopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yash P. Aneja
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Subir Bandyopadhyay.

Additional information

This research was supported by discovery grants from the Natural Sciences and Engineering Research Councils of Canada to S. Bandyopadhyay and to Y. P. Aneja.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Paul, A., Rahman, Q., Bandyopadhyay, S. et al. An optimal and a heuristic algorithm for solving the route and spectrum allocation problem in OFDM networks. Photon Netw Commun 30, 280–289 (2015). https://doi.org/10.1007/s11107-015-0516-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-015-0516-0

Keywords

Search

Navigation