| Presentation | 2023-01-27 An approximate solution using K-shortest paths for a communication link load balancing problem Himeno Takahashi, Daichi Shimizu, Norihiko Shinomiya, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In recent years, the amount of data traffic in information and communication networks has been increasing and the risk of congestion has been rising. In a previous study, the UELB problem was formulated to determine the flow that minimizes the maximum load factor of a link, with a goal of leveling the traffic load on the link in the network. Since this problem is NP-hard, an approximate solution method should be used. This paper proposes an approximate solution for the UELB problem using K-shortest paths as one of the heuristic methods. As a result, the proposed method reduces the amount of computational complexity and can find approximate solutions for any network structure. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Network flow / Load balancing / Graph theory / K-shortest path problem |
| Paper # | CQ2022-72 |
| Date of Issue | 2023-01-19 (CQ) |
| Conference Information | |
| Committee | CQ |
|---|---|
| Conference Date | 2023/1/26(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Epochal Tsukuba International Congress Center |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | AR/VR, Broadcasting Service, Video/Voice Services Quality, High Realistic, User Behavior/Psychology, User Experience, Media Quality, Network Quality and QoS Control, Networks and Communications at Disaster, Machine Learning, etc. |
| Chair | Jun Okamoto(NTT) |
| Vice Chair | Takefumi Hiraguri(Nippon Inst. of Tech.) / Gou Hasegawa(Tohoku Univ.) |
| Secretary | Takefumi Hiraguri(NTT) / Gou Hasegawa(Ritsumeikan Univ.) |
| Assistant | Kimiko Kawashima(NTT) / Ryo Nakamura(Fukuoka Univ.) / Toshiro Nakahira(NTT) / Kenta Tsukatsune(岡山理科大) |
| Paper Information | |
| Registration To | Technical Committee on Communication Quality |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An approximate solution using K-shortest paths for a communication link load balancing problem |
| Sub Title (in English) | |
| Keyword(1) | Network flow |
| Keyword(2) | Load balancing |
| Keyword(3) | Graph theory |
| Keyword(4) | K-shortest path problem |
| 1st Author's Name | Himeno Takahashi |
| 1st Author's Affiliation | Soka University(Soka Univ) |
| 2nd Author's Name | Daichi Shimizu |
| 2nd Author's Affiliation | Soka University(Soka Univ) |
| 3rd Author's Name | Norihiko Shinomiya |
| 3rd Author's Affiliation | Soka University(Soka Univ) |
| Date | 2023-01-27 |
| Paper # | CQ2022-72 |
| Volume (vol) | vol.122 |
| Number (no) | CQ-363 |
| Page | pp.pp.65-68(CQ), |
| #Pages | 4 |
| Date of Issue | 2023-01-19 (CQ) |