Optimal Control of Distributed Computing Networks with Mixed-Cast Traffic Flows
Name
1805.10527.pdf
Description
Accepted version
Size
581.2 KB
Format
Unknown
Checksum (MD5)
2f3c2a63bf0c7901e34c6657697a9bcb
Author(s) • • • •
Zhang, Jianan
Sinha, Abhishek
Llorca, Jaime
Tulino, Antonia
Modiano, Eytan H
Date Issued
October 2018
Journal
IEEE Conference on Computer Communications (IEEE INFOCOM 2018)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Zhang, Jianan et al. "Optimal Control of Distributed Computing Networks with Mixed-Cast Traffic Flows." IEEE Conference on Computer Communications, April 2018, Honolulu, HI, USA, Institute of Electrical and Electronics Engineers, October 2018. © 2018 IEEE
Version
Author's final manuscript
Abstract
Distributed computing networks, tasked with both packet transmission and processing, require the joint optimization of communication and computation resources. We develop a dynamic control policy that determines both routes and processing locations for packets upon their arrival at a distributed computing network. The proposed policy, referred to as Universal Computing Network Control (UCNC), guarantees that packets i) are processed by a specified chain of service functions, ii) follow cycle-free routes between consecutive functions, and iii) are delivered to their corresponding set of destinations via proper packet duplications. UCNC is shown to be throughput-optimal for any mix of unicast and multicast traffic, and is the first throughput-optimal policy for non-unicast traffic in distributed computing networks with both communication and computation constraints. Moreover, simulation results suggest that UCNC yields substantially lower average packet delay compared with existing control policies for unicast traffic.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/infocom.2018.8485956