2026-03-12T11:37:57Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00213765 2025-01-19T17:01:54Z 1164:2592:10486:10744

Cycle-based local update method for minimizing maximal edge-load factor on unsplittable multicommodity flow problem Cycle-based local update method for minimizing maximal edge-load factor on unsplittable multicommodity flow problem Fumiya, Onogi Norihiko, Shinomiya Fumiya, Onogi Norihiko, Shinomiya Accelerating the development of information network services such as cloud applications and multimedia communication, maximizing network resource utilization is strongly desired. Moreover, communication quality requires to avoid the congestion leading to cumulative damages caused by packet reordering. Thus, QoS routing in an information communication network is essential. The unsplittable multicommodity network flow problem has been discussed in the past 20 years for proposing the design of QoS routing. The researchers prove that this problem is NP-hard and proposed many approximation and heuristic algorithms. However, the proposed methods cannot be easily applied to the existing SDN system architecture for a massive network. Our previous work proposed the cycle-based operation that prepares the detouring route against each edge for fault recovery. This operation is applicable for local congestion control, and its performance was analyzed by the reduction to the Ring loading problem. Applying to an iterated local search following the scenario of dynamic congestion control, we examine the performance of this cycle-based method for a massive network. Accelerating the development of information network services such as cloud applications and multimedia communication, maximizing network resource utilization is strongly desired. Moreover, communication quality requires to avoid the congestion leading to cumulative damages caused by packet reordering. Thus, QoS routing in an information communication network is essential. The unsplittable multicommodity network flow problem has been discussed in the past 20 years for proposing the design of QoS routing. The researchers prove that this problem is NP-hard and proposed many approximation and heuristic algorithms. However, the proposed methods cannot be easily applied to the existing SDN system architecture for a massive network. Our previous work proposed the cycle-based operation that prepares the detouring route against each edge for fault recovery. This operation is applicable for local congestion control, and its performance was analyzed by the reduction to the Ring loading problem. Applying to an iterated local search following the scenario of dynamic congestion control, we examine the performance of this cycle-based method for a massive network. technical report 情報処理学会 2021-11-11 application/pdf 研究報告アルゴリズム（AL） 4 2021-AL-185 1 4 2188-8566 AN1009593X https://ipsj.ixsq.nii.ac.jp/record/213765/files/IPSJ-AL21185004.pdf eng