DocumentCode :
2990953
Title :
Network computing capacity for the reverse butterfly network
Author :
Appuswamy, Rathinakumar ; Franceschetti, Massimo ; Karamchandani, Nikhil ; Zeger, Kenneth
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, San Diego, La Jolla, CA, USA
fYear :
2009
fDate :
June 28 2009-July 3 2009
Firstpage :
259
Lastpage :
262
Abstract :
We study the computation of the arithmetic sum of the q-ary source messages in the reverse butterfly network. Specifically, we characterize the maximum rate at which the message sum can be computed at the receiver and demonstrate that linear coding is suboptimal.
Keywords :
linear codes; source coding; arithmetic sum; linear coding; message sum; network computing capacity; q-ary source messages; reverse butterfly network; Arithmetic; Complexity theory; Computational modeling; Computer networks; Distributed computing; Network coding; Network topology; Routing; Wireless communication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
Type :
conf
DOI :
10.1109/ISIT.2009.5205983
Filename :
5205983
Link To Document :
بازگشت