Network Coding for Computing: Cut-Set Bounds

The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a target function f of the messages. The objective is to maximize the average number of times f can be computed per network usage, i.e.,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information theory Ročník 57; číslo 2; s. 1015 - 1030
Hlavní autori:	Appuswamy, R, Franceschetti, M, Karamchandani, N, Zeger, K
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.02.2011 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Capacity Coding Computation Computational modeling cut-set bound Encoding function computation Indexes information theory Mathematical analysis Mathematical models Messages Network coding Networks Receivers Steiner trees Studies throughput Upper bound Upper bounds
ISSN:	0018-9448, 1557-9654
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!