Directed gossiping for distributed data aggregation

Mehmet E. Yildiz, Anna Scaglione

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we are studying a class of distributed data aggregation problems where a set of nodes in a network is interested in a function of data that is stored in another set of nodes. Assuming the function of interest is separable, we propose an algorithm based on gossiping schemes. Gossiping protocols are iterative methods based on near neighbor communications, and they are known to be efficient and robust to link/node failures. In this work, after formulating the problem mathematically, and introducing previously proposed necessary and sufficient conditions on the gossiping updates, we introduce several necessary conditions on the feasible codes which will provide significant intuition in determining the (in)feasibility of a given problem. By focusing on stochastic codes, we provide a necessary condition based on topology and discuss scenarios where the codes we seek cannot be found.

Original languageEnglish (US)
Title of host publicationCAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing
Pages53-56
Number of pages4
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009 - Aruba, Netherlands
Duration: Dec 13 2009Dec 16 2009

Other

Other2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009
CountryNetherlands
CityAruba
Period12/13/0912/16/09

Fingerprint

Agglomeration
Iterative methods
Topology
Communication

Keywords

  • Data aggregation
  • Distributed algorithms
  • Gossiping algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Software

Cite this

Yildiz, M. E., & Scaglione, A. (2009). Directed gossiping for distributed data aggregation. In CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (pp. 53-56). [5413241] https://doi.org/10.1109/CAMSAP.2009.5413241

Directed gossiping for distributed data aggregation. / Yildiz, Mehmet E.; Scaglione, Anna.

CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing. 2009. p. 53-56 5413241.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yildiz, ME & Scaglione, A 2009, Directed gossiping for distributed data aggregation. in CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing., 5413241, pp. 53-56, 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009, Aruba, Netherlands, 12/13/09. https://doi.org/10.1109/CAMSAP.2009.5413241
Yildiz ME, Scaglione A. Directed gossiping for distributed data aggregation. In CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing. 2009. p. 53-56. 5413241 https://doi.org/10.1109/CAMSAP.2009.5413241
Yildiz, Mehmet E. ; Scaglione, Anna. / Directed gossiping for distributed data aggregation. CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing. 2009. pp. 53-56
@inproceedings{8145264469504ce0a15fd3759b88e633,
title = "Directed gossiping for distributed data aggregation",
abstract = "In this paper, we are studying a class of distributed data aggregation problems where a set of nodes in a network is interested in a function of data that is stored in another set of nodes. Assuming the function of interest is separable, we propose an algorithm based on gossiping schemes. Gossiping protocols are iterative methods based on near neighbor communications, and they are known to be efficient and robust to link/node failures. In this work, after formulating the problem mathematically, and introducing previously proposed necessary and sufficient conditions on the gossiping updates, we introduce several necessary conditions on the feasible codes which will provide significant intuition in determining the (in)feasibility of a given problem. By focusing on stochastic codes, we provide a necessary condition based on topology and discuss scenarios where the codes we seek cannot be found.",
keywords = "Data aggregation, Distributed algorithms, Gossiping algorithms",
author = "Yildiz, {Mehmet E.} and Anna Scaglione",
year = "2009",
doi = "10.1109/CAMSAP.2009.5413241",
language = "English (US)",
isbn = "9781424451807",
pages = "53--56",
booktitle = "CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing",

}

TY - GEN

T1 - Directed gossiping for distributed data aggregation

AU - Yildiz, Mehmet E.

AU - Scaglione, Anna

PY - 2009

Y1 - 2009

N2 - In this paper, we are studying a class of distributed data aggregation problems where a set of nodes in a network is interested in a function of data that is stored in another set of nodes. Assuming the function of interest is separable, we propose an algorithm based on gossiping schemes. Gossiping protocols are iterative methods based on near neighbor communications, and they are known to be efficient and robust to link/node failures. In this work, after formulating the problem mathematically, and introducing previously proposed necessary and sufficient conditions on the gossiping updates, we introduce several necessary conditions on the feasible codes which will provide significant intuition in determining the (in)feasibility of a given problem. By focusing on stochastic codes, we provide a necessary condition based on topology and discuss scenarios where the codes we seek cannot be found.

AB - In this paper, we are studying a class of distributed data aggregation problems where a set of nodes in a network is interested in a function of data that is stored in another set of nodes. Assuming the function of interest is separable, we propose an algorithm based on gossiping schemes. Gossiping protocols are iterative methods based on near neighbor communications, and they are known to be efficient and robust to link/node failures. In this work, after formulating the problem mathematically, and introducing previously proposed necessary and sufficient conditions on the gossiping updates, we introduce several necessary conditions on the feasible codes which will provide significant intuition in determining the (in)feasibility of a given problem. By focusing on stochastic codes, we provide a necessary condition based on topology and discuss scenarios where the codes we seek cannot be found.

KW - Data aggregation

KW - Distributed algorithms

KW - Gossiping algorithms

UR - http://www.scopus.com/inward/record.url?scp=77951138411&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951138411&partnerID=8YFLogxK

U2 - 10.1109/CAMSAP.2009.5413241

DO - 10.1109/CAMSAP.2009.5413241

M3 - Conference contribution

AN - SCOPUS:77951138411

SN - 9781424451807

SP - 53

EP - 56

BT - CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing

ER -