Efficient data management using the session log in DHT and its evaluation

Satoru Noguchi, Atsuo Inomata, Kazutoshi Fujikawa, Hideki Sunahara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Distributed Hash Table (DHT) is a specialized distributed system that aims to lookup hashed identifiers efficiently in order to route messages to and from the corresponding nodes and objects. However DHTs are mechanisms sensitive to churn (the continuous and interleaved process of arrival / departure of nodes). As a result, they often cause loss of stored objects and failures in the lookup, a serious issue for all overlay networks. In this paper, we propose a dynamic replica location method using the session log in DHT. Our method can determine dynamically the effective number of replicas on session running periods among anticipate nodes. We also implemented a prototype based on an existing DHT routing algorithm, and we evaluated the performance of the prototype. Our proposed method was shown to reduce data loss and the cost for locating replication.

Original languageEnglish
Title of host publication2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009
DOIs
Publication statusPublished - 2009
Event2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009 - Las Vegas, NV, United States
Duration: 2009 Jan 102009 Jan 13

Other

Other2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009
CountryUnited States
CityLas Vegas, NV
Period09/1/1009/1/13

Fingerprint

Information management
Overlay networks
Routing algorithms
evaluation
management
Costs
cause
costs
performance

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Cite this

Noguchi, S., Inomata, A., Fujikawa, K., & Sunahara, H. (2009). Efficient data management using the session log in DHT and its evaluation. In 2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009 [4784963] https://doi.org/10.1109/CCNC.2009.4784963

Efficient data management using the session log in DHT and its evaluation. / Noguchi, Satoru; Inomata, Atsuo; Fujikawa, Kazutoshi; Sunahara, Hideki.

2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009. 2009. 4784963.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Noguchi, S, Inomata, A, Fujikawa, K & Sunahara, H 2009, Efficient data management using the session log in DHT and its evaluation. in 2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009., 4784963, 2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009, Las Vegas, NV, United States, 09/1/10. https://doi.org/10.1109/CCNC.2009.4784963
Noguchi S, Inomata A, Fujikawa K, Sunahara H. Efficient data management using the session log in DHT and its evaluation. In 2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009. 2009. 4784963 https://doi.org/10.1109/CCNC.2009.4784963
Noguchi, Satoru ; Inomata, Atsuo ; Fujikawa, Kazutoshi ; Sunahara, Hideki. / Efficient data management using the session log in DHT and its evaluation. 2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009. 2009.
@inproceedings{1d742715e9094619ae812d54dfb539bc,
title = "Efficient data management using the session log in DHT and its evaluation",
abstract = "Distributed Hash Table (DHT) is a specialized distributed system that aims to lookup hashed identifiers efficiently in order to route messages to and from the corresponding nodes and objects. However DHTs are mechanisms sensitive to churn (the continuous and interleaved process of arrival / departure of nodes). As a result, they often cause loss of stored objects and failures in the lookup, a serious issue for all overlay networks. In this paper, we propose a dynamic replica location method using the session log in DHT. Our method can determine dynamically the effective number of replicas on session running periods among anticipate nodes. We also implemented a prototype based on an existing DHT routing algorithm, and we evaluated the performance of the prototype. Our proposed method was shown to reduce data loss and the cost for locating replication.",
author = "Satoru Noguchi and Atsuo Inomata and Kazutoshi Fujikawa and Hideki Sunahara",
year = "2009",
doi = "10.1109/CCNC.2009.4784963",
language = "English",
isbn = "9781424423095",
booktitle = "2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009",

}

TY - GEN

T1 - Efficient data management using the session log in DHT and its evaluation

AU - Noguchi, Satoru

AU - Inomata, Atsuo

AU - Fujikawa, Kazutoshi

AU - Sunahara, Hideki

PY - 2009

Y1 - 2009

N2 - Distributed Hash Table (DHT) is a specialized distributed system that aims to lookup hashed identifiers efficiently in order to route messages to and from the corresponding nodes and objects. However DHTs are mechanisms sensitive to churn (the continuous and interleaved process of arrival / departure of nodes). As a result, they often cause loss of stored objects and failures in the lookup, a serious issue for all overlay networks. In this paper, we propose a dynamic replica location method using the session log in DHT. Our method can determine dynamically the effective number of replicas on session running periods among anticipate nodes. We also implemented a prototype based on an existing DHT routing algorithm, and we evaluated the performance of the prototype. Our proposed method was shown to reduce data loss and the cost for locating replication.

AB - Distributed Hash Table (DHT) is a specialized distributed system that aims to lookup hashed identifiers efficiently in order to route messages to and from the corresponding nodes and objects. However DHTs are mechanisms sensitive to churn (the continuous and interleaved process of arrival / departure of nodes). As a result, they often cause loss of stored objects and failures in the lookup, a serious issue for all overlay networks. In this paper, we propose a dynamic replica location method using the session log in DHT. Our method can determine dynamically the effective number of replicas on session running periods among anticipate nodes. We also implemented a prototype based on an existing DHT routing algorithm, and we evaluated the performance of the prototype. Our proposed method was shown to reduce data loss and the cost for locating replication.

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

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

U2 - 10.1109/CCNC.2009.4784963

DO - 10.1109/CCNC.2009.4784963

M3 - Conference contribution

AN - SCOPUS:63749125687

SN - 9781424423095

BT - 2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009

ER -