### Abstract

Deploying caches on a network is an effective way to reduce the amount of data transmitted in a network. Recently, in an academic backbone network such as SINET (the Science Information Network) in Japan, the amount of transmitted data has significantly increased. It is desired to design an efficient mechanism to allocate caches in an optimal way. In this paper, we begin by formulating a discrete optimization model to find a cache allocation that minimizes the total transmission cost. We then design two efficient algorithms to solve our proposed model. The first one makes use of the fact that a backbone network has small treewidth. The algorithm runs in polynomial time when the number of items is fixed and a graph has a bounded treewidth. The other one reduces the problem to the minimum-cost flow problem under the practical assumption that each item has at most one copy. This yields a polynomial-time combinatorial algorithm. Our numerical experiments on the real SINET network show that our algorithms can solve the cache placement problem efficiently in practice.

Original language | English |
---|---|

Pages (from-to) | 197-216 |

Number of pages | 20 |

Journal | Journal of the Operations Research Society of Japan |

Volume | 61 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2018 Apr 1 |

### Fingerprint

### Keywords

- Combinatorial optimization
- Facility planning
- Graph theory

### ASJC Scopus subject areas

- Decision Sciences(all)
- Management Science and Operations Research

### Cite this

*Journal of the Operations Research Society of Japan*,

*61*(2), 197-216. https://doi.org/10.15807/jorsj.61.197

**Optimal cache placement for an academic backbone network.** / Hau, Than Nguyen; Kakimura, Naonori; Kawarabayashi, Ken Ichi; Kobayashi, Yusuke; Matsuoka, Tatsuya; Yokoi, Yu.

Research output: Contribution to journal › Article

*Journal of the Operations Research Society of Japan*, vol. 61, no. 2, pp. 197-216. https://doi.org/10.15807/jorsj.61.197

}

TY - JOUR

T1 - Optimal cache placement for an academic backbone network

AU - Hau, Than Nguyen

AU - Kakimura, Naonori

AU - Kawarabayashi, Ken Ichi

AU - Kobayashi, Yusuke

AU - Matsuoka, Tatsuya

AU - Yokoi, Yu

PY - 2018/4/1

Y1 - 2018/4/1

N2 - Deploying caches on a network is an effective way to reduce the amount of data transmitted in a network. Recently, in an academic backbone network such as SINET (the Science Information Network) in Japan, the amount of transmitted data has significantly increased. It is desired to design an efficient mechanism to allocate caches in an optimal way. In this paper, we begin by formulating a discrete optimization model to find a cache allocation that minimizes the total transmission cost. We then design two efficient algorithms to solve our proposed model. The first one makes use of the fact that a backbone network has small treewidth. The algorithm runs in polynomial time when the number of items is fixed and a graph has a bounded treewidth. The other one reduces the problem to the minimum-cost flow problem under the practical assumption that each item has at most one copy. This yields a polynomial-time combinatorial algorithm. Our numerical experiments on the real SINET network show that our algorithms can solve the cache placement problem efficiently in practice.

AB - Deploying caches on a network is an effective way to reduce the amount of data transmitted in a network. Recently, in an academic backbone network such as SINET (the Science Information Network) in Japan, the amount of transmitted data has significantly increased. It is desired to design an efficient mechanism to allocate caches in an optimal way. In this paper, we begin by formulating a discrete optimization model to find a cache allocation that minimizes the total transmission cost. We then design two efficient algorithms to solve our proposed model. The first one makes use of the fact that a backbone network has small treewidth. The algorithm runs in polynomial time when the number of items is fixed and a graph has a bounded treewidth. The other one reduces the problem to the minimum-cost flow problem under the practical assumption that each item has at most one copy. This yields a polynomial-time combinatorial algorithm. Our numerical experiments on the real SINET network show that our algorithms can solve the cache placement problem efficiently in practice.

KW - Combinatorial optimization

KW - Facility planning

KW - Graph theory

UR - http://www.scopus.com/inward/record.url?scp=85045921071&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85045921071&partnerID=8YFLogxK

U2 - 10.15807/jorsj.61.197

DO - 10.15807/jorsj.61.197

M3 - Article

AN - SCOPUS:85045921071

VL - 61

SP - 197

EP - 216

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

SN - 0453-4514

IS - 2

ER -