NDLI: Randomized gossip algorithms

Content Provider	ACM Digital Library
Author	Prabhakar, Balaji Boyd, Stephen Shah, Devavrat Ghosh, Arpita
Abstract	Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join and old nodes leave the network. Algorithms for such networks need to be robust against changes in topology. Additionally, nodes in sensor networks operate under limited computational, communication, and energy resources. These constraints have motivated the design of "gossip" algorithms: schemes which distribute the computational burden and in which a node communicates with a randomly chosen neighbor.We analyze the averaging problem under the gossip constraint for an arbitrary network graph, and find that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly stochastic matrix characterizing the algorithm. Designing the fastest gossip algorithm corresponds to minimizing this eigenvalue, which is a semidefinite program (SDP). In general, SDPs cannot be solved in a distributed fashion; however, exploiting problem structure, we propose a distributed subgradient method that solves the optimization problem over the network.The relation of averaging time to the second largest eigenvalue naturally relates it to the mixing time of a random walk with transition probabilities derived from the gossip algorithm. We use this connection to study the performance and scaling of gossip algorithms on two popular networks: Wireless Sensor Networks, which are modeled as Geometric Random Graphs, and the Internet graph under the so-called Preferential Connectivity (PC) model.
Starting Page	2508
Ending Page	2530
Page Count	23
File Format	PDF
ISSN	10636692
DOI	10.1109/TIT.2006.874516
Volume Number	14
Issue Number	SI
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2006-06-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Distributed averaging Gossip Random walk Scaling laws Semidefinite programming Sensor networks
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Randomized gossip algorithms

Randomized information dissemination in dynamic environments

Joint Estimation and Gossip Averaging for Sensor Network Applications

Distributed Averaging in Sensor Networks Based on Broadcast Gossip Algorithms

Randomized Information Dissemination in Dynamic Environments

Asynchronous distributed averaging on communication networks

Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks

Semidefinite programming based algorithms for sensor network localization

Geographic Gossip: Efficient Averaging for Sensor Networks

Randomized gossip algorithms

Similar Documents

Randomized gossip algorithms

Randomized information dissemination in dynamic environments

Joint Estimation and Gossip Averaging for Sensor Network Applications

Distributed Averaging in Sensor Networks Based on Broadcast Gossip Algorithms

Randomized Information Dissemination in Dynamic Environments

Asynchronous distributed averaging on communication networks

Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks

Semidefinite programming based algorithms for sensor network localization

Geographic Gossip: Efficient Averaging for Sensor Networks

Randomized gossip algorithms