Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Introduction to Stochastic Dynamic Programming: Probability and Mathematical
Introduction to Stochastic Dynamic Programming: Probability and Mathematical
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Resource Allocation with Persistent and Transient Flows
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
ACM SIGMETRICS Performance Evaluation Review
An efficient local predictive method for distributed timeslot allocation in CDMA/TDD
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
The flow control algorithms currently used in the Internet have been tailored to share available capacity between users on the basis of the physical characteristics of the network links they use rather than the characteristics of their applications. However, real-time applications typically have very different requirements from file transfer or Web browsing, and treating them identically can result in a perception of poor quality of service even when adequate bandwidth is available. This is the motivation for differentiated services. In this paper, we explore service differentiation between persistent (fixed duration) and transient (fixed volume) flows, and also between transient flows of markedly different sizes; the latter is stimulated by current discussion on Web mice and elephants. We propose decentralized bandwidth allocation algorithms that can be implemented by end-systems without requiring the support of a complex network architecture, and show that they achieve performance very close to what is achievable by the optimal centralized scheme.