On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms.
Jun (Jim) XuRichard J. LiptonPublished in: IEEE/ACM Trans. Netw. (2005)
Keyphrases
- scheduling algorithm
- computational complexity
- response time
- loss probability
- packet delay
- scheduling strategy
- end to end delay
- lower bound
- worst case
- packet switching
- packet scheduling
- destination node
- computational grids
- packet loss
- qos requirements
- low complexity
- resource requirements
- buffer size
- real time database systems
- special case
- scheduling policies
- asymptotically optimal
- multicast tree
- data objects
- end to end
- quality of service
- motion estimation
- np hard