Filters








11,405 Hits in 3.5 sec

Quality of Availability: Replica Placement for Widely Distributed Systems [chapter]

Giwon On, Jens Schmitt, Ralf Steinmetz
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Table 1 : 1 QoA Metrics: V is set of entire system nodes of a widely distributed system and R is set of replica nodes (i.e. a placement) where .  ...  Distributed Systems System Model Target System Features and Basic Assumptions We take peer-to-peer (P2P) systems as the target distributed system of this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44884-5_18">doi:10.1007/3-540-44884-5_18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/udkxg4ec6rbcngifznn6f74ury">fatcat:udkxg4ec6rbcngifznn6f74ury</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808172902/https://disco.informatik.uni-kl.de/discofiles/publicationsfiles/OSS03-2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ad/67/ad673e9dbe7d5f0de2a29a8f1ad7eface6b14279.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44884-5_18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Placement of Data Array Replicas in a Distributed System With Unreliable Communication Channels

Vladimir Kulba, Sergey Somov, Yuri Merkuryev
<span title="2019-05-01">2019</span> <i title="Walter de Gruyter GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s4xq442w2bevfas3y4s5ikgsmq" style="color: black;">Applied Computer Systems</a> </i> &nbsp;
The paper proposes an approach to solving the problem of optimal placement of data array replicas in a distributed system.  ...  It presents a formal model of a distributed system with unreliable communication channels. A system is represented as a graph with coloured arcs.  ...  THE PROBLEM OF OPTIMAL PLACEMENT OF ARRAY REPLICAS IN SYSTEM NODES It is necessary to place the replicas of M data arrays in the nodes of the distributed system in a way that ensures the minimum value  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2478/acss-2019-0009">doi:10.2478/acss-2019-0009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/52bbc7ibvncgfifsfkss5fptde">fatcat:52bbc7ibvncgfifsfkss5fptde</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201130041322/https://content.sciendo.com/downloadpdf/journals/acss/24/1/article-p69.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/37/ed/37ed3622de3f5b6fe89251139b4bd3f2a9c2f705.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2478/acss-2019-0009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System [chapter]

John R. Douceur, Roger P. Wattenhofer
<span title="">2001</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45414-4_4">doi:10.1007/3-540-45414-4_4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nzir2esovracnbjegejt35o2j4">fatcat:nzir2esovracnbjegejt35o2j4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200320213342/https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-2001-60.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2d/b1/2db1668f2476f554f8747d9c5f06b6e85c2934ba.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45414-4_4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Replica Placement for Availability in the Worst Case

Peng Li, Debin Gao, Michael K. Reiter
<span title="">2015</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s77bfh66ena2znlnuhuruo464a" style="color: black;">2015 IEEE 35th International Conference on Distributed Computing Systems</a> </i> &nbsp;
We explore the problem of placing object replicas on nodes in a distributed system to maximize the number of objects that remain available when node failures occur.  ...  After quantifying the availability offered by random replica placement in our model, we show that our combinatorial strategy yields placements with better availability than random replica placement for  ...  Acknowledgements: This work was supported in part by NSF grant 1330599 and the National Natural Science Foundation of China (grant 61303213).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdcs.2015.67">doi:10.1109/icdcs.2015.67</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icdcs/LiGR15.html">dblp:conf/icdcs/LiGR15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3pplolp2urcq7fqzn2cadpj2pq">fatcat:3pplolp2urcq7fqzn2cadpj2pq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810144317/http://www.cs.unc.edu/~reiter/papers/2015/ICDCS.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e2/c9/e2c95c570eea40f0a6c04efaad17f9fb6660fab8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdcs.2015.67"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Replica Placement in P2P Storage: Complexity and Game Theoretic Analyses

Krzysztof Rzadca, Anwitaman Datta, Sonja Buchegger
<span title="">2010</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s77bfh66ena2znlnuhuruo464a" style="color: black;">2010 IEEE 30th International Conference on Distributed Computing Systems</a> </i> &nbsp;
In peer-to-peer storage systems, peers replicate each others' data in order to increase availability.  ...  We prove that the problem of optimizing availability in a centralized system is NP-hard.  ...  RELATED WORK Our paper analyzed the problem of replica placement in a p2p storage system.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdcs.2010.67">doi:10.1109/icdcs.2010.67</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icdcs/RzadcaDB10.html">dblp:conf/icdcs/RzadcaDB10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ns7mkugswrgrnb5mgmv45ff34i">fatcat:ns7mkugswrgrnb5mgmv45ff34i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811192550/https://www.mimuw.edu.pl/~krzadca/papers/serenity_icdcs.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e0/d5/e0d580de89e4dcd3e750a7c29c5725e33f507f35.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdcs.2010.67"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation [chapter]

John R. Douceur, Roger P. Wattenhofer
<span title="">2001</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44676-1_30">doi:10.1007/3-540-44676-1_30</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/knvslqcpirbxplhilwa4kvrafy">fatcat:knvslqcpirbxplhilwa4kvrafy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150907201655/http://research.microsoft.com/pubs/74239/ESA2001.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/45/bd/45bd3055d2ddc3140c132dab846a0340a2665302.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44676-1_30"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Optimal Placements in Ring Network for Data Replicas in Distributed Database with Majority Voting Protocol

Zhao Zhang, Weili Wu, Shashi Shekhar
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s77bfh66ena2znlnuhuruo464a" style="color: black;">2008 The 28th International Conference on Distributed Computing Systems</a> </i> &nbsp;
In a distributed database system, data replicas are placed at different locations to achieve high data availability in the presence of link failures.  ...  The problem is to find out the optimal placements for a given number of data replicas in a ring network.  ...  In presence of link failures, optimal replica placement problem (ORP) is an important research problem in distributed data systems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdcs.2008.14">doi:10.1109/icdcs.2008.14</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icdcs/ZhangWS08.html">dblp:conf/icdcs/ZhangWS08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rks7jbi6gvdqxnn7ohsxghk43a">fatcat:rks7jbi6gvdqxnn7ohsxghk43a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829084000/http://www.utdallas.edu/~weiliwu/NSF_report/ReplicasRingZhaoZhangWu.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/da/19/da191aef43cd905d345281cc6eca492e546f9218.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdcs.2008.14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A generalized replica placement strategy to optimize latency in a wide area distributed storage system

John A. Chandy
<span title="">2008</span> <i title="ACM Press"> Proceedings of the 2008 international workshop on Data-aware distributed computing - DADC &#39;08 </i> &nbsp;
In this paper, we present a strategy for placement of replica fragments particularly with respect to the minimization of data communication latencies.  ...  However, the participant nodes are relatively unreliable and thus, distributed storage systems must take care to provide replicas of data objects.  ...  Previous work in replica placement has not addressed how to place these replica fragments in a distributed storage network.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1383519.1383525">doi:10.1145/1383519.1383525</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4rtlyhyvrrbgdesnnkxn64rfmu">fatcat:4rtlyhyvrrbgdesnnkxn64rfmu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100723193620/http://snsl.engr.uconn.edu/pubs/dadc08.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ba/7e/ba7ee6663858d41c608c0f3df24ca6e18f8f7cab.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1383519.1383525"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Distributed Dynamic Replica Placement and Request Redirection in Content Delivery Networks

F. Lo Presti, C. Petrioli, C. Vicari
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/aflzaj6acrayjokgp5eowmxr7e" style="color: black;">Proceedings of the ... International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems</a> </i> &nbsp;
In this paper we address user requests redirection and replica placement in CDNs.  ...  More specifically, content is replicated on CDN servers which are located close to the final users, and user requests are redirected to the "best" replica (e.g., the closest) in a transparent way, so that  ...  Building on previous work on dynamic replica placement [1] , in this paper we present simple, distributed, scalable algorithms for dynamic replica placement and requests redirection.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mascots.2007.19">doi:10.1109/mascots.2007.19</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/mascots/PrestiPV07.html">dblp:conf/mascots/PrestiPV07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/d67bracl7zg4xapzluiezqxtie">fatcat:d67bracl7zg4xapzluiezqxtie</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811014201/http://senseslab.di.uniroma1.it/administrator/components/com_jresearch/files/publications/Distributed_dynamic_replica_pl.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/81/dd/81ddf04d0f3b7225e231c0a1f377962839049c54.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mascots.2007.19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Computing replica placement in distributed systems

D.L. McCue, M.C. Little
<i title="IEEE Comput. Soc. Press"> [1992 Proceedings] Second Workshop on the Management of Replicated Data </i> &nbsp;
Acknowledgements The work reported here has been supported in part by grants from the UK Science and Engineering Research Council and ESPRIT project No. 2267 (Integrated Systems Architecture).  ...  done in most distributed systems.  ...  With a tool for computing appropriate placements, a dynamic replica manager could be employed to take account of changing conditions in the distributed system such as changes in load or availability of  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mrd.1992.242617">doi:10.1109/mrd.1992.242617</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lchtwjfjbfaalm6firhb2o7l3i">fatcat:lchtwjfjbfaalm6firhb2o7l3i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120712173220/http://www.cs.ncl.ac.uk/publications/trs/papers/392.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/61/d9/61d9908684dcdf3c282e1de8c51f208c8c19a5c9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mrd.1992.242617"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Dynamic Replica Placement Algorithm to Enhance Multiple Failures Capability in Distributed System

Sanjay Bansal, Sanjeev Sharma, Ishita Trivedi
<span title="2011-11-30">2011</span> <i title="Academy and Industry Research Collaboration Center (AIRCC)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6vo522l2jgi3hiyio6wyab7a4" style="color: black;">International Journal of Distributed and Parallel systems</a> </i> &nbsp;
In order to improve the dependability these replicas need to placed on totally distant set of nodes.  ...  Improved dependability is achieved by placing the replicas over totally distant set of computing nodes.  ...  Computing power can be added in small increments in distributed systems. In this way incremental growth can be achieved.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijdps.2011.2607">doi:10.5121/ijdps.2011.2607</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i55ak3yefjehhp3zx4coulhelu">fatcat:i55ak3yefjehhp3zx4coulhelu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721020649/http://airccse.org/journal/ijdps/papers/1111ijdps07.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1e/21/1e217da4e450527215370393f98224041aa6472f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijdps.2011.2607"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A Replica Placement Algorithm in Mobile Grid Environments

Xiong Fu, Ruchuan Wang, Yang Wang, Song Deng
<span title="">2009</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gkdds5vmbvfhdj6hneeduu2n3a" style="color: black;">2009 International Conference on Embedded Software and Systems</a> </i> &nbsp;
Experimental studies show this solution is feasible and efficient for the replica placement problem in mobile grid environments. 2009 International Conferences on Embedded Software and Systems 978-0-7695  ...  Therefore, replica placement becomes one of important challenges for the replica management in mobile grid environments.  ...  In recent years, more and more works focused on the replica management in parallel and distributed systems [3] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icess.2009.68">doi:10.1109/icess.2009.68</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icess/FuWWD09.html">dblp:conf/icess/FuWWD09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tivyg547fjbrfbfi4vcnthi7m4">fatcat:tivyg547fjbrfbfi4vcnthi7m4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809040525/http://es.sdu.edu.cn/project/doc/papers/icess09-papers/mines/m4-1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/51/f9/51f91ca1a7045ebc4e05211029e38bf863353fc3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icess.2009.68"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Analysis Study on Caching and Replica Placement Algorithm for Content Distribution in Distributed Computing Networks

Anna Saro Vijendran
<span title="2012-11-30">2012</span> <i title="Academy and Industry Research Collaboration Center (AIRCC)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mxde2hpiwzfebhgwsfk4lho4ha" style="color: black;">International Journal of Peer to Peer Networks</a> </i> &nbsp;
Recently there has been significant research focus on distributed computing network massively caching and replica placement problems for content distribution in globally.  ...  Peer-to-Peer (P2P) network provides dynamically decentralized, self organized, scalable objects in distributed computing system.  ...  Replica Placement Algorithm in Content Distribution Network (RPACDN) [5] This paper deals with replica placement problems in CDN.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijp2p.2012.3602">doi:10.5121/ijp2p.2012.3602</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wawelnixenacvgnrxygp2wfnsm">fatcat:wawelnixenacvgnrxygp2wfnsm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180604032533/http://www.airccse.org/ijp2p/papers/3612ijp2p02.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d1/df/d1dfbc8a7947fcbfd9fc0b00688e3155ff33e655.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijp2p.2012.3602"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Dynamic Data Placement Strategy in MapReduce-styled Data Processing Platform

Hua-Ci WANG, Cai CHEN, Yi LIANG
<span title="2016-11-30">2016</span> <i title="DEStech Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/oepoggqi3bgnbds2j2j6zruxjy" style="color: black;">DEStech Transactions on Engineering and Technology Research</a> </i> &nbsp;
A dynamic data placement strategy is proposed in this paper due to that existing data placement techniques are lack of the consideration of the computing load on the data storage node and reduce the ratio  ...  Performance evaluation results show that the proposed data placement strategy outperforms the original strategy in HDFS file system and the average job execution time is reduce by the maximum of 12%.  ...  Background & Related Work Hadoop distributed file system (HDFS) is one of the most widely used file systems in MapReduce platform [2] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.12783/dtetr/ssme-ist2016/3929">doi:10.12783/dtetr/ssme-ist2016/3929</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gg4y4ln7enfpxcxoafxdgjovuq">fatcat:gg4y4ln7enfpxcxoafxdgjovuq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720022745/http://dpi-proceedings.com/index.php/dtetr/article/download/3929/3572" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ed/e2/ede29a99ac21a40f8c2f1c9802a5d2f490c8d8ee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.12783/dtetr/ssme-ist2016/3929"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

On the Dynamic Maintenance of Data Replicas based on Access Patterns in A Multi-Cloud Environment

Mohammad Shorfuzzaman
<span title="">2017</span> <i title="The Science and Information Organization"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2yzw5hsmlfa6bkafwsibbudu64" style="color: black;">International Journal of Advanced Computer Science and Applications</a> </i> &nbsp;
First, this paper proposes a novel approach to distributed placement of static replicas in appropriate data center locations.  ...  Cloud computing provides services and infrastructures to enable end-users to access, modify and share massive geographically distributed data.  ...  [28] propose a dynamic replica deletion strategy for distributed storage systems under cloud computing environments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14569/ijacsa.2017.080330">doi:10.14569/ijacsa.2017.080330</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m653mcn6pfczzipfjjq7gs5fny">fatcat:m653mcn6pfczzipfjjq7gs5fny</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813180529/http://thesai.org/Downloads/Volume8No3/Paper_30-On_the_Dynamic_Maintenance_of_Data_Replicas.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/10/58/1058e9cd3094553c7f827a4fa97f0656bd8d4828.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14569/ijacsa.2017.080330"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 11,405 results