On Fundamental Tradeoffs Between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms.
Saved in:
| Title: | On Fundamental Tradeoffs Between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms. |
|---|---|
| Authors: | Xu, Jun, Lipton, Richard J. |
| Source: | IEEE/ACM Transactions on Networking; February 2005, Vol. 13 Issue 1, p15-28, 14p |
| Database: | Applied Science & Technology Source |
| ISSN: | 10636692 |
|---|---|
| DOI: | 10.1109/TNET.2004.842223 |
