Multi-commodity Flow Optimization Algorithm Among Multiple Communication Protocols

Jianghao Sui, Jingchen Jiang, Xiang Shi, Minmin Liang, Fang Deng*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The effective traffic distributed solution is important to solve the dynamic network congestion problem. In this paper, we concentrate on the optimization problem of distributing traffic among multiple communication protocols in a network. The optimization objective is to minimize the maximum link utilization in the network to ensure network traffic balance. To solve the k-protocol multi-commodity network flow (k-MCF) problem, we propose a K-Protocol Network Flow Optimization (KPFNO) algorithm. In KPFNO, we apply the levy flight and elimination mechanism of the Cuckoo Search (CS) algorithm to search candidate solutions first. Then try to improve search efficiency through the designed adaptive neighborhood operators. In addition, we design the repair operator to avoid the waste of rational solution space. We provide experimental results and comparisons to show the advance and competitiveness of the method.

Original languageEnglish
Title of host publicationProceedings of the 36th Chinese Control and Decision Conference, CCDC 2024
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages6161-6166
Number of pages6
ISBN (Electronic)9798350387780
DOIs
Publication statusPublished - 2024
Event36th Chinese Control and Decision Conference, CCDC 2024 - Xi'an, China
Duration: 25 May 202427 May 2024

Publication series

NameProceedings of the 36th Chinese Control and Decision Conference, CCDC 2024

Conference

Conference36th Chinese Control and Decision Conference, CCDC 2024
Country/TerritoryChina
CityXi'an
Period25/05/2427/05/24

Keywords

  • Cuckoo search
  • K-protocol multi-commodity network flow
  • K-protocol network flow optimization
  • Minimize the maximum link utilization

Cite this