Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. How to Distribute Computation in Networks
This is not the latest version of this item. The latest version can be found here.

How to Distribute Computation in Networks

Thumbnail Image
Download
Name

1912.03531.pdf

Description
Submitted version
Size

495.58 KB

Format

Adobe PDF

Checksum (MD5)

7e5cf1481450139230081c660d47504d

sword-2021-03-09T17:55:41.original.xml (130 B)
Original SWORD entry document
Date Issued
July 2020
Journal
Proceedings - IEEE INFOCOM
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
2020. "How to Distribute Computation in Networks." Proceedings - IEEE INFOCOM, 2020-July.
Version
Original manuscript
Abstract
© 2020 IEEE. In network function computation is as a means to reduce the required communication flow in terms of number of bits transmitted per source symbol. However, the rate region for the function computation problem in general topologies is an open problem, and has only been considered under certain restrictive assumptions (e.g. tree networks, linear functions, etc.). In this paper, we propose a new perspective for distributing computation, and formulate a flow-based delay cost minimization problem that jointly captures the costs of communications and computation. We introduce the notion of entropic surjectivity as a measure to determine how sparse the function is and to understand the limits of computation. Exploiting Little's law for stationary systems, we provide a connection between this new notion and the computation processing factor that reflects the proportion of flow that requires communications. This connection gives us an understanding of how much a node (in isolation) should compute to communicate the desired function within the network without putting any assumptions on the topology. Our analysis characterizes the functions only via their entropic surjectivity, and provides insight into how to distribute computation. We numerically test our technique for search, MapReduce, and classification tasks, and infer for each task how sensitive the processing factor to the entropic surjectivity is.
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/137674
DOI of Published Version
10.1109/INFOCOM41043.2020.9155442
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.