Presentation | 2015-11-20 Characteristics of a distributed algorithm for balancing unsplittable flow with tie-sets Masashi Yamada, Genya Ishigaki, Norihiko Shinomiya, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | The demand for traffic engineering to alleviate load concentrations on links has increased for large-scale networks such as data center networks. In this paper, a communication network is modeled as a graph, and a balancing problem of an unsplittable flow which has a fixed pair of source and destination is formulated in the graph. An existing method using a set of edges that form a cycle structure called a tie-set is applied to the unsplittable flow balancing problem. The proposed method is carried out by obtaining a combination of routes that minimizes the load factor of a cycle structure. Balancing of a whole network is achieved by repeating this process for each cycle structure. Our simulation result shows that this approach is more effective for larger graphs in terms of the balancing. The execution time for which our method completes the balancing is also evaluated. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | unsplittable flow / network flow problem / tie-set / graph theory |
Paper # | CAS2015-46,MSS2015-20 |
Date of Issue | 2015-11-13 (CAS, MSS) |
Conference Information | |
Committee | MSS / CAS / IPSJ-AL |
---|---|
Conference Date | 2015/11/20(2days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | Ibusuki CityHall |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | Satoshi Yamane(Kanazawa Univ.) / Satoshi Tanaka(Murata) |
Vice Chair | Morikazu Nakamura(Univ. of Ryukyus) / Toshihiko Takahashi(Niigata Univ.) |
Secretary | Morikazu Nakamura(Yamaguchi Univ.) / Toshihiko Takahashi(Toshiba) / (Hitachi) |
Assistant | Hideki Kinjo(Okinawa Univ.) / Toshihiro Tachibana(Shonan Inst. of Tech.) / Yohei Nakamura(Hitachi) |
Paper Information | |
Registration To | Technical Committee on Mathematical Systems Science and its applications / Technical Committee on Circuits and Systems / Special Interest Group on Algorithms |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Characteristics of a distributed algorithm for balancing unsplittable flow with tie-sets |
Sub Title (in English) | |
Keyword(1) | unsplittable flow |
Keyword(2) | network flow problem |
Keyword(3) | tie-set |
Keyword(4) | graph theory |
1st Author's Name | Masashi Yamada |
1st Author's Affiliation | Soka University(Soka Univ.) |
2nd Author's Name | Genya Ishigaki |
2nd Author's Affiliation | Soka University(Soka Univ.) |
3rd Author's Name | Norihiko Shinomiya |
3rd Author's Affiliation | Soka University(Soka Univ.) |
Date | 2015-11-20 |
Paper # | CAS2015-46,MSS2015-20 |
Volume (vol) | vol.115 |
Number (no) | CAS-315,MSS-316 |
Page | pp.pp.15-20(CAS), pp.15-20(MSS), |
#Pages | 6 |
Date of Issue | 2015-11-13 (CAS, MSS) |