11,628 Hits in 4.4 sec

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts [article]

Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
2022 arXiv   pre-print
The unifying thread of these results, and our main technical contribution, is the study of novel congested generalization of the standard part-wise aggregation problem.  ...  In this paper, we refine the (almost) existentially optimal distributed Laplacian solver recently developed by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS '21) into an (almost) universally optimal distributed  ...  Our paper essentially settles this question by showing the same ρ-congested part-wise aggregation primitive can be efficiently solved in Õ(ρ) rounds of NCC, implying an almost optimal n o(1)round distributed  ... 
arXiv:2109.05151v3 fatcat:4xk7irgnr5fabk4yknxfy4qcoi

Round- and Message-Optimal Distributed Graph Algorithms [article]

Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc
2018 arXiv   pre-print
In this paper we provide algorithms that are simultaneously round- and message-optimal for a number of well-studied distributed optimization problems.  ...  Distributed graph algorithms that separately optimize for either the number of rounds used or the total number of messages sent have been studied extensively.  ...  Underlying these contributions is our main result -a round-and message-optimal algorithm for a fundamental distributed problem, which we refer to as Part-Wise Aggregation (or PA for short).  ... 
arXiv:1801.05127v3 fatcat:yiizrbjczrgvbmfdjhzgtzttmq

A Pair-wise Key Distribution Mechanism and Distributed Trust Evaluation Model for Secure Data Aggregation in Mobile Sensor Networks [article]

Natarajan Meghanathan
2014 arXiv   pre-print
The SDA framework (designed to be resilient to both insider and outsider attacks) comprises of a pair-wise key establishment mechanism run along the edges of a data gathering tree and a distributed trust  ...  sink to send a seed-secret key message that is used as the basis to establish a new pair-wise secret key.  ...  The child node sends this encrypted pair-wise secret key to the aggregator node as part of a New Pair-wise Key Establishment message.  ... 
arXiv:1411.6188v1 fatcat:hnbrl73y4rfylbheyf3m7pdquy

Low-Congestion Shortcuts for Graphs Excluding Dense Minors [article]

Mohsen Ghaffari, Bernhard Haeupler
2020 arXiv   pre-print
Our proof is simple, elementary, and constructive - featuring a Θ̃(δ D)-round distributed construction algorithm.  ...  A direct consequence of our result is that many graph families, including any minor-excluded ones, have near-optimal Θ̃(D)-round distributed algorithms for many fundamental communication primitives and  ...  Given a c-congestion d-dilation shortcut for a part-wise aggregation problem, we can solve the part-wise aggregation problem in O(c + d log n) =Õ(Q) rounds, using the random delays technique [LMR94, Gha15  ... 
arXiv:2008.03091v1 fatcat:4kpgfgaa2vhufdylm5x6fvmwii

Secure Federated Learning in 5G Mobile Networks [article]

Martin Isaksson, Karl Norrman
2020 arXiv   pre-print
Machine Learning (ML) is an important enabler for optimizing, securing and managing mobile networks.  ...  We evaluate the protocol and find that it has much lower overhead than previous work, without affecting ML performance.  ...  Mads Dam and Dr. Rickard Cöster and all anonymous reviewers for their invaluable input.  ... 
arXiv:2004.06700v2 fatcat:fx6za6tzbzeqdlayaiehiaypaa

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing [article]

Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun
2021 arXiv   pre-print
We provide universally-optimal distributed graph algorithms for (1+ε)-approximate shortest path problems including shortest-path-tree and transshipment.  ...  This also has the benefit of simplifying the interaction with Sherman's multiplicative weight framework [SODA'17] in the distributed setting and its subsequent rounding procedures.  ...  the part-wise aggregation task as the crucial communication task in many optimization problems.  ... 
arXiv:2110.15944v1 fatcat:tp5f5v5iinfqtmxofqdi64d2lu

Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping

Mohsen Ghaffari, Fabian Kuhn, Michael Wagner
2018 International Symposium on Distributed Computing  
We present a distributed minimum spanning tree algorithm with near-optimal round complexity of Õ(D + √ n) and message complexity Õ(min{n 3/2 , m}).  ...  This is the first algorithm with sublinear message complexity and near-optimal round complexity and it improves over the recent algorithms of Elkin [PODC'17] and Pandurangan et al.  ...  Introduction This paper presents a distributed algorithm for computing a Minimum Spanning Tree (MST) with a nearly optimal round complexity and an improved message complexity.  ... 
doi:10.4230/lipics.disc.2018.30 dblp:conf/wdag/GhaffariK18a fatcat:2yt2eaq5dvcmpm675dcshtwdai

Information Theoretic Secure Aggregation with User Dropouts [article]

Yizhou Zhao, Hua Sun
2021 arXiv   pre-print
For this information theoretic secure aggregation problem, we characterize the optimal communication cost.  ...  We consider the following minimal two-round model of secure aggregation.  ...  R 1 L X L , R 2 L Y L (7) where R 1 is the first round message rate and R 2 is the second round message rate.  ... 
arXiv:2101.07750v1 fatcat:2mu4emc6ujbb3awb4kujv4doua

FederatedScope: A Flexible Federated Learning Platform for Heterogeneity [article]

Yuexiang Xie, Zhen Wang, Dawei Gao, Daoyuan Chen, Liuyi Yao, Weirui Kuang, Yaliang Li, Bolin Ding, Jingren Zhou
2022 arXiv   pre-print
Towards an easy-to-use and flexible platform, FederatedScope enables rich types of plug-in operations and components for efficient further development, and we have implemented several important components  ...  to better help users with privacy protection, attack simulation and auto-tuning.  ...  Finally, the client-wise feedback is aggregated to update the policies responsible for determining the optimal configuration(s).  ... 
arXiv:2204.05011v4 fatcat:t5dba2hz7jbplgmnnoiqhlnjfy

RCCT: Robust Clustering with Cooperative Transmission for Energy Efficient Wireless Sensor Networks

Mahbod Ghelichi, Seied Kazem Jahanbakhsh, Esmaeil Sanaei
2008 Fifth International Conference on Information Technology: New Generations (itng 2008)  
In this paper, we develop and analyze an efficient cooperative transmission protocol with robust clustering (RCCT) for sensor networks that considers a fault-tolerant and energyefficient distributed clustering  ...  RCCT distributes energy load by energy-aware member selection for cooperative data transmission. Simulation results show a better performance of RCCT as compared to the conventional protocols.  ...  Therefore, cluster heads are wisely able to choose a member with the highest residual energy to transmit aggregated data back to it.  ... 
doi:10.1109/itng.2008.204 dblp:conf/itng/GhelichiJS08 fatcat:4ificouuezgxzdo2msxpr42ije

Learning Private Neural Language Modeling with Attentive Aggregation [article]

Shaoxiong Ji, Shirui Pan, Guodong Long, Xue Li, Jing Jiang, Zi Huang
2019 arXiv   pre-print
To solve these problems, we propose a novel model aggregation with the attention mechanism considering the contribution of clients models to the global model, together with an optimization technique during  ...  server aggregation.  ...  Youth (ARACY) and Global Business College Australia (GBCA).  ... 
arXiv:1812.07108v2 fatcat:jkkadqzf6vhpzlvzpr56lmg57q

Continuous Gossip-Based Aggregation through Dynamic Information Aging

Vitaliy Rapp, Kalman Graffi
2013 2013 22nd International Conference on Computer Communication and Networks (ICCCN)  
In contrast to this approach, we present in this paper a continuous, epoch-less approach which considers fresh local values in every round of the gossip-based aggregation.  ...  Long epochs result in precise estimations based on old measurements and short epochs result in imprecise aggregated estimations.  ...  Metric and node count data are packed into the same message during the exchange. Such exchange message contains two information parts: a metric aggregation part and a network size estimation part.  ... 
doi:10.1109/icccn.2013.6614118 dblp:conf/icccn/RappG13 fatcat:qhno2nsf2zfntey5mq6nyfgany

Adversary-resilient Distributed and Decentralized Statistical Inference and Machine Learning [article]

Zhixiong Yang, Arpita Gang, Waheed U. Bajwa
2020 arXiv   pre-print
Driven in part by the world's growing appetite for data-driven decision making, however, securing of distributed/decentralized frameworks for inference and learning against adversarial threats remains  ...  In recent years, however, cybersecurity threats from malicious non-state actors and rogue entities have forced practitioners and researchers to rethink the robustness of distributed and decentralized algorithms  ...  ACKNOWLEDGEMENTS The authors gratefully acknowledge the support of the NSF (CCF-1453073, CCF-1907658), the ARO (W911NF-17-1-0546), and the DARPA Lagrange Program (ONR/SPAWAR contract N660011824020).  ... 
arXiv:1908.08649v2 fatcat:de356dvwinfv5g5njo64qmzpvi

Low-Congestion Shortcut and Graph Parameters

Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi, Michael Wagner
2019 International Symposium on Distributed Computing  
Distributed graph algorithms in the standard CONGEST model often exhibit the time-complexity lower bound ofΩ( √ n + D) rounds for many global problems, where n is the number of nodes and D is the diameter  ...  running time of this construction is nearly optimal up to polylogarithmic factors. (2) We present two algorithms, each of which constructs a low-congestion shortcut with qualityÕ(n 1/4 ) inÕ(n 1/4 ) rounds  ...  In the CONGEST model, the computation follows the round-based synchrony. In one round, each node sends messages to its neighbors, receives messages from its neighbors, and executes local computation.  ... 
doi:10.4230/lipics.disc.2019.25 dblp:conf/wdag/KitamuraKOI19 fatcat:az5dhls7vnbkxb34xtyq5pk2dq

Universally-Optimal Distributed Exact Min-Cut [article]

Mohsen Ghaffari, Goran Zuzic
2022 arXiv   pre-print
We obtain this result by designing an aggregation-based algorithm: each node receives only an aggregate of the messages sent to it.  ...  We present a universally-optimal distributed algorithm for the exact weighted min-cut.  ...  We would like to thank Michal Dory, Bernhard Haeupler, and Richard Peng for helpful discussions.  ... 
arXiv:2205.14967v1 fatcat:zwksvajfojcmfhcg24n7c3ytse
« Previous Showing results 1 — 15 out of 11,628 results