Share and Export
Share and Export
Subramanian, Vijay G. and Leith, Douglas J. (2008) Draining time based scheduling algorithm. Conference on Decision and Control, 2007 46th IEEE.
![[thumbnail of cdc07_final.pdf]](https://mu.eprints-hosting.org/style/images/fileicons/application_pdf.png "cdc07_final.pdf")
PDF
cdc07_final.pdf
Download (264kB)
Abstract
Distributed scheduling and routing policies
that perform well are increasingly being sought
for multi-hop wireless infrastructure networks. The
state-of-the-art max-pressure algorithms have provably
optimal stability properties but in networks with
cycles and loops the delay performance can be quite
poor at rates that are not very close to the capacity
region boundary. We propose a new scheduling and
routing policy to try to address this that results in
serving the longest queue but routing packets along
(dynamic) shortest-path routes. For a two-node relay
we prove stability for our policy using fluid limits.
| Item Type: | Article |
|---|---|
| Keywords: | Queueing theory: Radio networks: Telecommunication network: Packet routing: Routing policy: Scheduling algorithm: Hamilton Institute; Shortest-path route: Two-node relay. |
| Academic Unit: | Faculty of Science and Engineering > Research Institutes > Hamilton Institute Faculty of Science and Engineering > Mathematics and Statistics |
| Item ID: | 1725 |
| Depositing User: | Hamilton Editor |
| Date Deposited: | 10 Dec 2009 15:12 |
| Journal or Publication Title: | Conference on Decision and Control, 2007 46th IEEE |
| Refereed: | Yes |
| URI: | https://mu.eprints-hosting.org/id/eprint/1725 |
| Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
- Item control page
Downloads
Downloads per month over past year
