Heavy-tailed probability distributions in the World Wide Web
A practical guide to heavy tails
Scheduling data transfers in a network and the set scheduling problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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)
Stability and performance analysis of networks supporting elastic services
IEEE/ACM Transactions on Networking (TON)
Dynamic multi-path routing: asymptotic approximation and simulations
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fixed point approximations for TCP behavior in an AQM network
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Internet stream size distributions
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SRPT Scheduling for Web Servers
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Predictive routing to enhance QoS for stream-based flows sharing excess bandwidth
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Class of End-to-End Congestion Control Algorithms for the Internet
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
Classifying scheduling policies with respect to higher moments of conditional response time
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Stability of size-based scheduling disciplines in resource-sharing networks
Performance Evaluation - Performance 2005
Delay-optimal scheduling in bandwidth-sharing networks
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
Equilibrium analysis through separation of user and network behavior
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
With a view on improving user-perceived performance on networks supporting best effort flows, e.g., multimedia/data file transfers, we propose a family of bandwidth allocation criteria that depends on the residual work of on-going transfers. Analysis and simulations show that allocating bandwidth in this fashion can significantly improve the user-perceived delay, bit transmission delay, and throughput over traditional approaches, e.g., by 58% on an 80% loaded linear network. A simple implementation based on TCP Reno, exemplifies how one might approach practically realizing such gains. We discuss several other advantages of incorporating such differentiation at the transport level. In particular we make the case that favoring small transfers combined with user impatience or peak rate constraints, both of which are natural mechanisms for users to express the utility of completing transfers, offers a lightweight approach to achieving good overall network goodput and/or utility for best effort networks.