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-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 ...
- 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 - 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 ...
- 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 ...
- 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-articleJuly 2008
Replica placement for high availability in distributed stream processing systems
DEBS '08: Proceedings of the second international conference on Distributed event-based systemsPages 181–192https://doi.org/10.1145/1385989.1386012A significant number of emerging on-line data analysis applications require the processing of data streams, large amounts of data that get updated continuously, to generate outputs of interest or to identify meaningful events. Example domains include ...
- research-articleJune 2008
A generalized replica placement strategy to optimize latency in a wide area distributed storage system
DADC '08: Proceedings of the 2008 international workshop on Data-aware distributed computingPages 49–54https://doi.org/10.1145/1383519.1383525Wide area distributed storage systems leverage the scale of the Internet to provide vast amounts of data storage capabilities. The typical building block is a peer-to-peer system that can pool disparate distributed resources into a cohesive storage ...
- ArticleJune 2005
Continuous Replica Placement schemes in distributed systems
ICS '05: Proceedings of the 19th annual international conference on SupercomputingPages 284–292https://doi.org/10.1145/1088149.1088187The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RPP formulations fall into two categories: static and dynamic. The first ...
- articleJune 2005
Distributed self-stabilizing placement of replicated resources in emerging networks
IEEE/ACM Transactions on Networking (TON), Volume 13, Issue 3Pages 476–487https://doi.org/10.1109/TNET.2005.850196Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionality, or configuration to enact or optimize communication tasks. The placement ...
- ArticleMarch 2004
Replica placement in adaptive content distribution networks
SAC '04: Proceedings of the 2004 ACM symposium on Applied computingPages 1705–1710https://doi.org/10.1145/967900.968238Adaptive content networking is a promising new approach aimed at scalable delivery of content to a pervasive client population. By adaptive content delivery networks (A-CDN) content is adapted, replicated and delivered to the clients in a cost-quality-...