On Fundamental Tradeoffs Between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms
Book information
Description
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 1, FEBRUARY 2005.Computational complexity, decision tree, delay bound, packet scheduling, quality of service.
Similar books
Networks Illustrated: 8 Principles Without Calculus
EPUB
Компьютерные сети
250 Networking Interview Questions and Answers
RAR
Mike Meyers’ CompTIA Network+ Certification Passport (Exam N10-005)
EPUB
Mike Meyers' CompTIA Network+ Guide to Managing and Troubleshooting Networks Lab Manual (Exam N10-005)
Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo
Компьютерные сети
RTF