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

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 1, FEBRUARY 2005.
Computational complexity, decision tree, delay bound, packet scheduling, quality of service.

Author(s): Xu J., Lipton R.

Language: English
Commentary: 461455
Tags: Библиотека;Компьютерная литература;Компьютерные сети