Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2020
Toward Efficient Block Replication Management in Distributed Storage
- Jianwei Liao,
- Zhibing Sha,
- Zhigang Cai,
- Zhiming Liu,
- Kenli Li,
- Wei-Keng Liao,
- Alok N. Choudhary,
- Yutaka Ishiakwa
ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), Volume 5, Issue 3Article No.: 13, Pages 1–27https://doi.org/10.1145/3412450Distributed/parallel file systems commonly suffer from load imbalance and resource contention due to the bursty characteristic exhibited in scientific applications. This article presents an adaptive scheme supporting dynamic block data replication and ...
- research-articleJanuary 2020
A new replica placement strategy based on multi-objective optimisation for HDFS
International Journal of Bio-Inspired Computation (IJBIC), Volume 16, Issue 1Pages 13–22https://doi.org/10.1504/ijbic.2020.108994Distributed storage systems like the Hadoop distributed file system (HDFS) constitute the core infrastructure of cloud platforms which are well poised to deal with big-data. An optimised HDFS is critical for effective data management in terms of reduced ...
- research-articleJanuary 2019
Impact of replica placement-based clustering on fault tolerance in grid computing
International Journal of Web Engineering and Technology (IJWET), Volume 14, Issue 2Pages 151–177https://doi.org/10.1504/ijwet.2019.102873Due to several demands on very high computing power and storage capacity, data grids seem to be a good solution to meet these growing demands. However, the design of distributed applications for data grids remains complex, and it is necessary to take into ...
- articleJune 2017
Toward cost-effective replica placements in cloud storage systems with QoS-awareness
Software—Practice & Experience (SPRE), Volume 47, Issue 6Pages 813–829https://doi.org/10.1002/spe.2441In this paper, we propose a simulation model to study real-world replication workflows for cloud storage systems. With this model, we present three new methods to maximize the storage space usage during replica creation, and two novel QoS aware greedy ...
- articleOctober 2016
Adaptive data replication strategy in cloud computing for performance improvement
Frontiers of Computer Science: Selected Publications from Chinese Universities (FCS), Volume 10, Issue 5Pages 925–935https://doi.org/10.1007/s11704-016-5182-6Cloud computing is becoming a very popular word in industry and is receiving a large amount of attention from the research community. Replica management is one of the most important issues in the cloud, which can offer fast data access time, high data ...
-
- research-articleJanuary 2016
Data set replica placement strategy based on fuzzy evaluation in the cloud
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology (JIFS), Volume 31, Issue 6Pages 2859–2868https://doi.org/10.3233/JIFS-169168Replication technology can efficiently enhance data availability and thereby increase system reliability in cloud storage system. However, one urgent challenge is how to select the correct replica hosting sites, as different data center configurations ...
- ArticleJuly 2015
Automatic Reconfiguration of Distributed Storage
ICAC '15: Proceedings of the 2015 IEEE International Conference on Autonomic ComputingPages 133–134https://doi.org/10.1109/ICAC.2015.22The configuration of a distributed storage system with multiple data replicas typically includes the set of servers and their roles in the replication protocol. The configuration can usually be changed manually, but in most cases, system administrators ...
- research-articleMay 2015
Fast replica placement and update strategies in tree networks
CCGRID '15: Proceedings of the 15th IEEE/ACM International Symposium on Cluster, Cloud, and Grid ComputingPages 915–920https://doi.org/10.1109/CCGrid.2015.40Data 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 ...
- research-articleNovember 2013
Exploiting graph partitioning for hierarchical replica placement in WMNs
MSWiM '13: Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systemsPages 5–14https://doi.org/10.1145/2507924.2507928Content replication has gained much popularity in recent years both in the wired and wireless infrastructures. A key challenge faced by Wireless Mesh Networks (WMNs) is to determine the number and locations of content replicas (e.g. video clip) such ...
- ArticleSeptember 2013
Dynamic Replication Technique for Micro-Clouds Based Distributed Storage System
CGC '13: Proceedings of the 2013 International Conference on Cloud and Green ComputingPages 48–53https://doi.org/10.1109/CGC.2013.16In this paper, we investigate a dynamic replica placement strategy to achieve minimum repair time during a complete loss of data center in large-scale distributed object storage systems while keeping the high availability and durability of the system as ...
- research-articleSeptember 2013
A Cloud-Oriented Content Delivery Network Paradigm: Modeling and Assessment
IEEE Transactions on Dependable and Secure Computing (TDSC), Volume 10, Issue 5Pages 287–300https://doi.org/10.1109/TDSC.2013.12Cloud-oriented content delivery networks (CCDNs) constitute a promising alternative to traditional content delivery networks. Exploiting the advantages and principles of the cloud, such as the pay as you go business model and geographical dispersion of ...
- research-articleAugust 2013
Leveraging endpoint flexibility in data-intensive clusters
SIGCOMM '13: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMMPages 231–242https://doi.org/10.1145/2486001.2486021Many applications do not constrain the destinations of their network transfers. New opportunities emerge when such transfers contribute a large amount of network bytes. By choosing the endpoints to avoid congested links, completion times of these ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 43 Issue 4 - ArticleJune 2013
SPOAN: Load Balancing Replica Placement Strategy for Large Scale Biometric Identification Service
BIGDATACONGRESS '13: Proceedings of the 2013 IEEE International Congress on Big DataPages 326–333https://doi.org/10.1109/BigData.Congress.2013.50Large-scale identification system is a distributed data processing system that requires both high throughput and high reliability. In large-scale identification systems, not only the volume of computing is extremely high but also the I/O volume per CPU ...
- research-articleMarch 2013
GCplace: geo-cloud based correlation aware data replica placement
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingPages 371–376https://doi.org/10.1145/2480362.2480438Cross datacenter data replication has been widely used in geo-cloud environment due to its ability to increase application's availability and improve the performance. However, with the large scale of cloud, it is difficult to determine the location of ...
- research-articleOctober 2012
Survey of caching and replica placement algorithm for content distribution in Peer to Peer overlay networks
CCSEIT '12: Proceedings of the Second International Conference on Computational Science, Engineering and Information TechnologyPages 248–252https://doi.org/10.1145/2393216.2393259Peer-to-Peer (P2P) network provides decentralized, self organized, scalable objects in distributed computing system. However such networks suffer from high latency, network traffic and cache update problems. The existing caching and replica placement ...
- ArticleSeptember 2012
Providing High Availability for Distributed Stream Processing Application with Replica Placement
NBIS '12: Proceedings of the 2012 15th International Conference on Network-Based Information SystemsPages 685–690https://doi.org/10.1109/NBiS.2012.103With the popularity of cloud computing, high volume data needs to be processed in real-time. Therefore, many distributed stream processing systems have risen to deal with this requirement. One kind of distributed stream processing applications contains ...
- research-articleJune 2012
A content replication scheme for wireless mesh networks
NOSSDAV '12: Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and VideoPages 39–44https://doi.org/10.1145/2229087.2229098Wireless Mesh Networks (WMNs) extend Internet access in areas where the wired infrastructure is not available. A problem that arises is the congestion around gateways, delayed access latency and low throughput. Therefore, object replication and ...
- ArticleJuly 2011
Reliability of Clustered vs. Declustered Replica Placement in Data Storage Systems
MASCOTS '11: Proceedings of the 2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication SystemsPages 307–317https://doi.org/10.1109/MASCOTS.2011.53The placement of replicas across storage nodes in a replication-based storage system is known to affect rebuild times and therefore system reliability. Earlier work has shown that, for a replication factor of two, the reliability is essentially ...
- research-articleJune 2011
Wide area placement of data replicas for fast and highly available data access
DIDC '11: Proceedings of the fourth international workshop on Data-intensive distributed computingPages 1–8https://doi.org/10.1145/1996014.1996016Recent years have seen rapid growth of online data storage and computing services at various locations around the world. In wide area applications, data can be replicated at multiple locations to serve users with lower latency and higher availability. ...
- research-articleMay 2011
Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables
IEEE Transactions on Dependable and Secure Computing (TDSC), Volume 8, Issue 3Pages 419–433https://doi.org/10.1109/TDSC.2009.49Distributed hash tables (DHTs) share storage and routing responsibility among all nodes in a peer-to-peer network. These networks have bounded path length unlike unstructured networks. Unfortunately, nodes can deny access to keys or misroute lookups. We ...