Scheduling multicast traffic with deadlines in wireless networks
Name
draft-v4 copy.pdf
Size
439.88 KB
Format
Adobe PDF
Checksum (MD5)
b787f7a8b246b27c4bd6e1f979d94fe7
Author(s)
Kim, Kyu Seob
Li, Chih Ping
Modiano, Eytan H
Date Issued
July 2014
Journal
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Kim, Kyu Seob, et al. "Scheduling Multicast Traffic with Deadlines in Wireless Networks." IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, 27 April - May 2 2014, Toronto, Canada, IEEE, 2014, pp. 2193–201.
Version
Author's final manuscript
Abstract
We consider the problem of transmitting multicast flows with hard deadlines over unreliable wireless channels. Every user in the network subscribes to several multicast flows, and requires a minimum throughput for each subscribed flow to meet the QoS constraints. The network controller schedules the transmissions of multicast traffic based on the instant feedback from the users. We characterize the multicast throughput region by analyzing its boundary points, each of which is the solution to a finite-horizon dynamic programming problem over an exponentially large state space. Using backward induction and interchange arguments, we show that the dynamic programming problems are solved by greedy policies that maximize the immediate weighted sum throughput in every slot. Furthermore, we develop a dynamic throughput-optimal policy that achieves any feasible throughput vector by tracking the running performance received by the users.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFOCOM.2014.6848162
