MARIF: Multiple Queries Look-Up Architecture Using Range Information Feedback in a DHT Network

Kimihiro MIZUTANI; Toru MANO; Osamu AKASHI; Kensuke FUKUDA

doi:10.1587/transcom.E96.B.1680

MARIF: Multiple Queries Look-Up Architecture Using Range Information Feedback in a DHT Network

Kimihiro MIZUTANI, Toru MANO, Osamu AKASHI, Kensuke FUKUDA

Full Text Views

0

Cite this

Summary :

In DHT network, a node can get/put a requested data by only log N look-up steps. However, conventional DHT network only supports single query look-up to search data. From the reason, each node in a DHT network must execute look-up process for each query even if a large number of put and get operations are executed. Therefore, this results in high network load in massive data management such as MapReduce, sensor network, and web information. To address the problem, we propose multiple queries look-up architecture using range information feedback (MARIF). MARIF extends the conventional KBR protocol to supports range information that is a scope of ID space a node keeps. When a source node receives range information from a destination node, the source node checks all queries in the range information and forwards queries matching the range information to the destination node directly. This effectively reduces the number of look-up queries and the network load for the IP network. In addition, MARIF can be implemented into conventional DHT networks and can easily be combined to effective DHT routing algorithms such as Chord, Kademlia, Pastry, and one-hop DHT. In evaluation, we implement MARIF into three DHT networks and compare its performance with that of conventional query bundling mechanisms based on the KBR protocol. The results show that MARIF reduces by up to 40% the total number of forwarding queries to put data compared with other mechanisms. In addition, MARIF saves the number of forwarding queries per look-up process by up to 85% compared to other mechanisms with low bundling overhead.

Publication: IEICE TRANSACTIONS on Communications Vol.E96-B No.7 pp.1680-1690

Publication Date: 2013/07/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E96.B.1680

Type of Manuscript: Special Section PAPER (Special Section on Internet Architectures, Protocols, and Management Methods that Enable Sustainable Development)

Category

Authors

Kimihiro MIZUTANI
  NTT Corporation
Toru MANO
  NTT Corporation
Osamu AKASHI
  NTT Corporation
Kensuke FUKUDA
  National Institute of Informatics

Keyword

structured overlay network, P2P, DHT, query reduction

Cite this

Copy

Kimihiro MIZUTANI, Toru MANO, Osamu AKASHI, Kensuke FUKUDA, "MARIF: Multiple Queries Look-Up Architecture Using Range Information Feedback in a DHT Network" in IEICE TRANSACTIONS on Communications, vol. E96-B, no. 7, pp. 1680-1690, July 2013, doi: 10.1587/transcom.E96.B.1680.
Abstract: In DHT network, a node can get/put a requested data by only log N look-up steps. However, conventional DHT network only supports single query look-up to search data. From the reason, each node in a DHT network must execute look-up process for each query even if a large number of put and get operations are executed. Therefore, this results in high network load in massive data management such as MapReduce, sensor network, and web information. To address the problem, we propose multiple queries look-up architecture using range information feedback (MARIF). MARIF extends the conventional KBR protocol to supports range information that is a scope of ID space a node keeps. When a source node receives range information from a destination node, the source node checks all queries in the range information and forwards queries matching the range information to the destination node directly. This effectively reduces the number of look-up queries and the network load for the IP network. In addition, MARIF can be implemented into conventional DHT networks and can easily be combined to effective DHT routing algorithms such as Chord, Kademlia, Pastry, and one-hop DHT. In evaluation, we implement MARIF into three DHT networks and compare its performance with that of conventional query bundling mechanisms based on the KBR protocol. The results show that MARIF reduces by up to 40% the total number of forwarding queries to put data compared with other mechanisms. In addition, MARIF saves the number of forwarding queries per look-up process by up to 85% compared to other mechanisms with low bundling overhead.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.1680/_p

Copy

@ARTICLE{e96-b_7_1680,
author={Kimihiro MIZUTANI, Toru MANO, Osamu AKASHI, Kensuke FUKUDA, },
journal={IEICE TRANSACTIONS on Communications},
title={MARIF: Multiple Queries Look-Up Architecture Using Range Information Feedback in a DHT Network},
year={2013},
volume={E96-B},
number={7},
pages={1680-1690},
abstract={In DHT network, a node can get/put a requested data by only log N look-up steps. However, conventional DHT network only supports single query look-up to search data. From the reason, each node in a DHT network must execute look-up process for each query even if a large number of put and get operations are executed. Therefore, this results in high network load in massive data management such as MapReduce, sensor network, and web information. To address the problem, we propose multiple queries look-up architecture using range information feedback (MARIF). MARIF extends the conventional KBR protocol to supports range information that is a scope of ID space a node keeps. When a source node receives range information from a destination node, the source node checks all queries in the range information and forwards queries matching the range information to the destination node directly. This effectively reduces the number of look-up queries and the network load for the IP network. In addition, MARIF can be implemented into conventional DHT networks and can easily be combined to effective DHT routing algorithms such as Chord, Kademlia, Pastry, and one-hop DHT. In evaluation, we implement MARIF into three DHT networks and compare its performance with that of conventional query bundling mechanisms based on the KBR protocol. The results show that MARIF reduces by up to 40% the total number of forwarding queries to put data compared with other mechanisms. In addition, MARIF saves the number of forwarding queries per look-up process by up to 85% compared to other mechanisms with low bundling overhead.},
keywords={},
doi={10.1587/transcom.E96.B.1680},
ISSN={1745-1345},
month={July},}

Copy

TY - JOUR
TI - MARIF: Multiple Queries Look-Up Architecture Using Range Information Feedback in a DHT Network
T2 - IEICE TRANSACTIONS on Communications
SP - 1680
EP - 1690
AU - Kimihiro MIZUTANI
AU - Toru MANO
AU - Osamu AKASHI
AU - Kensuke FUKUDA
PY - 2013
DO - 10.1587/transcom.E96.B.1680
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2013
AB - In DHT network, a node can get/put a requested data by only log N look-up steps. However, conventional DHT network only supports single query look-up to search data. From the reason, each node in a DHT network must execute look-up process for each query even if a large number of put and get operations are executed. Therefore, this results in high network load in massive data management such as MapReduce, sensor network, and web information. To address the problem, we propose multiple queries look-up architecture using range information feedback (MARIF). MARIF extends the conventional KBR protocol to supports range information that is a scope of ID space a node keeps. When a source node receives range information from a destination node, the source node checks all queries in the range information and forwards queries matching the range information to the destination node directly. This effectively reduces the number of look-up queries and the network load for the IP network. In addition, MARIF can be implemented into conventional DHT networks and can easily be combined to effective DHT routing algorithms such as Chord, Kademlia, Pastry, and one-hop DHT. In evaluation, we implement MARIF into three DHT networks and compare its performance with that of conventional query bundling mechanisms based on the KBR protocol. The results show that MARIF reduces by up to 40% the total number of forwarding queries to put data compared with other mechanisms. In addition, MARIF saves the number of forwarding queries per look-up process by up to 85% compared to other mechanisms with low bundling overhead.
ER -