Resource Discovery Service while Minimizing Maintenance Overhead in Hierarchical DHT Systems

Resource Discovery Service while Minimizing Maintenance Overhead in Hierarchical DHT Systems

Riad Mokadem (Paul Sabatier University, France), Abdelkader Hameurlain (Paul Sabatier University, France) and A Min Tjoa (Vienna University of Technology, Austria)
DOI: 10.4018/jaras.2012040101
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Despite hierarchical Distributed Hash Table (DHT) systems have addressed flat overlay system problems, most of existing solutions add a significant overhead to large scale systems. This not only increases the bandwidth consumption but also affect the routing efficiency. This paper deals with a resource discovery while minimizing maintenance overhead in hierarchical DHT systems. The considered resources are metadata describing data sources. In the solution, only one gateway in one overlay is attached to the superior level overlay. It aims to reduce both lookup and maintenance costs while minimizing the overhead added to the system. The authors present a cost analysis for a resource discovery process and discuss capabilities of the proposed protocol to reduce the overhead of maintaining the overlay network. The analysis result proved that our design decrease significantly the maintenance costs in such systems especially when nodes frequently join/leave the system.
Article Preview

Introduction

A resource discovery is a real challenge in unstable and large scale environments. It consists to discover resources (e.g., computers, data) that are needed to perform distributed applications in such systems (Mastroianni et al., 2007). Throughout this paper, we focus on the discovery of metadata describing data sources in Grid systems.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 8: 2 Issues (2017): Forthcoming, Available for Pre-Order
Volume 7: 1 Issue (2016)
Volume 6: 2 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing