NDLI: Distributed Placement of Replicas in Hierarchical Data Grids with User and System QoS Constraints

Content Provider	IEEE Xplore Digital Library
Author	Shorfuzzaman, M. Graham, P. Eskicioglu, R.
Copyright Year	2011
Abstract	Data grids support distributed data-intensive applications that need to access massive datasets stored around the world. Ensuring efficient access to such datasets is hindered by the high latencies of wide-area networks. To speed up access, files can be replicated so a user can access a nearby replica. Much of the work on the replica placement problem in data grids has focused on average system performance and ignored quality assurance issues. In the existing work that considers QoS, a simplified replication model is often assumed, therefore, resulting solutions may not be applicable to real systems. In this paper, we introduce a more realistic model for replica placement in hierarchical Data Grids which determines the positions of a minimum number of replicas expected to satisfy certain quality requirements both from user and system perspectives. Our placement algorithm is based on a highly distributed and decentralized technique that exploits the data access history for popular data files and computes replica locations by minimizing overall replication cost (read and update) while maximizing QoS satisfaction for a given traffic pattern. The problem is formulated using dynamic programming. We assess our algorithm using OptorSim. Simulation results demonstrate the effectiveness of our replica placement technique considering various factors such as storage and workload constraints of replica servers, link capacity constraints, user QoS requirements, etc.
Starting Page	177
Ending Page	186
File Size	414925
Page Count	10
File Format	PDF
ISBN	9781457714481
DOI	10.1109/3PGCIC.2011.35
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-10-26
Publisher Place	Spain
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Heuristic algorithms Quality of service Bandwidth Data grids Distributed algorithm Workload and link constraints Cost function Replication Dynamic programming Servers Mathematical model Equations
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

QoS-Aware Distributed Replica Placement in Hierarchical Data Grids

Distributed Popularity Based Replica Placement in Data Grid Environments

Cost Optimization of Replicas in Tree Network of Data Grid with QoS and Bandwidth Constraints

Access-Efficient QoS-Aware Data Replication to Maximize User Satisfaction in Cloud Computing Environments

Popularity-Driven Dynamic Replica Placement in Hierarchical Data Grids

Dynamic threshold for replicas placement strategy

Minimizing access cost of replicas in tree data grids for read-only objects

An Efficient Replication Strategy for Dynamic Data Grids

A bandwidth-aware algorithm for dynamic service placement in size-fixed networks

Distributed Placement of Replicas in Hierarchical Data Grids with User and System QoS Constraints

Similar Documents

QoS-Aware Distributed Replica Placement in Hierarchical Data Grids

Distributed Popularity Based Replica Placement in Data Grid Environments

Cost Optimization of Replicas in Tree Network of Data Grid with QoS and Bandwidth Constraints

Access-Efficient QoS-Aware Data Replication to Maximize User Satisfaction in Cloud Computing Environments

Popularity-Driven Dynamic Replica Placement in Hierarchical Data Grids

Dynamic threshold for replicas placement strategy

Minimizing access cost of replicas in tree data grids for read-only objects

An Efficient Replication Strategy for Dynamic Data Grids

A bandwidth-aware algorithm for dynamic service placement in size-fixed networks

Distributed Placement of Replicas in Hierarchical Data Grids with User and System QoS Constraints