Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks

—The problem of online packet scheduling with hard deadlines has been studied extensively in the single hop setting, whereas it is notoriously difficult in the multihop setting. This difficulty stems from the fact that packet scheduling decisions at each hop influences and are influenced by decisions on other hops and only a few provably efficient online scheduling algorithms exist in the multihop setting. We consider a multihop wired network (interference free and full duplex transmissions) in which packets with various deadlines and weights arrive at and are destined to different nodes through given routes. We study the problem of joint admission control and packet scheduling in order to maximize the cumulative weights of the packets that reach their destinations within their deadlines. We first focus on uplink transmissions in the tree topology and show that the well known earliest deadline first algorithm achieves the same performance as the optimal off-line algorithm for ...

• Type: Journal
• Year: 2016
• Where: TON
• Authors: Zhoujia Mao, Can Emre Koksal, Ness B. Shroff
• Keywords: TON 2016