Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
Journal of the ACM (JACM)
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem
Journal of the ACM (JACM)
On the complexity of computing the measure of ∪[ai,bi]
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks
IEEE/ACM Transactions on Networking (TON)
Task Reweighting on Multiprocessors: Efficiency versus Accuracy
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
IEEE/ACM Transactions on Networking (TON)
On Supporting Power-Efficient Streaming Applications in Wireless Environments
IEEE Transactions on Mobile Computing
Group round robin: improving the fairness and complexity of packet scheduling
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Localized asynchronous packet scheduling for buffered crossbar switches
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
The Stratified Round Robin scheduler: design, analysis and implementation
IEEE/ACM Transactions on Networking (TON)
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Exact GPS simulation and optimal fair scheduling with logarithmic complexity
IEEE/ACM Transactions on Networking (TON)
A performance study of uplink scheduling algorithms in point-to-multipoint WiMAX networks
Computer Communications
Buffer management for lossless service in shared buffer switches
Journal of Parallel and Distributed Computing
ULS: A dual-Vth/high-κ nano-CMOS universal level shifter for system-level power management
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Fair queueing based packet scheduling for buffered crossbar switches
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Hi-index | 0.00 |
In this work, we clarify, extend and solve an open problem concerning the computational complexity for packet scheduling algorithms to achieve tight end-to-end delay bounds. We first focus on the difference between the time a packet finishes service in a scheduling algorithm and its virtual finish time under a GPS (General Processor Sharing) scheduler, called GPS-relative delay. We prove that, under a slightly restrictive but reasonable computational model, the lower bound computational complexity of any scheduling algorithm that guarantees O(1) GPS-relative delay bound is Ω (log2 n) (widely believed as a "folklore theorem" but never proved). We also discover that, surprisingly, the complexity lower bound remains the same even if the delay bound is relaxed to O(na) for 0‹a⋵1. This implies that the delay-complexity tradeoff curve is "flat" in the "interval" [O(1), O(n)). We later extend both complexity results (for O(1) or O(na) delay) to a much stronger computational model. Finally, we show that the same complexity lower bounds are conditionally applicable to guaranteeing tight end-to-end delay bounds. This is done by untangling the relationship between the GPS-relative delay bound and the end-to-end delay bound.