arxiv: Computer Science::Networking and Internet Architecture | Computer Science::Operating Systems
We consider multi-hop wireless networks serving multiple flows in which only packets that meet hard end-to-end deadline constraints are useful, i.e., if a packet is not delivered to its destination node by its deadline, it is dropped from the network. We design decentra... View more
 L. Tassiulas and Anthony Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” IEEE Transactions on Automatic Control, vol. 37, no. 12, pp. 1936-1948, Dec 1992.
 A. Stolyar, “Max weight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic,” in Annals of Applied Probability, vol. 14, no. 1, 2004, pp. 1-53.
 S. Zhang and V. K. N. Lau, “Resource allocation for ofdma system with orthogonal relay using rateless code,” IEEE Transactions on Wireless Communications,, vol. 7, Nov. 2008.
 M. Duarte and A. Sabharwal, “Full-duplex wireless communications using off-the-shelf radios: Feasibility and first results,” in Proceedings of ASILOMAR, 2010, pp. 1558-1562.
 J. I. Choi, M. Jain, K. Srinivasan, P. Levis, and S. Katti, “Achieving single channel, full duplex wireless communication,” in ACM MobiCom, 2010.
 C. Hwang and A. Masud, Multiple Objective Decision Making Methods and Applications. Springer-Verlag New York, Inc., 1979.
 J.C. Gittins, K. Glazebrook, and R. Weber, Multi-armed Bandit Allocation Indices. John Wiley & Sons, 2011.
 Peter Whittle, “Restless bandits: Activity allocation in a changing world,” Journal of Applied Probability, vol. 25, pp. 287-298, 1988.
tu 80 p h ug 75 o r Th 70 0
 R. R. Weber and G. Weiss, “On an index policy for restless bandits,” Journal of Applied Probability, vol. 27, no. 3, pp. pp. 637-648, 1990.