IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A Delay Composition Theorem for Real-Time Pipelines
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Optimal delay scheduling in networks with arbitrary constraints
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
ACM Transactions on Algorithms (TALG)
End-to-End Delay Analysis of Distributed Systems with Cycles in the Task Graph
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Efficient network QoS provisioning based on per node traffic shaping
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
On the capacity of mobile ad hoc networks with delay constraints
IEEE Transactions on Wireless Communications
Optimal multiplexing on a single link: delay and buffer requirements
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Integration of QoS and congestion control in multi-hop wireless networks
Proceedings of the 10th International Conference on Mobile and Ubiquitous Multimedia
Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE/ACM Transactions on Networking (TON)
Distributed scheduling schemes for wireless mesh networks: A survey
ACM Computing Surveys (CSUR)
Approximation algorithms for throughput maximization in wireless networks with delay constraints
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We study the end-to-end delay bounds that can be achieved in wireless networks using packet deadlines. We assume a set of flows in the network, for which flow i has burst parameter ωi, injection rate ρi, and path length Ki. It was already known that, in wireline networks, the Coordinated-Earliest-Deadline-First (CEDF) protocol can achieve and end-to-end delay of approximately (ωi/ρi)+Ki, whereas other schedulers such as Weighted Fair Queuing, have end-to-end delay bounds of the form (ωi + Ki)/ρi. For the case of wireless networks of arbitrary topology, the focus has typically been more on throughput optimality than minimizing delay. In this paper, we study the delay bounds that can be achieved by combining wireless link scheduling algorithms with a CEDF packet scheduler. We first present a centralized scheduler that has an end-to-end delay of approximately O(ω/ρi + Σl∈pi N/rl), where rl is the total rate of flows through link l, N is the number of links in the network, and pi is the path followed by packets of flow i. We then show how to convert this into a distributed scheduler. We also study the extent to which results on the schedulability of packet deadlines can be carried over from the wireline to the wireless context. Lastly, we examine ways in which the theoretical schedulers considered in this paper can be transferred to a more practical random-access based setting. This work was supported by NSF contract CCF-0728980 and was performed while the first author was visiting Bell Labs in Summer, 2009.