{"title":"Planned object duplication strategies in dynamic PRR meshes","authors":"M. K. Bradshaw, A. Rosenberg, D. Towsley","doi":"10.1109/ICNP.2003.1249756","DOIUrl":null,"url":null,"abstract":"In recent years there has been considerable research on new distributed hash tables (DHTs), improvements on existing DHTs, and DHT-enabled systems. However, little of it focuses on their differences [M. Castro et al., 2002]. To this purpose we introduce a simple modeling framework that allows us to mathematically model the search costs of most classes of DHTs. To illustrate the usefulness of this framework, we examine a class of DHTs, which includes tapestry and pastry, that we call dynamic PRR meshes (DPMs). In particular we examine how planned object duplication (POD) strategies affect the search costs of DPMs that employ them. We introduce 3 new DPMs that employ different POD strategies and compare them with the POD strategies that tapestry and pastry use. Through our model we discover cyclic behaviors in search costs over the number of nodes present in the DPM, the effects of variability in the underlying network and provide comparisons of the performance of all 5 DPMs.","PeriodicalId":179873,"journal":{"name":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2003-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP.2003.1249756","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In recent years there has been considerable research on new distributed hash tables (DHTs), improvements on existing DHTs, and DHT-enabled systems. However, little of it focuses on their differences [M. Castro et al., 2002]. To this purpose we introduce a simple modeling framework that allows us to mathematically model the search costs of most classes of DHTs. To illustrate the usefulness of this framework, we examine a class of DHTs, which includes tapestry and pastry, that we call dynamic PRR meshes (DPMs). In particular we examine how planned object duplication (POD) strategies affect the search costs of DPMs that employ them. We introduce 3 new DPMs that employ different POD strategies and compare them with the POD strategies that tapestry and pastry use. Through our model we discover cyclic behaviors in search costs over the number of nodes present in the DPM, the effects of variability in the underlying network and provide comparisons of the performance of all 5 DPMs.
近年来,人们对新的分布式散列表(dht)、对现有dht的改进以及支持dht的系统进行了大量研究。然而,它很少关注他们的差异[M]。Castro et al., 2002]。为此,我们引入了一个简单的建模框架,它允许我们对大多数dht类的搜索成本进行数学建模。为了说明这个框架的有用性,我们研究一类dht,其中包括挂毯和糕点,我们称之为动态PRR网格(dpm)。我们特别研究了计划对象复制(POD)策略如何影响使用它们的dpm的搜索成本。我们介绍了3种采用不同POD策略的新dpm,并将它们与挂毯和糕点使用的POD策略进行了比较。通过我们的模型,我们发现了DPM中节点数量的搜索成本循环行为,底层网络中可变性的影响,并提供了所有5个DPM的性能比较。