SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
IEEE/ACM Transactions on Networking (TON)
High performance TCP in ANSNET
ACM SIGCOMM Computer Communication Review
SCED: a generalized scheduling policy for guaranteeing quality-of-service
IEEE/ACM Transactions on Networking (TON)
Proportional differentiated services: delay differentiation and packet scheduling
IEEE/ACM Transactions on Networking (TON)
Delay jitter bounds and packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A Novel Scheduler For a Low Delay Service Within Best-Effort
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Delay Bounds in a Network with Aggregate Scheduling
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
EDS: A New Scalable Service Differentiation Architecture for Internet
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
A Service-Curve Model with Loss and a Multiplexing Problem
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Policing congestion response in an internetwork using re-feedback
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Open issues in router buffer sizing
ACM SIGCOMM Computer Communication Review
Rd network services: differentiation through performance incentives
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Experimental study of router buffer sizing
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Reflections on the TCP macroscopic model
ACM SIGCOMM Computer Communication Review
On the feasibility of dynamic congestion-based pricing in differentiated services networks
IEEE/ACM Transactions on Networking (TON)
Output characterization of constant bit rate traffic in FIFO networks
IEEE Communications Letters
Router buffer sizing for TCP traffic and the role of the output/input capacity ratio
IEEE/ACM Transactions on Networking (TON)
The drop from front strategy in TCP and in TCP over ATM
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Approximation of generalized processor sharing with interleaved stratified timer wheels
IEEE/ACM Transactions on Networking (TON)
Bufferbloat: Dark Buffers in the Internet
IEEE Internet Computing
Impact of file arrivals and departures on buffer sizing in core routers
IEEE/ACM Transactions on Networking (TON)
ABE: providing a low-delay service within best effort
IEEE Network: The Magazine of Global Internetworking
Multi-network packet scheduling based on vehicular ad hoc network applications
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.00 |
This paper presents a novel approach to minimally invasive service differentiation in packet-switched networks. Instead of actively managing service allocation, a simple differentiated queueing algorithm provides traffic classes with essentially the same best-effort service that would result from plain FIFO service using a single queue for all traffic. However, each class is served from a separate virtual queue, which is configured with an individual deterministic delay bound that is enforced in the presence of dynamically varying packet arrival rates. The main advantage of such a scheme for service differentiation is administrative simplicity, because it only needs minimal configuration by a network operator and does not necessarily require control plane functionality. Further, it does not inherently prefer some traffic classes over others and thus satisfies even the most radical definitions of network neutrality. In the paper, the basic approach is motivated with the help of various use case scenarios. A fairly simple and efficient algorithm is presented to implement the differentiated queueing scheme. Finally, a number of simulation experiments and results are shown that confirm the intuitive functionality of the algorithm.