Distributed multi-hop scheduling and medium access with delay and throughput constraints
Proceedings of the 7th annual international conference on Mobile computing and networking
A framework for guaranteeing statistical QoS
IEEE/ACM Transactions on Networking (TON)
Distributed priority scheduling and medium access in ad hoc networks
Wireless Networks
Designing multihop wireless backhaul networks with delay guarantees
Wireless Networks
Providing deterministic end-to-end fairness guarantees in core-stateless networks
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Approximation algorithms for throughput maximization in wireless networks with delay constraints
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly when packets incur low delays at upstream nodes, downs stream nodes can reduce priority and schedule other packets first. The goal of this paper is to define a framework for design and analysis of coordinated network scheduling (CNS) which exploit such inter-node coordination. The first provide a general CNS definition which enables us to classify a number of schedulers from the literature including, FIFO+, CEDF and work-conserving CJVC as examples of CNS schedulers. We then develop a distributed theory of traffic envelopes which enables us to derive end-to-end statistical admission control conditions for CNS schedulers. We show that CNS schedulers are able to limit traffic distortion to within a narrow range resulting in improved end-to-end performance and more efficient resource utilization.