Distributed Computing最新文献

{"title":"Distributed computations in fully-defective networks","authors":"Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela","doi":"10.1007/s00446-023-00452-2","DOIUrl":"https://doi.org/10.1007/s00446-023-00452-2","url":null,"abstract":"We address fully-defective asynchronous networks, in which all links are subject to an unlimited number of alteration errors, implying that all messages in the network may be completely corrupted. Despite the possible intuition that such a setting is too harsh for any reliable communication, we show how to simulate any algorithm for a noiseless setting over any fully-defective setting, given that the network is 2-edge connected. We prove that if the network is not 2-edge connected, no non-trivial computation in the fully-defective setting is possible. The key structural property of 2-edge-connected graphs that we leverage is the existence of an oriented (non-simple) cycle that goes through all nodes (Robbins, Am. Math. Mon., 1939). The core of our technical contribution is presenting a construction of such a Robbins cycle in fully-defective networks, and showing how to communicate over it despite total message corruption. These are obtained in a content-oblivious manner, since nodes must ignore the content of received messages.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135336673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Four shades of deterministic leader election in anonymous networks","authors":"Barun Gorain, Avery Miller, Andrzej Pelc","doi":"10.1007/s00446-023-00451-3","DOIUrl":"https://doi.org/10.1007/s00446-023-00451-3","url":null,"abstract":"Leader election is one of the fundamental problems in distributed computing: a single node, called the leader, must be specified. This task can be formulated either in a weak way, where one node outputs leader and all other nodes output non-leader, or in a strong way, where all nodes must also learn which node is the leader. If the nodes of the network have distinct identifiers, then such an agreement means that all nodes have to output the identifier of the elected leader. For anonymous networks, the strong version of leader election requires that all nodes must be able to find a path to the leader, as this is the only way to identify it. In this paper, we study variants of deterministic leader election in arbitrary anonymous networks. Leader election is impossible in some anonymous networks, regardless of the allocated amount of time, even if nodes know the entire map of the network. This is due to possible symmetries in the network. However, even in networks in which it is possible to elect a leader knowing the map, the task may be still impossible without any initial knowledge, regardless of the allocated time. On the other hand, for any network in which leader election (weak or strong) is possible knowing the map, there is a minimum time, called the election index, in which this can be done. We consider four formulations of leader election discussed in the literature in the context of anonymous networks: one is the weak formulation, and the three others specify three different ways of finding the path to the leader in the strong formulation. Our aim is to compare the amount of initial information needed to accomplish each of these “four shades” of leader election in minimum time. Following the framework of algorithms with advice, this information (a single binary string) is provided to all nodes at the start by an oracle knowing the entire network. The length of this string is called the size of advice. We show that the size of advice required to accomplish leader election in the weak formulation in minimum time is exponentially smaller than that needed for any of the strong formulations. Thus, if the required amount of advice is used as a measure of the difficulty of the task, the weakest version of leader election in minimum time is drastically easier than any version of the strong formulation in minimum time.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135195866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Near-optimal distributed dominating set in bounded arboricity graphs","authors":"Michal Dory, Mohsen Ghaffari, Saeed Ilchi","doi":"10.1007/s00446-023-00447-z","DOIUrl":"https://doi.org/10.1007/s00446-023-00447-z","url":null,"abstract":"Abstract We describe a simple deterministic $$O( varepsilon ^{-1} log Delta )$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:msup> <mml:mi>ε</mml:mi> <mml:mrow> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msup> <mml:mo>log</mml:mo> <mml:mi>Δ</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> round distributed algorithm for $$(2alpha +1)(1 + varepsilon )$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mo>(</mml:mo> <mml:mn>2</mml:mn> <mml:mi>α</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo>)</mml:mo> <mml:mo>(</mml:mo> <mml:mn>1</mml:mn> <mml:mo>+</mml:mo> <mml:mi>ε</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> approximation of minimum weighted dominating set on graphs with arboricity at most $$alpha $$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>α</mml:mi> </mml:math> . Here $$Delta $$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>Δ</mml:mi> </mml:math> denotes the maximum degree. We also show a lower bound proving that this round complexity is nearly optimal even for the unweighted case, via a reduction from the celebrated KMW lower bound on distributed vertex cover approximation (Kuhn et al. in JACM 63:116, 2016). Our algorithm improves on all the previous results (that work only for unweighted graphs) including a randomized $$O(alpha ^2)$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:msup> <mml:mi>α</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> approximation in $$O(log n)$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mo>log</mml:mo> <mml:mi>n</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> rounds (Lenzen et al. in International symposium on distributed computing, Springer, 2010), a deterministic $$O(alpha log Delta )$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mi>α</mml:mi> <mml:mo>log</mml:mo> <mml:mi>Δ</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> approximation in $$O(log Delta )$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mo>log</mml:mo> <mml:mi>Δ</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> rounds (Lenzen et al. in international symposium on distributed computing, Springer, 2010), a deterministic $$O(alpha )$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mi>α</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> approximation in $$O(log ^2 Delta )$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:msup> <mml:mo>log</mml:mo> <mml:mn>2</mml:mn> </mml:msup> <mml:mi>Δ</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> rounds (implici","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135140602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Termination of amnesiac flooding","authors":"W. Hussak, Amitabh Trehan","doi":"10.1007/s00446-023-00448-y","DOIUrl":"https://doi.org/10.1007/s00446-023-00448-y","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"36 1","pages":"193-207"},"PeriodicalIF":1.3,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43486783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Special issue on DISC 2019","authors":"H. Attiya","doi":"10.1007/s00446-023-00445-1","DOIUrl":"https://doi.org/10.1007/s00446-023-00445-1","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"36 1","pages":"1"},"PeriodicalIF":1.3,"publicationDate":"2023-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47517761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity","authors":"Armando Castañeda, S. Rajsbaum, M. Raynal","doi":"10.1007/s00446-022-00440-y","DOIUrl":"https://doi.org/10.1007/s00446-022-00440-y","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"36 1","pages":"89-106"},"PeriodicalIF":1.3,"publicationDate":"2022-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45367692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Special issue on DISC 2020","authors":"H. Attiya","doi":"10.1007/s00446-022-00438-6","DOIUrl":"https://doi.org/10.1007/s00446-022-00438-6","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"35 1","pages":"475 - 475"},"PeriodicalIF":1.3,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42150171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Making Byzantine consensus live","authors":"Manuel Bravo, G. Chockler, Alexey Gotsman","doi":"10.1007/s00446-022-00432-y","DOIUrl":"https://doi.org/10.1007/s00446-022-00432-y","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"35 1","pages":"503 - 532"},"PeriodicalIF":1.3,"publicationDate":"2022-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47671898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Extending the wait-free hierarchy to multi-threaded systems","authors":"Matthieu Perrin, A. Mostéfaoui, Grégoire Bonin, Ludmila Courtillat-Piazza","doi":"10.1007/s00446-022-00425-x","DOIUrl":"https://doi.org/10.1007/s00446-022-00425-x","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"35 1","pages":"375-398"},"PeriodicalIF":1.3,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51906619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"PerformERL: a performance testing framework for erlang","authors":"W. Cazzola, Francesco Cesarini, Luca Tansini","doi":"10.1007/s00446-022-00429-7","DOIUrl":"https://doi.org/10.1007/s00446-022-00429-7","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"35 1","pages":"439 - 454"},"PeriodicalIF":1.3,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42509173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}