Throughput-optimal broadcast on directed acyclic graphs
Name
Abhishek_Infocom_camera_ready_22Dec2014[1].pdf
Size
631.53 KB
Format
Adobe PDF
Checksum (MD5)
b27399c675f491b3771262fc2f3868b7
Author(s)
Sinha, Abhishek
Paschos, Georgios
Li, Chih-ping
Modiano, Eytan H.
Date Issued
April 2015
Journal
Proceedings of the 2015 IEEE Conference on Computer Communications (INFOCOM)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Sinha, Abhishek, Georgios Paschos, Chih-ping Li, and Eytan Modiano. “Throughput-Optimal Broadcast on Directed Acyclic Graphs.” 2015 IEEE Conference on Computer Communications (INFOCOM) (April 2015).
Version
Author's final manuscript
Abstract
We study the problem of broadcasting packets in wireless networks. At each time slot, a network controller activates non-interfering links and forwards packets to all nodes at a common rate; the maximum rate is referred to as the broadcast capacity of the wireless network. Existing policies achieve the broadcast capacity by balancing traffic over a set of spanning trees, which are difficult to maintain in a large and time-varying wireless network. We propose a new dynamic algorithm that achieves the broadcast capacity when the underlying network topology is a directed acyclic graph (DAG). This algorithm utilizes local queue-length information, does not use any global topological structures such as spanning trees, and uses the idea of in-order packet delivery to all network nodes. Although the in-order packet delivery constraint leads to degraded throughput in cyclic graphs, we show that it is throughput optimal in DAGs and can be exploited to simplify the design and analysis of optimal algorithms. Our simulation results show that the proposed algorithm has superior delay performance as compared to tree-based approaches.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFOCOM.2015.7218500
