Multi-commodity Flow Optimization Algorithm Among Multiple Communication Protocols

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.