NDLI: Fast Replica Placement and Update Strategies in Tree Networks

Content Provider	IEEE Xplore Digital Library
Author	Xu Wang Jigang Wu Guiyuan Jiang Siew Kei Lam Srikanthan, T.
Copyright Year	2015
Description	Author affiliation: Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore (Guiyuan Jiang; Siew Kei Lam; Srikanthan, T.) \|\| Sch. of Comput. Sci. & Technol., Guangdong Univ. of Technol., Guangzhou, China (Xu Wang; Jigang Wu)
Abstract	Data replication enhances data availability and thereby improves the system reliability and efficiency while reduces access latency and communication cost. A critical issue in data replication is to wisely place data replicas which involves identifying the best possible nodes to duplicate data according to user requests. In this paper, we address the problem of replica placement and update in tree networks, where some nodes of the network contain pre-existing replicas. It is obvious that reusing a pre-existing replica leads to smaller cost than creating a new replica, thus it is necessary to take full advantage of the pre-existing replicas. The only previous work that consider the same problem tries to find the optimal solution by developing a dynamic programming algorithm which runs in O(N5). However, this approach is not suitable for practical situation where the user requests change frequently. In this paper, we develop efficient algorithms to accelerate the replica placement without causing obvious degradation in solution quality. We first propose an efficient heuristic algorithm (named GreedyRP) for quickly placing replicas when users change their requests. Then a tabu search algorithm (named TSRP) is customized to further refine the solution obtained by algorithm GreedyRP. Experimental results show that, on tree networks with 600 nodes and 150 pre-existing replicas, the proposed algorithms can accelerate the previous work by 87.97% while the quality degradation is bounded by 2.49% in comparison to the optimal solution.
Starting Page	915
Ending Page	920
File Size	213774
Page Count	6
File Format	PDF
ISBN	9781479980062
DOI	10.1109/CCGrid.2015.40
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-05-04
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Servers Heuristic algorithms Dynamic programming Time complexity Greedy algorithms Time factors Acceleration Tabu Search Replica Placement Tree Networks Update Strategy
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

Power-Aware Replica Placement and Update Strategies in Tree Networks

Power-aware replica placement and update strategies in tree networks

Power-aware replica placement and update strategies in tree networks

Power-aware replica placement and update strategies in tree networks

Power-aware replica placement and update strategies in (2010).

Optimal Algorithms and Approximation Algorithms for Replica Placement with Distance Constraints in Tree Networks

Power-aware replica placement and update strategies in tree networks (2011)

Replica placement using genetic algorithm

An Efficient Video Program Delivery Algorithm in Tree Networks

Fast Replica Placement and Update Strategies in Tree Networks

Similar Documents

Power-Aware Replica Placement and Update Strategies in Tree Networks

Power-aware replica placement and update strategies in tree networks

Power-aware replica placement and update strategies in tree networks

Power-aware replica placement and update strategies in tree networks

Power-aware replica placement and update strategies in (2010).

Optimal Algorithms and Approximation Algorithms for Replica Placement with Distance Constraints in Tree Networks

Power-aware replica placement and update strategies in tree networks (2011)

Replica placement using genetic algorithm

An Efficient Video Program Delivery Algorithm in Tree Networks

Fast Replica Placement and Update Strategies in Tree Networks