NDLI: Network information flow: Gossiping with groups

Content Provider	IEEE Xplore Digital Library
Author	Yildiz, M.E. Aysal, T.C. Scaglione, A.
Copyright Year	2008
Description	Author affiliation: Sch. of Electr. & Comput. Eng., Cornell Univ., Ithaca, NY (Yildiz, M.E.; Aysal, T.C.)
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.
Starting Page	1175
Ending Page	1179
File Size	270309
Page Count	5
File Format	PDF
ISBN	9781424429400
ISSN	10586393
DOI	10.1109/ACSSC.2008.5074600
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-10-26
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Relays Protocols Wireless sensor networks Network coding Computer networks Data flow computing Data engineering Information retrieval Sufficient conditions Convergence stochastic matrices Information relay gossiping algorithms
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computer Networks and Communications

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

Computing along the routes via gossiping

A new achievable rate for a stochastic two relay network with no interference

Directed gossiping for distributed data aggregation

Distributed estimation of the maximum value over a Wireless Sensor Network

Gossip Algorithms for Distributed Signal Processing

Computing Along Routes via Gossiping

Cross-layer optimizations for Intersession Network Coding on practical 2-hop relay networks

A Cooperative MMSE Relay Strategy for Wireless Sensor Networks

Soft network coding in wireless two-way relay channels

Network information flow: Gossiping with groups

Similar Documents

Computing along the routes via gossiping

A new achievable rate for a stochastic two relay network with no interference

Directed gossiping for distributed data aggregation

Distributed estimation of the maximum value over a Wireless Sensor Network

Gossip Algorithms for Distributed Signal Processing

Computing Along Routes via Gossiping

Cross-layer optimizations for Intersession Network Coding on practical 2-hop relay networks

A Cooperative MMSE Relay Strategy for Wireless Sensor Networks

Soft network coding in wireless two-way relay channels

Network information flow: Gossiping with groups