Cycle-based local update method for minimizing maximal edge-load factor on unsplittable multicommodity flow problem

• Item type: SIG Technical Reports(1)
• 公開日: 2021-11-11
• タイトル: Cycle-based local update method for minimizing maximal edge-load factor on unsplittable multicommodity flow problem
• タイトル / 言語: en
• タイトル: Cycle-based local update method for minimizing maximal edge-load factor on unsplittable multicommodity flow problem
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Graduate School of Engineering, Soka University
• 著者所属: Graduate School of Engineering, Soka University
• 著者所属(英): en
• 著者所属(英): Graduate School of Engineering, Soka University
• 著者所属(英): en
• 著者所属(英): Graduate School of Engineering, Soka University
• 著者名: Fumiya, Onogi; Norihiko, Shinomiya
• 著者名(英): Fumiya, Onogi; Norihiko, Shinomiya
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: 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.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: 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.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN1009593X
• 書誌情報: 研究報告アルゴリズム（AL）; 巻 2021-AL-185, 号 4, p. 1-4, 発行日 2021-11-11
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 2188-8566
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会