Distributed averaging on digital erasure networks
نویسندگان
چکیده
منابع مشابه
Distributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do not require the agents to have any knowledge about the global network structure or size. Almost sure convergence to state agreement is proved, and the communication and computational complexities of the algorithms are...
متن کاملDistributed Dual Averaging In Networks
The goal of decentralized optimization over a network is to optimize a global objective formed by a sum of local (possibly nonsmooth) convex functions using only local computation and communication. We develop and analyze distributed algorithms based on dual averaging of subgradients, and provide sharp bounds on their convergence rates as a function of the network size and topology. Our analysi...
متن کاملFastest Distributed Consensus Averaging Problem on Chain of Rhombus Networks
Distributed consensus has appeared as one of the most important and primary problems in the context of distributed computation and it has received renewed interest in the field of sensor networks (due to recent advances in wireless communications), where solving fastest distributed consensus averaging problem over networks with different topologies is one of the primary problems in this issue. ...
متن کاملAveraging on Dynamic Networks
In dynamic networks, the topology of the nodes in a network or links connecting these nodes changes with time. This can be due to mobility, link failure, or nodes failure. We are interested in this paper to study consensus on dynamic networks. Most of the work on consensus in dynamic network settings consider fixed number of nodes that are trying to reach agreement in the presence of either mob...
متن کاملRepair for Distributed Storage Systems in Packet Erasure Networks
Reliability is essential for storing files in many applications of distributed storage systems. To maintain reliability, when a storage node fails, a new node should be regenerated by a repair process. Most of the previous results on the repair problem assume perfect (error-free) links in the networks. However, in practice, especially in a wireless network, the transmitted packets (for repair) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2011
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2010.10.015