View in EDS

On Fundamental Tradeoffs Between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms.

Saved in:
Bibliographic Details
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
Be the first to leave a comment!
You must be logged in first