A Swarm Inspired Method for Efficient Data Transfer
Summary :
In this paper we report on an approach inspired by Ant Colony Optimization (ACO) to provide a fault tolerant and efficient means of transferring data in dynamic environments. We investigate the problem of distributing data between a client and server by using pheromone equations. Ants choose the best source of food by selecting the strongest pheromone trail leaving the nest. The pheromone decays over-time and needs to be continually reinforced to define the optimum route in a dynamic environment. This resembles the dynamic environment for the distribution of data between clients and servers. Our approach uses readily available network and server information to construct a pheromone that determines the best server from which to download data. We demonstrate that the approach is self-optimizing and capable of adapting to dynamic changes in the environment.
- Publication
- IEICE TRANSACTIONS on Information Vol.E95-D No.12 pp.2852-2859
- Publication Date
- 2012/12/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E95.D.2852
- Type of Manuscript
- Special Section PAPER (Special Section on Parallel and Distributed Computing and Networking)
- Category
- Network and Communication
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yutaka KAWAI, Adil HASAN, Go IWAI, Takashi SASAKI, Yoshiyuki WATASE, "A Swarm Inspired Method for Efficient Data Transfer" in IEICE TRANSACTIONS on Information,
vol. E95-D, no. 12, pp. 2852-2859, December 2012, doi: 10.1587/transinf.E95.D.2852.
Abstract: In this paper we report on an approach inspired by Ant Colony Optimization (ACO) to provide a fault tolerant and efficient means of transferring data in dynamic environments. We investigate the problem of distributing data between a client and server by using pheromone equations. Ants choose the best source of food by selecting the strongest pheromone trail leaving the nest. The pheromone decays over-time and needs to be continually reinforced to define the optimum route in a dynamic environment. This resembles the dynamic environment for the distribution of data between clients and servers. Our approach uses readily available network and server information to construct a pheromone that determines the best server from which to download data. We demonstrate that the approach is self-optimizing and capable of adapting to dynamic changes in the environment.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E95.D.2852/_p
Copy
@ARTICLE{e95-d_12_2852,
author={Yutaka KAWAI, Adil HASAN, Go IWAI, Takashi SASAKI, Yoshiyuki WATASE, },
journal={IEICE TRANSACTIONS on Information},
title={A Swarm Inspired Method for Efficient Data Transfer},
year={2012},
volume={E95-D},
number={12},
pages={2852-2859},
abstract={In this paper we report on an approach inspired by Ant Colony Optimization (ACO) to provide a fault tolerant and efficient means of transferring data in dynamic environments. We investigate the problem of distributing data between a client and server by using pheromone equations. Ants choose the best source of food by selecting the strongest pheromone trail leaving the nest. The pheromone decays over-time and needs to be continually reinforced to define the optimum route in a dynamic environment. This resembles the dynamic environment for the distribution of data between clients and servers. Our approach uses readily available network and server information to construct a pheromone that determines the best server from which to download data. We demonstrate that the approach is self-optimizing and capable of adapting to dynamic changes in the environment.},
keywords={},
doi={10.1587/transinf.E95.D.2852},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - A Swarm Inspired Method for Efficient Data Transfer
T2 - IEICE TRANSACTIONS on Information
SP - 2852
EP - 2859
AU - Yutaka KAWAI
AU - Adil HASAN
AU - Go IWAI
AU - Takashi SASAKI
AU - Yoshiyuki WATASE
PY - 2012
DO - 10.1587/transinf.E95.D.2852
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E95-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2012
AB - In this paper we report on an approach inspired by Ant Colony Optimization (ACO) to provide a fault tolerant and efficient means of transferring data in dynamic environments. We investigate the problem of distributing data between a client and server by using pheromone equations. Ants choose the best source of food by selecting the strongest pheromone trail leaving the nest. The pheromone decays over-time and needs to be continually reinforced to define the optimum route in a dynamic environment. This resembles the dynamic environment for the distribution of data between clients and servers. Our approach uses readily available network and server information to construct a pheromone that determines the best server from which to download data. We demonstrate that the approach is self-optimizing and capable of adapting to dynamic changes in the environment.
ER -
English
