Sciweavers

8 search results - page 2 / 2
» On the Competitiveness of AIMD-TCP within a General Network
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 5 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
RTCSA
2003
IEEE
13 years 10 months ago
An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
Pangfeng Liu, Da-Wei Wang, Yi-Heng Guo
SIGCOMM
2004
ACM
13 years 10 months ago
A comparison of overlay routing and multihoming route control
The limitations of BGP routing in the Internet are often blamed for poor end-to-end performance and prolonged connectivity interruptions. Recent work advocates using overlays to e...
Aditya Akella, Jeffrey Pang, Bruce M. Maggs, Srini...