Sciweavers

804 search results - page 87 / 161
» Uncooperative congestion control
Sort
View
INFOCOM
2006
IEEE
14 years 3 months ago
Loss-Cognizant Pricing in Feed-Forward Networks with Greedy Users
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
Ashraf Al Daoud, Murat Alanyali
ISOLA
2010
Springer
13 years 7 months ago
Towards More Adaptive Voice Applications
With the Internet designed to provide best-effort packet transmission, applications are expected to adapt dynamically to the operating conditions observed in the network. For this ...
Jörg Ott
SIGCOMM
2012
ACM
11 years 11 months ago
TUBE: time-dependent pricing for mobile data
The two largest U.S. wireless ISPs have recently moved towards usage-based pricing to better manage the growing demand on their networks. Yet usage-based pricing still requires IS...
Sangtae Ha, Soumya Sen, Carlee Joe-Wong, Youngbin ...
SIGCOMM
2012
ACM
11 years 11 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
SIGCOMM
2004
ACM
14 years 2 months ago
Sizing router buffers
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
Guido Appenzeller, Isaac Keslassy, Nick McKeown