Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
A simulation study of fair queueing and policy enforcement
ACM SIGCOMM Computer Communication Review
Determining End-to-End Delay Bounds in Heterogeneous Networks
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
FRAME-BASED FAIR QUEUEING: A NEW TRAFFIC SCHEDULING ALGORITHM FOR PACKET-SWITCHED NETWORKS
FRAME-BASED FAIR QUEUEING: A NEW TRAFFIC SCHEDULING ALGORITHM FOR PACKET-SWITCHED NETWORKS
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
Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A hierarchical fair service curve algorithm for link-sharing, real-time and priority services
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing algorithms for packet-switched networks
IEEE/ACM Transactions on Networking (TON)
Real-time block transfer under a link-sharing hierarchy
IEEE/ACM Transactions on Networking (TON)
Router plugins: a software architecture for next generation routers
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Efficient algorithms for scheduling data broadcast
Wireless Networks
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Multiclass priority fair queuing for hybrid wired/wireless quality of service support
WOWMOM '99 Proceedings of the 2nd ACM international workshop on Wireless mobile multimedia
An integrated congestion management architecture for Internet hosts
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Architectural considerations for next generation file systems
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Router plugins: a software architecture for next-generation routers
IEEE/ACM Transactions on Networking (TON)
A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services
IEEE/ACM Transactions on Networking (TON)
Scheduling computations on a software-based router
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Fair queuing for aggregated multiple links
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Cello: A Disk Scheduling Framework for Next Generation Operating Systems*
Real-Time Systems - Flexible Scheduling on Real-Time Systems
A game-theoretic approach towards congestion control in communication networks
ACM SIGCOMM Computer Communication Review
A new hybrid broadcast scheduling algorithm for asymmetric communication systems
ACM SIGMOBILE Mobile Computing and Communications Review
WRAPS Scheduling and Its Efficient Implementation on Network Processors
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Integrated Provision of QoS Guarantees to Unicast and Multicast Traffic in Packet Switches
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Enhanced Weighted Round Robin Schedulers for Bandwidth Guarantees in Packet Networks
QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Packet-Size Based Queuing Algorithm for QoS Support
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Predictive scheduling of network processors
Computer Networks: The International Journal of Computer and Telecommunications Networking - Network processors
Architectural considerations for next-generation file systems
Multimedia Systems
A Scalable Architecture for Fair Leaky-Bucket Shaping
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Real-Time Block Transfer Under a Link Sharing Hierarchy
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
General Methodology for Designing Efficient Traffic Scheduling and Shaping Algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Performance Analysis of QoS Mechanisms in IP Networks
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
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
Approximate fairness through differential dropping
ACM SIGCOMM Computer Communication Review
Assessing and Improving TCP Rate Shaping over Edge Gateways
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
Journal of Network and Systems Management
SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks
IEEE/ACM Transactions on Networking (TON)
Building extensible routers using network processors: Research Articles
Software—Practice & Experience
Group round robin: improving the fairness and complexity of packet scheduling
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture
Precomputation for intra-domain QoS routing
Computer Networks and ISDN Systems
The Stratified Round Robin scheduler: design, analysis and implementation
IEEE/ACM Transactions on Networking (TON)
Hierarchical resource allocation for robust in-home video streaming
Journal of Systems and Software
Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Retrofitting quality of service into a time-sharing operating system
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
A queue management algorithm for fair bandwidth allocation
Computer Communications
Structured streams: a new transport abstraction
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Memory performance attacks: denial of memory service in multi-core systems
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Exact GPS simulation and optimal fair scheduling with logarithmic complexity
IEEE/ACM Transactions on Networking (TON)
Vertical dimensioning: A novel DRR implementation for efficient fair queueing
Computer Communications
Trading off resources between overlapping overlays
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Analysis of virtual-time complexity in weighted fair queuing
Computer Communications
A fair scheduling algorithm with traffic classification for wireless networks
Computer Communications
Precomputation for intra-domain QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Rainbow fair queueing: theory and applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS-aware adaptation for satellite multimedia broadcasting via hierarchical packet scheduling
IEEE Wireless Communications - Special issue title on applications and support technical for mobility and enterprise services
Differential virtual time (DVT): rethinking I/O service differentiation for virtual machines
Proceedings of the 1st ACM symposium on Cloud computing
Buffer management mechanism suitable for TCP streaming in QoS-aware IP router
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Algorithms and theory of computation handbook
Grouping packet scheduling for virtual networks by genetic algorithm
Proceedings of the 6th International Conference on Future Internet Technologies
Trading off resources between overlapping overlays
Middleware'06 Proceedings of the 7th ACM/IFIP/USENIX international conference on Middleware
A novel low latency packet scheduling scheme for broadband networks
PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part II
An enhanced packet scheduling algorithm for qos support in IEEE 802.16 wireless network
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
SENIC: scalable NIC for end-host rate limiting
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
Hierarchical Packet Fair Queueing (H-PFQ) algorithms have the potential to simultaneously support guaranteed real-time service, rate-adaptive best-effort, and controlled link-sharing service. In this paper, we design practical H-PFQ algorithms by using one-level Packet Fair Queueing (PFQ) servers as basic building blocks, and develop techniques to analyze delay and fairness properties of the resulted H-PFQ servers. We demonstrate that, in order to provide tight delay bounds in a H-PFQ server, it is essential for the one-level PFQ servers to have small Worst-case Fair Indices (WFI). We propose a new one-level PFQ algorithm called WF2Q+ that is the first to have all the following three properties: (a) providing the tightest delay bound among all PFQ algorithms; (b) having the smallest WFI among all PFQ algorithms; and (c) having a relatively low implementation complexity of O(log N). We show that practical H-PFQ algorithms can be implemented by using WF2Q+ as the basic building block and prove that the resulting H-WF2Q+ algorithms provide similar delay bounds and bandwidth distribution as those provided by a H-GPS server. Simulation experiments are presented to evaluate the proposed algorithm.