Comparison of QOS Fixed and Limited Interleaved Polling with Cyclic Demand Proportionality Algorithms.

Sadeta Krijestorac Jonathan Bagby

Published in: ITNG (2009)

Keyphrases

computational complexity
significant improvement
computational cost
optimization problems
computationally efficient
times faster
real time
machine learning
learning algorithm
data structure
lower bound
scheduling problem
theoretical analysis
orders of magnitude
routing algorithm
service differentiation