This paper presents an end-to-end congestion control algorithm optimized to support background transfers. Surprisingly, an end-to-end protocol can nearly approximate the ideal router-prioritization strategy by almost eliminating interference with demand flows and reaping significant fractions of available spare network bandwidth. The Internet experiments suggest that there is a significant amount of spare capacity on a wide variety of Internet links. Nice provides a mechanism to improve application performance by harnessing this capacity in a non-interfering manner.
Did you find this white paper useful?
4 out of 9 users found this white paper useful
Related white papers
Exploring Real Time Multimedia Content Creation in Video Games
Video games represent a class of media applications for which creating video content is as important as displaying it. This paper compares video games running on an Apple Macintosh G5...
neosnetworks: Delivering "Liquid Bandwidth" Ethernet Services
Neos created the Ethernet Service Provider (ESP) market in the UK in October 2001 and today has 100% market share. Neos is the UK's fastest-growing service provider, having achieved a...
Maximizing Bandwidth in CCII for Wireless Optical Applications
This paper discusses bandwidth problems associated with the usage of second-generation current conveyors in wireless optical systems, and presents a new current amplifier with wide bandwidth and large input dynamic...
Performance and Implementation of Dynamic Frequency Hopping in Limited-Bandwidth Cellular Systems
This paper evaluates the performance of recently proposed Dynamic Frequency Hopping (DFH) when applied to cellular systems with a limited total bandwidth. The paper also illustrates a practical implementation for...
The Effect of Bandwidth on Speech Intelligibility
Of all the elements that affect the intelligibility of speech in telephony, bandwidth has been shown to be one of the most critical. This paper discusses the relation between bandwidth...
On Orthogonal Reduction to Hessenberg Form With Small Bandwidth
Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix A to a more convenient form. One of the most useful types of such reduction...
A Two-Stage Plug-in Bandwidth Selection and Its Implementation for Covariance Estimation
The two most popular bandwidth choice rules for kernel HAC estimation have been proposed by Andrews (1991) and Newey and West (1994). This paper suggests an alternative approach that estimates...
