On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms.
Jun (Jim) XuRichard J. LiptonPublished in: SIGCOMM (2002)
Keyphrases
- scheduling algorithm
- computational complexity
- response time
- loss probability
- worst case
- scheduling strategy
- special case
- real time database systems
- packet switching
- destination node
- packet loss
- end to end delay
- packet delay
- lower bound
- buffer size
- objective function
- qos requirements
- packet scheduling
- resource requirements
- computational grids
- multicast tree
- np hard