{"id":"https://openalex.org/W2132107724","doi":"https://doi.org/10.1109/icdim.2007.4444278","title":"Predicting durability in DHTs using Markov chains","display_name":"Predicting durability in DHTs using Markov chains","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2132107724","doi":"https://doi.org/10.1109/icdim.2007.4444278","mag":"2132107724"},"language":"en","primary_location":{"id":"doi:10.1109/icdim.2007.4444278","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2007.4444278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 2nd International Conference on Digital Information Management","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000825116","display_name":"Fabio Picconi","orcid":null},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Fabio Picconi","raw_affiliation_strings":["University of Bologna, Italy","University of Bologna, Italy >  >  >  >"],"affiliations":[{"raw_affiliation_string":"University of Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"University of Bologna, Italy >  >  >  >","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040700291","display_name":"Bruno Baynat","orcid":null},"institutions":[{"id":"https://openalex.org/I4210159731","display_name":"Laboratoire de Recherche en Informatique de Paris 6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Bruno Baynat","raw_affiliation_strings":["LIP 6, Paris, France","LIP6, Paris, France"],"affiliations":[{"raw_affiliation_string":"LIP 6, Paris, France","institution_ids":["https://openalex.org/I4210159731"]},{"raw_affiliation_string":"LIP6, Paris, France","institution_ids":["https://openalex.org/I4210159731"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046707342","display_name":"Pierre Sens","orcid":"https://orcid.org/0000-0002-5156-7715"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pierre Sens","raw_affiliation_strings":["LIP6/Inria, Paris, France","LIP6, INRIA, Paris, France"],"affiliations":[{"raw_affiliation_string":"LIP6/Inria, Paris, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"LIP6, INRIA, Paris, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000825116"],"corresponding_institution_ids":["https://openalex.org/I9360294"],"apc_list":null,"apc_paid":null,"fwci":1.3464,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.83701974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"532","last_page":"538"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6352788209915161},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.629097044467926},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5764753818511963},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.551446795463562},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47955843806266785},{"id":"https://openalex.org/keywords/durability","display_name":"Durability","score":0.47694912552833557},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.4512178897857666},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.42242133617401123},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3220102787017822},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30990779399871826},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.179905503988266},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13359591364860535},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08403709530830383},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07828918099403381}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6352788209915161},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.629097044467926},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5764753818511963},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.551446795463562},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47955843806266785},{"id":"https://openalex.org/C104304963","wikidata":"https://www.wikidata.org/wiki/Q5316114","display_name":"Durability","level":2,"score":0.47694912552833557},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.4512178897857666},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.42242133617401123},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3220102787017822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30990779399871826},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.179905503988266},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13359591364860535},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08403709530830383},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07828918099403381},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icdim.2007.4444278","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2007.4444278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 2nd International Conference on Digital Information Management","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.192.3885","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.3885","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.thlab.net/%7Epicconi/adss07.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01336261v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01336261","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"InternationalWorkshop on Advanced Storage Systems (ADSS 2007), Oct 2007, Lyon, France. pp.532-538, ⟨10.1109/ICDIM.2007.4444278⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W41204052","https://openalex.org/W206841959","https://openalex.org/W1540867681","https://openalex.org/W1822772607","https://openalex.org/W1891640176","https://openalex.org/W1989121153","https://openalex.org/W2050358797","https://openalex.org/W2056363353","https://openalex.org/W2119245106","https://openalex.org/W2123482462","https://openalex.org/W2123820820","https://openalex.org/W2143339817","https://openalex.org/W2147504831","https://openalex.org/W2150676586","https://openalex.org/W2153527920","https://openalex.org/W2163059190","https://openalex.org/W2166289093","https://openalex.org/W2168779015","https://openalex.org/W4248578633","https://openalex.org/W4254857363","https://openalex.org/W4255938980","https://openalex.org/W6601658435","https://openalex.org/W6608369156","https://openalex.org/W6638656391","https://openalex.org/W6639734921"],"related_works":["https://openalex.org/W2352180411","https://openalex.org/W2380892508","https://openalex.org/W2386194254","https://openalex.org/W1567463853","https://openalex.org/W159888992","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,14,52,62,80,87,100,115,134,149,157,177,197],"problem":[3],"of":[4,45,54,64,82,117,136,151,176,199,202],"data":[5,35,55,152],"durability":[6,198],"in":[7,72,148],"low-bandwidth":[8],"large-scale":[9],"distributed":[10],"storage":[11],"systems.":[12,203],"Given":[13],"limited":[15],"bandwidth":[16],"between":[17],"replicas,":[18],"these":[19,128],"systems":[20],"suffer":[21],"from":[22],"long":[23],"repair":[24],"times":[25],"after":[26],"a":[27,42,68,91,143,162,173,187],"hard":[28],"disk":[29],"crash,":[30],"making":[31],"them":[32],"vulnerable":[33],"to":[34,78,85,195],"loss":[36,56,88,153],"when":[37],"several":[38],"replicas":[39,66,83],"fail":[40],"within":[41],"short":[43],"period":[44],"time.":[46],"Recent":[47],"work":[48,182],"has":[49],"suggested":[50,98],"that":[51,99,109,123,141,171],"probability":[53,89,150],"can":[57,74,103,183],"be":[58,76,104,184],"predicted":[59],"by":[60],"modeling":[61],"number":[63,81,116,135],"live":[65],"using":[67,106,142],"Markov":[69],"chain.":[70],"This,":[71],"turn,":[73],"then":[75],"used":[77],"determine":[79],"necessary":[84],"keep":[86],"under":[90],"given":[92],"desired":[93],"value.":[94],"Previous":[95],"authors":[96],"have":[97],"model":[101],"parameters":[102],"estimated":[105],"an":[107,168],"expression":[108,145,159,170],"is":[110,125],"constant":[111,158],"or":[112],"linear":[113,144],"on":[114],"replicas.":[118,137],"Our":[119,181],"simulations,":[120],"however,":[121],"show":[122,140],"neither":[124],"correct,":[126],"as":[127,186],"parameter":[129,179],"values":[130],"grow":[131],"sublinearly":[132],"with":[133],"Moreover,":[138],"we":[139,166],"will":[146,160],"result":[147],"being":[154],"underestimated,":[155],"while":[156],"produce":[161],"significant":[163],"overestimation.":[164],"Finally,":[165],"provide":[167],"empirical":[169],"yields":[172],"good":[174],"approximation":[175],"sublinear":[178],"values.":[180],"viewed":[185],"first":[188],"step":[189],"towards":[190],"finding":[191],"more":[192],"accurate":[193],"models":[194],"predict":[196],"this":[200],"type":[201]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}