مرکز منطقه ای اطلاع رساني علوم و فناوري - On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms

Title of article :

On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms

Author/Authors :

Jun Xu، نويسنده , , Lipton، نويسنده , , R.J.، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2005

Pages :

From page :

To page :

Keywords :

computational complexity , delaybound , Decision tree , Packet scheduling , quality of service.

Journal title :

IEEE/ ACM Transactions on Networking

Serial Year :

2005

Journal title :

IEEE/ ACM Transactions on Networking

Record number :

376066

Link To Document :