Presentation | 2017-11-15 Comparing greedy-type algorithms for RSA problems of anycasting in elastic networks Yasutaka MIyagawa, Yosuke Watanabe, Maiko Shigeno, Kiyo Ishii, Atsuko Takefusa, Akiko Yoshise, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | The routing and spectrum allocation (RSA) problems need to be solved when we transmit some demands in an elastic optical network. This research deals with static RSA problems for anycast transmission which is one-to-one-of-many transmission in inter-datacenter networks. Two static RSA optimization models are considered. One is minimizing the maximum number of spectrum slots needed to allocate the given demands. The other is maximizing the traffic volume of demands served under the given spectrum slot number. For the both models, several greedy-type algorithms are investigated. We conducted computational experiments to confirm greedy-type algorithmic behaviors by each of selecting route criteria and by each of demand ordering policies. In our experimental results, the path selection criterion was important in the minimax slot number model and we conclude to have to select a shorter path under some slot conditions. In the maximum traffic volume model, there was no dominant of greedy-type algorithms. The best path selection criterion and the best demand ordering policy depended on the network and the traffic congestion level. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | routing and spectrum allocation / anycasting / elastic network / greedy algorithm |
Paper # | PN2017-28 |
Date of Issue | 2017-11-08 (PN) |
Conference Information | |
Committee | PN |
---|---|
Conference Date | 2017/11/15(2days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | Kogakuin Univ. |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | Elastic Optical Networks, Flexible Networks, Optical Network Control/Protocol, Transport SDN, IP Backbone, SDM, Mode Division Multiplexing, Photonic Network Devices, JPN Model, EXAT, etc. |
Chair | Hiroshi Hasegawa(Nagoya Univ.) |
Vice Chair | Haruki Ogoshi(Furukawa Electric) / Takehiro Tsuritani(KDDI Research) / Hideaki Furukawa(NICT) |
Secretary | Haruki Ogoshi(NICT) / Takehiro Tsuritani(Mitsubishi Electric) / Hideaki Furukawa |
Assistant | Masahiro Nakagawa(NTT) / Keijiro Suzuki(AIST) |
Paper Information | |
Registration To | Technical Committee on Photonic Network |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Comparing greedy-type algorithms for RSA problems of anycasting in elastic networks |
Sub Title (in English) | |
Keyword(1) | routing and spectrum allocation |
Keyword(2) | anycasting |
Keyword(3) | elastic network |
Keyword(4) | greedy algorithm |
1st Author's Name | Yasutaka MIyagawa |
1st Author's Affiliation | University of Tsukuba(Univ. Tsukuba) |
2nd Author's Name | Yosuke Watanabe |
2nd Author's Affiliation | University of Tsukuba(Univ. Tsukuba) |
3rd Author's Name | Maiko Shigeno |
3rd Author's Affiliation | University of Tsukuba(Univ. Tsukuba) |
4th Author's Name | Kiyo Ishii |
4th Author's Affiliation | National Institute of Advanced Industrial Science and Technology(AIST) |
5th Author's Name | Atsuko Takefusa |
5th Author's Affiliation | National Institute of Informatics(NII) |
6th Author's Name | Akiko Yoshise |
6th Author's Affiliation | University of Tsukuba(Univ. Tsukuba) |
Date | 2017-11-15 |
Paper # | PN2017-28 |
Volume (vol) | vol.117 |
Number (no) | PN-298 |
Page | pp.pp.1-8(PN), |
#Pages | 8 |
Date of Issue | 2017-11-08 (PN) |