IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v35y2025i3ne70017.html
   My bibliography  Save this article

Traffic Engineering Optimization in Hybrid Software‐Defined Networks: A Mixed Integer Non‐Linear Programming Model and Heuristic Algorithm

Author

Listed:
  • Samiullah Mehraban
  • Rajesh K. Yadav

Abstract

In contemporary networking infrastructure, the integration of software‐defined networking (SDN) concepts with traditional networking methodologies has given rise to hybrid software‐defined networking (HSDN); as the current network infrastructure evolves, it combines the programmability of SDN with the established protocols of traditional network infrastructure. This paradigm shift introduces novel opportunities and challenges in traffic engineering (TE), necessitating innovative solutions to enhance network performance, resource utilization, and efficiency. In this study, we examined the challenges associated with TE in a hybrid SDN environment, where traditional network devices coexist alongside SDN nodes; we investigated the routing optimization of traffic engineering in a migrated hybrid network and formulated the problem as a mixed integer non‐linear programming model. We proposed a heuristic algorithm (H‐STE) that optimizes both the OSPF weight setting and the splitting ratio of SDN nodes in the hybrid environment. Extensive evaluations were conducted using real network topologies to validate our method. The results demonstrate that a 30% deployment ratio of SDN nodes significantly improves traffic engineering performance. Specifically, the Maximum Link Utilization (MLU) stabilizes at this ratio, indicating near‐optimal network efficiency. This research provides valuable insights for researchers, practitioners, and network architects navigating SDN, hybrid SDN, and traffic engineering optimization.

Suggested Citation

  • Samiullah Mehraban & Rajesh K. Yadav, 2025. "Traffic Engineering Optimization in Hybrid Software‐Defined Networks: A Mixed Integer Non‐Linear Programming Model and Heuristic Algorithm," International Journal of Network Management, John Wiley & Sons, vol. 35(3), May.
  • Handle: RePEc:wly:intnem:v:35:y:2025:i:3:n:e70017
    DOI: 10.1002/nem.70017
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.70017
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.70017?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:intnem:v:35:y:2025:i:3:n:e70017. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.