Distributed GA for popularity based partial cache management in ICN

Alaa Mohammed A.a., Koji Okamura

Research output: Contribution to conferencePaper

Abstract

Information Centric Networks (ICNs) is a new architecture for the Future Internet to deliver content at large-scale. It relies on named data and caching features, which consists of storing content across the delivery path to serve forthcoming requests. In this paper, we study the problem of finding the optimal assignment of the objects in the available caches in ICN. The optimization problem is to cache objects in order to minimize overall network overhead. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. Metaheuristic methods are considered as effective methods for solving this problem, Genetic Algorithm (GA) is one of those algorithms that can solve this problem efficiently. We will adapt cache management system based on GA for solving the considered problem. In contrast to traditional locally caching systems this algorithm consider both global and local search and make caching decisions about where and which item will be cached in order to minimize overall network overhead.

Original languageEnglish
DOIs
Publication statusPublished - Jun 18 2014
Event9th International Conference on Future Internet Technologies, CFI 2014 - Tokyo, Japan
Duration: Jun 18 2014Jun 20 2014

Other

Other9th International Conference on Future Internet Technologies, CFI 2014
CountryJapan
CityTokyo
Period6/18/146/20/14

Fingerprint

Parallel algorithms
Genetic algorithms
Combinatorial optimization
Computational complexity
Internet

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Cite this

Mohammed A.a., A., & Okamura, K. (2014). Distributed GA for popularity based partial cache management in ICN. Paper presented at 9th International Conference on Future Internet Technologies, CFI 2014, Tokyo, Japan. https://doi.org/10.1145/2619287.2619305

Distributed GA for popularity based partial cache management in ICN. / Mohammed A.a., Alaa; Okamura, Koji.

2014. Paper presented at 9th International Conference on Future Internet Technologies, CFI 2014, Tokyo, Japan.

Research output: Contribution to conferencePaper

Mohammed A.a., A & Okamura, K 2014, 'Distributed GA for popularity based partial cache management in ICN', Paper presented at 9th International Conference on Future Internet Technologies, CFI 2014, Tokyo, Japan, 6/18/14 - 6/20/14. https://doi.org/10.1145/2619287.2619305
Mohammed A.a. A, Okamura K. Distributed GA for popularity based partial cache management in ICN. 2014. Paper presented at 9th International Conference on Future Internet Technologies, CFI 2014, Tokyo, Japan. https://doi.org/10.1145/2619287.2619305
Mohammed A.a., Alaa ; Okamura, Koji. / Distributed GA for popularity based partial cache management in ICN. Paper presented at 9th International Conference on Future Internet Technologies, CFI 2014, Tokyo, Japan.
@conference{127cc16125a647aeb92af40d2afc1628,
title = "Distributed GA for popularity based partial cache management in ICN",
abstract = "Information Centric Networks (ICNs) is a new architecture for the Future Internet to deliver content at large-scale. It relies on named data and caching features, which consists of storing content across the delivery path to serve forthcoming requests. In this paper, we study the problem of finding the optimal assignment of the objects in the available caches in ICN. The optimization problem is to cache objects in order to minimize overall network overhead. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. Metaheuristic methods are considered as effective methods for solving this problem, Genetic Algorithm (GA) is one of those algorithms that can solve this problem efficiently. We will adapt cache management system based on GA for solving the considered problem. In contrast to traditional locally caching systems this algorithm consider both global and local search and make caching decisions about where and which item will be cached in order to minimize overall network overhead.",
author = "{Mohammed A.a.}, Alaa and Koji Okamura",
year = "2014",
month = "6",
day = "18",
doi = "10.1145/2619287.2619305",
language = "English",
note = "9th International Conference on Future Internet Technologies, CFI 2014 ; Conference date: 18-06-2014 Through 20-06-2014",

}

TY - CONF

T1 - Distributed GA for popularity based partial cache management in ICN

AU - Mohammed A.a., Alaa

AU - Okamura, Koji

PY - 2014/6/18

Y1 - 2014/6/18

N2 - Information Centric Networks (ICNs) is a new architecture for the Future Internet to deliver content at large-scale. It relies on named data and caching features, which consists of storing content across the delivery path to serve forthcoming requests. In this paper, we study the problem of finding the optimal assignment of the objects in the available caches in ICN. The optimization problem is to cache objects in order to minimize overall network overhead. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. Metaheuristic methods are considered as effective methods for solving this problem, Genetic Algorithm (GA) is one of those algorithms that can solve this problem efficiently. We will adapt cache management system based on GA for solving the considered problem. In contrast to traditional locally caching systems this algorithm consider both global and local search and make caching decisions about where and which item will be cached in order to minimize overall network overhead.

AB - Information Centric Networks (ICNs) is a new architecture for the Future Internet to deliver content at large-scale. It relies on named data and caching features, which consists of storing content across the delivery path to serve forthcoming requests. In this paper, we study the problem of finding the optimal assignment of the objects in the available caches in ICN. The optimization problem is to cache objects in order to minimize overall network overhead. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. Metaheuristic methods are considered as effective methods for solving this problem, Genetic Algorithm (GA) is one of those algorithms that can solve this problem efficiently. We will adapt cache management system based on GA for solving the considered problem. In contrast to traditional locally caching systems this algorithm consider both global and local search and make caching decisions about where and which item will be cached in order to minimize overall network overhead.

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

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

U2 - 10.1145/2619287.2619305

DO - 10.1145/2619287.2619305

M3 - Paper

AN - SCOPUS:84954489186

ER -