Dynamic Load-Distribution Method of uTupleSpace Data-Sharing Mechanism for Ubiquitous Data

Yutaka ARAKAWA; Keiichiro KASHIWAGI; Takayuki NAKAMURA; Motonori NAKAMURA

doi:10.1587/transinf.E97.D.644

Open Access
Dynamic Load-Distribution Method of uTupleSpace Data-Sharing Mechanism for Ubiquitous Data

Yutaka ARAKAWA, Keiichiro KASHIWAGI, Takayuki NAKAMURA, Motonori NAKAMURA

Full Text Views

77

Cite this

Free PDF (1.2MB)

Summary :

The number of networked devices of sensors and actuators continues to increase. We are developing a data-sharing mechanism called uTupleSpace as middleware for storing and retrieving ubiquitous data that are input or output by such devices. uTupleSpace enables flexible retrieval of sensor data and flexible control of actuator devices, and it simplifies the development of various applications. Though uTupleSpace requires scalability against increasing amounts of ubiquitous data, traditional load-distribution methods using a distributed hash table (DHT) are unsuitable for our case because of the ununiformity of the data. Data are nonuniformly generated at some particular times, in some particular positions, and by some particular devices, and their hash values focus on some particular values. This feature makes it difficult for the traditional methods to sufficiently distribute the load by using the hash values. Therefore, we propose a new load-distribution method using a DHT called the dynamic-help method. The proposed method enables one or more peers to handle loads related to the same hash value redundantly. This makes it possible to handle the large load related to one hash value by distributing the load among peers. Moreover, the proposed method reduces the load caused by dynamic load-redistribution. Evaluation experiments showed that the proposed method achieved sufficient load-distribution even when the load was concentrated on one hash value with low overhead. We also confirmed that the proposed method enabled uTupleSpace to accommodate the increasing load with simple operational rules stably and with economic efficiency.

Publication: IEICE TRANSACTIONS on Information Vol.E97-D No.4 pp.644-653

Publication Date: 2014/04/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1587/transinf.E97.D.644

Type of Manuscript: Special Section PAPER (Special Section on Data Engineering and Information Management)

Category

Authors

Yutaka ARAKAWA
  NTT Corporation
Keiichiro KASHIWAGI
  NTT Corporation
Takayuki NAKAMURA
  NTT Corporation
Motonori NAKAMURA
  NTT Corporation

Keyword

tuple space, load distribution, DHT

Cite this

Copy

Yutaka ARAKAWA, Keiichiro KASHIWAGI, Takayuki NAKAMURA, Motonori NAKAMURA, "Dynamic Load-Distribution Method of uTupleSpace Data-Sharing Mechanism for Ubiquitous Data" in IEICE TRANSACTIONS on Information, vol. E97-D, no. 4, pp. 644-653, April 2014, doi: 10.1587/transinf.E97.D.644.
Abstract: The number of networked devices of sensors and actuators continues to increase. We are developing a data-sharing mechanism called uTupleSpace as middleware for storing and retrieving ubiquitous data that are input or output by such devices. uTupleSpace enables flexible retrieval of sensor data and flexible control of actuator devices, and it simplifies the development of various applications. Though uTupleSpace requires scalability against increasing amounts of ubiquitous data, traditional load-distribution methods using a distributed hash table (DHT) are unsuitable for our case because of the ununiformity of the data. Data are nonuniformly generated at some particular times, in some particular positions, and by some particular devices, and their hash values focus on some particular values. This feature makes it difficult for the traditional methods to sufficiently distribute the load by using the hash values. Therefore, we propose a new load-distribution method using a DHT called the dynamic-help method. The proposed method enables one or more peers to handle loads related to the same hash value redundantly. This makes it possible to handle the large load related to one hash value by distributing the load among peers. Moreover, the proposed method reduces the load caused by dynamic load-redistribution. Evaluation experiments showed that the proposed method achieved sufficient load-distribution even when the load was concentrated on one hash value with low overhead. We also confirmed that the proposed method enabled uTupleSpace to accommodate the increasing load with simple operational rules stably and with economic efficiency.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E97.D.644/_p

Copy

@ARTICLE{e97-d_4_644,
author={Yutaka ARAKAWA, Keiichiro KASHIWAGI, Takayuki NAKAMURA, Motonori NAKAMURA, },
journal={IEICE TRANSACTIONS on Information},
title={Dynamic Load-Distribution Method of uTupleSpace Data-Sharing Mechanism for Ubiquitous Data},
year={2014},
volume={E97-D},
number={4},
pages={644-653},
abstract={The number of networked devices of sensors and actuators continues to increase. We are developing a data-sharing mechanism called uTupleSpace as middleware for storing and retrieving ubiquitous data that are input or output by such devices. uTupleSpace enables flexible retrieval of sensor data and flexible control of actuator devices, and it simplifies the development of various applications. Though uTupleSpace requires scalability against increasing amounts of ubiquitous data, traditional load-distribution methods using a distributed hash table (DHT) are unsuitable for our case because of the ununiformity of the data. Data are nonuniformly generated at some particular times, in some particular positions, and by some particular devices, and their hash values focus on some particular values. This feature makes it difficult for the traditional methods to sufficiently distribute the load by using the hash values. Therefore, we propose a new load-distribution method using a DHT called the dynamic-help method. The proposed method enables one or more peers to handle loads related to the same hash value redundantly. This makes it possible to handle the large load related to one hash value by distributing the load among peers. Moreover, the proposed method reduces the load caused by dynamic load-redistribution. Evaluation experiments showed that the proposed method achieved sufficient load-distribution even when the load was concentrated on one hash value with low overhead. We also confirmed that the proposed method enabled uTupleSpace to accommodate the increasing load with simple operational rules stably and with economic efficiency.},
keywords={},
doi={10.1587/transinf.E97.D.644},
ISSN={1745-1361},
month={April},}

Copy

TY - JOUR
TI - Dynamic Load-Distribution Method of uTupleSpace Data-Sharing Mechanism for Ubiquitous Data
T2 - IEICE TRANSACTIONS on Information
SP - 644
EP - 653
AU - Yutaka ARAKAWA
AU - Keiichiro KASHIWAGI
AU - Takayuki NAKAMURA
AU - Motonori NAKAMURA
PY - 2014
DO - 10.1587/transinf.E97.D.644
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E97-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2014
AB - The number of networked devices of sensors and actuators continues to increase. We are developing a data-sharing mechanism called uTupleSpace as middleware for storing and retrieving ubiquitous data that are input or output by such devices. uTupleSpace enables flexible retrieval of sensor data and flexible control of actuator devices, and it simplifies the development of various applications. Though uTupleSpace requires scalability against increasing amounts of ubiquitous data, traditional load-distribution methods using a distributed hash table (DHT) are unsuitable for our case because of the ununiformity of the data. Data are nonuniformly generated at some particular times, in some particular positions, and by some particular devices, and their hash values focus on some particular values. This feature makes it difficult for the traditional methods to sufficiently distribute the load by using the hash values. Therefore, we propose a new load-distribution method using a DHT called the dynamic-help method. The proposed method enables one or more peers to handle loads related to the same hash value redundantly. This makes it possible to handle the large load related to one hash value by distributing the load among peers. Moreover, the proposed method reduces the load caused by dynamic load-redistribution. Evaluation experiments showed that the proposed method achieved sufficient load-distribution even when the load was concentrated on one hash value with low overhead. We also confirmed that the proposed method enabled uTupleSpace to accommodate the increasing load with simple operational rules stably and with economic efficiency.
ER -