Filters








38 Hits in 3.5 sec

Protector: A Probabilistic Failure Detector for Cost-Effective Peer-to-Peer Storage

Zhi Yang, Jing Tian, Ben Y. Zhao, Wei Chen, Yafei Dai
2011 IEEE Transactions on Parallel and Distributed Systems  
First, it leverages failure patterns to predict the likelihood that a peer (and the data it hosts) has permanently failed given its current downtime.  ...  simulations based on both synthetic and real traces show that Protector closely approximates the performance of a perfect "oracle" failure detector, and significantly outperforms time-out-based detectors using  ...  Unlike standard Markov chains used in [12] , [15] , the time spent in online and offline states follows a general distribution.  ... 
doi:10.1109/tpds.2010.205 fatcat:lgj6rskh3ra2tditkw7foqsjea

Analysis of failure correlation impact on peer-to-peer storage systems

Olivier Dalle, Frederic Giroire, Julian Monteiro, Stephane Perennes
2009 2009 IEEE Ninth International Conference on Peer-to-Peer Computing  
In such systems, peers fail continuously, hence, the necessity of self-repairing mechanisms to achieve high durability.  ...  In this paper, we propose and study analytical models that assess the bandwidth consumption and the probability to lose data of storage systems that use erasure coded redundancy.  ...  MARKOV CHAIN MODEL In this section, we present the Markov Chain Model that we evaluate in the rest of the paper.  ... 
doi:10.1109/p2p.2009.5284518 dblp:conf/p2p/DalleGMP09 fatcat:gwc4x54w7jbfrnrdmp5k4w3koq

P2P storage systems: Study of different placement policies

Stéphane Caron, Frédéric Giroire, Dorian Mazauric, Julian Monteiro, Stéphane Pérennes
2013 Peer-to-Peer Networking and Applications  
However, the variations in the use of bandwidth are much more bursty under the local policies.  ...  In a P2P storage system using erasure codes, a data block is encoded in many redundancy fragments. These fragments are then sent to distinct peers of the network.  ...  We use a discrete time discrete space Markov chain to represent the transitions between sequences.  ... 
doi:10.1007/s12083-013-0203-9 fatcat:sf3aaq23b5hzbk7wtsef5aasiu

AutoProc: An automatic proactive replication scheme for P2P storage

Zhi Yang, YaFei Dai
2011 Science China Information Sciences  
In this paper, we propose a method called AutoProc to automate the replication process in P2P storage systems.  ...  However, few existing systems are able to select the right replication rate that balances replication cost and durability, e.g., minimizing replication cost without threatening the durability target.  ...  Making the above assumption allows us to model the number of remaining replicas of an object as a birth-death process n(t) using a continuous time Markov chain.  ... 
doi:10.1007/s11432-011-4260-5 fatcat:pasyr7n3bzcsbnsxxy5slgp7t4

Proactive Replication for Data Durability

Emil Sit, Andreas Haeberlen, Frank Dabek, Byung-Gon Chun, Hakim Weatherspoon, Robert Tappan Morris, M. Frans Kaashoek, John Kubiatowicz
2006 International Workshop on Peer-to-Peer Systems  
Reactive techniques can minimize total bytes sent since they only create replicas as needed; however, they can create spikes in network use after a failure.  ...  Results from a simulation study suggest that Tempo can deliver high durability despite only using several kilobytes per second of bandwidth, comparable to state-ofthe-art reactive systems.  ...  Acknowledgments The authors would like to thank Vivek Pai and Aaron Klingaman for their assistance in compiling the data used for the PlanetLab traces.  ... 
dblp:conf/iptps/SitHDCWMKK06 fatcat:vv43xqikirh2bhfakfjxss2hvi

An Analytical Estimation of Durability in DHTs [chapter]

Fabio Picconi, Bruno Baynat, Pierre Sens
Distributed Computing and Internet Technology  
Recent work has shown that the durability of large-scale storage systems such as DHTs can be predicted using a Markov chain model.  ...  We show that the Markov chain rates proposed by other authors do not consider several aspects of the system's behavior, and produce unrealistic predictions.  ...  Markov chains In order to estimate data durability, we model the state of a data object using a continuous-time Markov chain [6, 7] .  ... 
doi:10.1007/978-3-540-77115-9_19 dblp:conf/icdcit/PicconiBS07 fatcat:rbnckp7srrfmrayjrqnrkdjvtm

Performance evaluation of large-scale dynamic systems

Emmanuelle Anceaume, Romaric Ludinard, Bruno Sericola
2012 Performance Evaluation Review  
Given robust operations and adversarial strategies, we propose an analytical model of the local behavior of clusters, based on Markov chains.  ...  In this paper we present an in-depth study of the dynamicity and robustness properties of large-scale distributed systems, and in particular of peer-to-peer systems.  ...  MODELING THE CLUSTER BEHAVIOUR We model the effect of join and leave events in a cluster using a homogeneous discrete-time Markov chain denoted by X = {Xn, n ≥ 0}.  ... 
doi:10.1145/2185395.2185447 fatcat:zrtu7vixwzd7bn4sks2d5j6npy

Availability-Based Methods for Distributed Storage Systems

Anne-Marie Kermarrec, Erwan Le Merrer, Gilles Straub, Alexandre van Kempen
2012 2012 IEEE 31st Symposium on Reliable Distributed Systems  
Distributed storage systems rely heavily on redundancy to ensure data availability as well as durability.  ...  In networked systems subject to intermittent node unavailability, the level of redundancy introduced in the system should be minimized and maintained upon failures.  ...  The authors of [13] are the first to model node behavior with a continuous semi-Markov chain, which does not require the use of exponential distribution.  ... 
doi:10.1109/srds.2012.10 dblp:conf/srds/KermarrecMSK12 fatcat:lzx63bxv5vah3er4hxmml46yfm

Repair Time in Distributed Storage Systems [chapter]

Frédéric Giroire, Sandeep Kumar Gupta, Remigiusz Modrzejewski, Julian Monteiro, Stéphane Perennes
2013 Lecture Notes in Computer Science  
This new model allows system designers to operate a more accurate choice of system parameters in function of their targeted data durability.  ...  This leads us to introduce a correcting factor on the repair rate of the system.  ...  In [9] [10] [11] the authors use a Markov chain model to derive the lifetime of the system. In these works, the reconstruction times are independent for each fragment.  ... 
doi:10.1007/978-3-642-40053-7_9 fatcat:6popffgnqvd7dmnz4oql3cnsyq

A Comprehensive Review on Classification, Energy Management Strategy, and Control Algorithm for Hybrid Electric Vehicles

Qicheng Xue, Xin Zhang, Teng Teng, Jibao Zhang, Zhiyuan Feng, Qinyang Lv
2020 Energies  
In this research, a comprehensive, multi-level classification for HEVs is introduced in detail from the aspects of the degree of hybridization (DoH), the position of the motor, the components and configurations  ...  Considering that Markov chains can predict cycle conditions, an SDP algorithm is formed by nesting Markov chains in DP algorithm, which overcomes the dependence of DP algorithm on driving conditions.  ...  Based on the Markov chain and according to the current state of the matter, the future situation can be predicted, and the predicted model can be solved to obtain the optimal control variable within the  ... 
doi:10.3390/en13205355 fatcat:pbc7o6bbebbwhmywojeyjkj7j4

A survey of attack and defense techniques for reputation systems

Kevin Hoffman, David Zage, Cristina Nita-Rotaru
2009 ACM Computing Surveys  
These systems seek to generate an accurate assessment in the face of unprecedented community size, while providing anonymity and resilience to malicious attacks.  ...  We focus on attacks and defense mechanisms in reputation systems. We present an analysis framework that allows for general decomposition of existing reputation systems.  ...  Attacks and Defense Mechanisms: The EigenTrust formulation has foundations in statistics, as the global trust vector can be formulated as the stationary distribution of a Markov chain.  ... 
doi:10.1145/1592451.1592452 fatcat:olalrku235ffxaqwp3pd3xpoj4

A realistic simulation model for peer-to-peer storage systems

Abdulhalim Dandoush, Sara Alouf, Philippe Nain
2009 Proceedings of the 4th International ICST Conference on Performance Evaluation Methodologies and Tools  
Recent modeling efforts that address the availability and the durability of data have assumed the recovery process to follow an exponential distribution, an assumption made mainly in the absence of studies  ...  We provide some experiments results that show how modeling the availability and durability can be impacted by the recovery times distribution which is impacted in turn by the characteristics of the the  ...  They develop a Markov chain analysis, then derive an expression for the lifetime of the replicated state and study the impact of bandwidth and storage limits on the system.  ... 
doi:10.4108/icst.valuetools2009.7653 dblp:conf/valuetools/DandoushAN09 fatcat:rhn4jqzmfjcyhdizgvz7kwqpie

Effect of Replica Placement on the Reliability of Large-Scale Data Storage Systems

Vinodh Venkatesan, Ilias Iliadis, Xiao-Yu Hu, Robert Haas, Christina Fragouli
2010 2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems  
We therefore use one of the alternate measures of reliability that have been proposed in the literature, namely, the probability of data loss during rebuild in the critical mode of the system.  ...  Replication is a widely used method to protect largescale data storage systems from data loss when storage nodes fail.  ...  ACKNOWLEDGMENT The authors would like to thank Rüdiger Urbanke of EPFL for his participation and support in the discussion of this work, and the reviewers for comments, which helped improve the presentation  ... 
doi:10.1109/mascots.2010.17 dblp:conf/mascots/VenkatesanIHHF10 fatcat:fv42ipgqjbeuhmbrwraogezwrm

Storage Tradeoffs in a Collaborative Backup Service for Mobile Devices

Ludovic Courtes, Marc-olivier Killijian, David Powell
2006 2006 Sixth European Dependable Computing Conference  
With respect to evaluation of the replication techniques, we plan to build stochastic models (using Generalized Stochastic Petri Nets and Markov chains) to assess the probability of losing critical data  ...  Adaptive approaches also use prediction techniques using power consumption and path learning to improve data distribution or discovery.  ... 
doi:10.1109/edcc.2006.26 dblp:conf/edcc/CourtesKP06 fatcat:tcpc3n54zfblpi6pcflna7dgfy

Multidisciplinary intervention of early, lethal metastatic prostate cancer: Report from the 2015 Coffey-Holden Prostate Cancer Academy Meeting

Andrea K. Miyahira, Joshua M. Lang, Robert B. Den, Isla P. Garraway, Tamara L. Lotan, Ashley E. Ross, Tanya Stoyanova, Steve Y. Cho, Jonathan W. Simons, Kenneth J. Pienta, Howard R. Soule
2015 The Prostate  
BACKGROUND-The 2015 Coffey-Holden Prostate Cancer Academy Meeting, themed: "Multidisciplinary Intervention of Early, Lethal Metastatic Prostate Cancer," was held in La Jolla, California from June 25 to  ...  RESULTS- The questions addressed at the meeting included: cellular and molecular mechanisms of tumorigenesis, evaluating, and targeting the microenvironment in the primary tumor, advancing biomarkers for  ...  A second approach using a Markov chain Monte Carlo mathematical model classifies metastatic tumors as "spreaders" or "sponges" [39] .  ... 
doi:10.1002/pros.23107 pmid:26477609 pmcid:PMC5830186 fatcat:kqkyzprr6vgxfgdnevvj36ezby
« Previous Showing results 1 — 15 out of 38 results