### Abstract

In this paper, we consider a networking scenario in which a group of nodes wants retrieve a function of another group of nodes data. Here we assume that the function can be cast into a sum of functions of the local variables, a case that subsumes several interesting types of queries. One approach to solve this problem is to route the information from each node to the interested parties one at a time, relaying it over a tree of paths. A second strategy is to reuse the paths when possible, multicasting to the intended recipients the data. A third one, which is the one we are interested in exploring, computes along the routes as well. More specifically, the goal of this paper is to examine how the sought information be forwarded to the intended recipients, computing along the routes by gossiping with selected neighbors. Unlike the context of standard gossiping, in our problem the information needs to flow in a specific direction. In this work we provide a sufficient condition for the convergence to the desired result, and propose a method how to design the information flow for a given network and a problem.

Original language | English (US) |
---|---|

Title of host publication | Conference Record - Asilomar Conference on Signals, Systems and Computers |

Pages | 1175-1179 |

Number of pages | 5 |

DOIs | |

State | Published - 2008 |

Externally published | Yes |

Event | 2008 42nd Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2008 - Pacific Grove, CA, United States Duration: Oct 26 2008 → Oct 29 2008 |

### Other

Other | 2008 42nd Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2008 |
---|---|

Country | United States |

City | Pacific Grove, CA |

Period | 10/26/08 → 10/29/08 |

### Fingerprint

### Keywords

- Atochastic matrices
- Gossiping algorithms
- Information relay

### ASJC Scopus subject areas

- Computer Networks and Communications
- Signal Processing

### Cite this

*Conference Record - Asilomar Conference on Signals, Systems and Computers*(pp. 1175-1179). [5074600] https://doi.org/10.1109/ACSSC.2008.5074600

**Network information flow : Gossiping with groups.** / Yildiz, Mehmet E.; Aysal, Tuncer C.; Scaglione, Anna.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Conference Record - Asilomar Conference on Signals, Systems and Computers.*, 5074600, pp. 1175-1179, 2008 42nd Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2008, Pacific Grove, CA, United States, 10/26/08. https://doi.org/10.1109/ACSSC.2008.5074600

}

TY - GEN

T1 - Network information flow

T2 - Gossiping with groups

AU - Yildiz, Mehmet E.

AU - Aysal, Tuncer C.

AU - Scaglione, Anna

PY - 2008

Y1 - 2008

N2 - In this paper, we consider a networking scenario in which a group of nodes wants retrieve a function of another group of nodes data. Here we assume that the function can be cast into a sum of functions of the local variables, a case that subsumes several interesting types of queries. One approach to solve this problem is to route the information from each node to the interested parties one at a time, relaying it over a tree of paths. A second strategy is to reuse the paths when possible, multicasting to the intended recipients the data. A third one, which is the one we are interested in exploring, computes along the routes as well. More specifically, the goal of this paper is to examine how the sought information be forwarded to the intended recipients, computing along the routes by gossiping with selected neighbors. Unlike the context of standard gossiping, in our problem the information needs to flow in a specific direction. In this work we provide a sufficient condition for the convergence to the desired result, and propose a method how to design the information flow for a given network and a problem.

AB - In this paper, we consider a networking scenario in which a group of nodes wants retrieve a function of another group of nodes data. Here we assume that the function can be cast into a sum of functions of the local variables, a case that subsumes several interesting types of queries. One approach to solve this problem is to route the information from each node to the interested parties one at a time, relaying it over a tree of paths. A second strategy is to reuse the paths when possible, multicasting to the intended recipients the data. A third one, which is the one we are interested in exploring, computes along the routes as well. More specifically, the goal of this paper is to examine how the sought information be forwarded to the intended recipients, computing along the routes by gossiping with selected neighbors. Unlike the context of standard gossiping, in our problem the information needs to flow in a specific direction. In this work we provide a sufficient condition for the convergence to the desired result, and propose a method how to design the information flow for a given network and a problem.

KW - Atochastic matrices

KW - Gossiping algorithms

KW - Information relay

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

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

U2 - 10.1109/ACSSC.2008.5074600

DO - 10.1109/ACSSC.2008.5074600

M3 - Conference contribution

AN - SCOPUS:70349684816

SN - 9781424429417

SP - 1175

EP - 1179

BT - Conference Record - Asilomar Conference on Signals, Systems and Computers

ER -