| Presentation | 2017-11-15 A Solution of Minimum Link Flow Problem with Sparse Modeling Ryotaro Matsuo, Ryo Nakamura, Hiroyuki Ohsaki, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In recent years, a statistical approach for estimating unobserved model parameters from a small number of observations utilizing the sparsity of model parameters called sparse modeling have been extensively studied. Although many applications of sparse modeling to practical problems have been investigated in the field of signal processing and image processing, to the best of our knowledge, there have been not many studies in the field of information networking. In this paper, we investigate how sparse modeling can be utilized to a network flow problem. More specifically, we focus on the minimum link flow problem which is similar to the classical minimum cost flow problem, but its objective is minimization of the number of links consisting the flow, rather than minimization of the total link costs. We present a sparse-modeling-based formulation of the minimum link flow problem and investigate how effectively our formulation of the minimum link flow problem can be solved with a conventional greedy algorithm called the OMP (Orthogonal Matching Pursuit) algorithm. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Sparse ModelingMinimum Link Flow ProblemNetwork FlowOMP (Orthogonal Matching Pursuit) |
| Paper # | IA2017-34 |
| Date of Issue | 2017-11-08 (IA) |
| Conference Information | |
| Committee | IA |
|---|---|
| Conference Date | 2017/11/15(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | KMITL, Bangkok, Thailand |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | IA2017 - Workshop on Internet Architecture and Applications 2017 |
| Chair | Katsuyoshi Iida(Hokkaido Univ.) |
| Vice Chair | Rei Atarashi(IIJ) / Hiroyuki Osaki(Kwansei Gakuin Univ.) / Tomoki Yoshihisa(Osaka Univ.) |
| Secretary | Rei Atarashi(Tokyo Metropolitan Univ.) / Hiroyuki Osaki(TOYOTA-IT) / Tomoki Yoshihisa |
| Assistant | Kenji Ohira(Tokushima Univ.) / Ryohei Banno(NTT) / Toshiki Watanabe(NEC) |
| Paper Information | |
| Registration To | Technical Committee on Internet Architecture |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Solution of Minimum Link Flow Problem with Sparse Modeling |
| Sub Title (in English) | Formulation and Preliminary Results |
| Keyword(1) | Sparse ModelingMinimum Link Flow ProblemNetwork FlowOMP (Orthogonal Matching Pursuit) |
| 1st Author's Name | Ryotaro Matsuo |
| 1st Author's Affiliation | Kwansei Gakuin University(Kwansei Gakuin Univ.) |
| 2nd Author's Name | Ryo Nakamura |
| 2nd Author's Affiliation | Kwansei Gakuin University(Kwansei Gakuin Univ.) |
| 3rd Author's Name | Hiroyuki Ohsaki |
| 3rd Author's Affiliation | Kwansei Gakuin University(Kwansei Gakuin Univ.) |
| Date | 2017-11-15 |
| Paper # | IA2017-34 |
| Volume (vol) | vol.117 |
| Number (no) | IA-299 |
| Page | pp.pp.23-26(IA), |
| #Pages | 4 |
| Date of Issue | 2017-11-08 (IA) |