Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing最新文献_第9页

Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity 简短声明:完全安全的消息传输，可以容忍移动混合对手，降低了相位复杂性

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835757

A. Patra, Ashish Choudhury, C. Rangan

引用次数: 2

Session details: Regular papers 会议细节:常规论文

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/3258212

Danny Hendler

引用次数: 0

Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio 简要公告:采用恒近似比避障机制的路由

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835727

Florian Huc, Aubin Jarry, Pierre Leone, J. Rolim

{"title":"Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio","authors":"Florian Huc, Aubin Jarry, Pierre Leone, J. Rolim","doi":"10.1145/1835698.1835727","DOIUrl":"https://doi.org/10.1145/1835698.1835727","url":null,"abstract":"We study the problem of routing messages in sensor networks where the energy saving issue is essential. In this paper, we propose ROAM2, an improvement of ROAM (Routing protocol with Obstacle Avoidance Mechanism) proposed in [HJL+09]. This distributed protocol has a light obstacle detection and avoidance component with low message and computation overhead and a routing component which sends messages along short paths, thus saving energy. We improved it so that is has an 100% delivery rate and we prove that ROAM finds with high probability paths whose lengths are comparable to the length of the shortest paths. Furthermore, we prove a general result on the length of any path computed in a greedy way. Whereas ROAM uses one bit of memory in nodes (even if there are several destinations), in [KWZ08], it was shown that no geographic routing algorithm not using any sensor memory can compute a path whose length is guaranteed to be of order less than O(l2), where l is the length of the shortest path. Finally, we compare the energy efficiency of ROAM against GPSR (or GFG) [KK00], the algorithm proposed in [MLNR08] and SLGF [JMLW08], by running simulations which validates our theoretical results","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132895126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks 简要公告:有限链路容量的拜占庭协议容量——四节点网络的完整表征

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835789

Guanfeng Liang, N. Vaidya

引用次数: 1

Brief announcement: an efficient failure detector for omission environments 简短声明:遗漏环境的有效故障检测器

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835720

Roberto Cortiñas, Iratxe Soraluze Arriola, A. Lafuente, M. Larrea

引用次数: 0

Brief announcement: k-shot distributed broadcasting in radio networks 简短声明:k-shot分布广播在无线网络

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835717

Paraschos Koutris, Aris Pagourtzis

引用次数: 2

Discrete load balancing is (almost) as easy as continuous load balancing 离散负载平衡(几乎)和连续负载平衡一样简单

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835780

Robert Elsässer, Thomas Sauerwald

{"title":"Discrete load balancing is (almost) as easy as continuous load balancing","authors":"Robert Elsässer, Thomas Sauerwald","doi":"10.1145/1835698.1835780","DOIUrl":"https://doi.org/10.1145/1835698.1835780","url":null,"abstract":"We consider the problem of diffusion-based load balancing on a distributed network with n processors. If the load is arbitrarily divisible, then the convergence is fairly well captured in terms of the second largest eigenvalue of the diffusion matrix. As for many applications load can not be arbitrarily divided, we consider a model where load consists of indivisible, unit-size tokens. Quantifying by how much this integrality assumption worsens the efficiency of load balancing algorithms is a natural question which has been posed by many authors [9, 15, 16, 6, 19, 17]. In this paper we show essentially that discrete load balancing is almost as easy as continuous load balancing. More precisely, we present a fully distributed, randomized algorithm for discrete load balancing that balances the load up to an additive constant error on any graph in time O(log (Kn)/(1-λ2)), where K is the initial imbalance and λ2 is the second largest eigenvalue of the diffusion matrix. This improves and tightens a result of Elsässer, Monien, Schamberger (2006) who proved a runtime bound of O((log (K) + (log n)2) / (1-λ2)). We also develop a load balancing algorithm based on routing that achieves a runtime of O(D ⋅ log n), where D is the diameter of the graph.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128843248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Hybrid-secure MPC: trading information-theoretic robustness for computational privacy 混合安全MPC:以信息理论鲁棒性换取计算隐私

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835747

Christoph Lucas, Dominik Raub, U. Maurer

{"title":"Hybrid-secure MPC: trading information-theoretic robustness for computational privacy","authors":"Christoph Lucas, Dominik Raub, U. Maurer","doi":"10.1145/1835698.1835747","DOIUrl":"https://doi.org/10.1145/1835698.1835747","url":null,"abstract":"Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion. In contrast, a hybrid-secure protocol provides different security guarantees depending on the set of corrupted parties and the computational power of the adversary, without being aware of the actual adversarial setting. Thus, hybrid-secure MPC protocols allow for graceful degradation of security. We present a hybrid-secure MPC protocol that provides an optimal trade-off between IT robustness and computational privacy: For any robustness parameter ρ < n/2, we obtain one MPC protocol that is simultaneously IT secure with robustness for up to t ≤ ρ actively corrupted parties, IT secure with fairness (no robustness) for up to t < n/2, and computationally secure with agreement on abort (privacy and correctness only) for up to t < n -ρ. Our construction is secure in the universal composability (UC) framework (based on a network of secure channels, a broadcast channel, and a common reference string). It achieves the bound on the trade-off between robustness and privacy shown by Ishai et al. [CRYPTO'06] and Katz [STOC'07], the bound on fairness shown by Cleve [STOC'86], and the bound on IT security shown by Kilian [STOC'00], and is the first protocol that achieves all these bounds simultaneously.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123347287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Group mutual exclusion in O(log n) RMR O(log n) RMR中的群互斥

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835708

V. Bhatt, Chien-Chung Huang

引用次数: 20

Brief announcement: on enhancing concurrency in distributed transactional memory 简短公告:关于增强分布式事务内存中的并发性

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835715

Bo Zhang, B. Ravindran

引用次数: 9