On the Possibility of Network Scheduling With Polynomial Complexity and Delay.
Arsalan Sharif-NassabS. Jamaloddin GolestaniPublished in: IEEE/ACM Trans. Netw. (2017)
Keyphrases
- network size
- scheduling problem
- resource utilization
- critical path
- communication networks
- scheduling algorithm
- asynchronous transfer mode
- computer networks
- network traffic
- resource allocation
- parallel machines
- complex networks
- network structure
- transmission rate
- network congestion
- polynomial hierarchy
- vapnik chervonenkis dimension
- transmission delay