Sciweavers

8009 search results - page 1386 / 1602
» cans 2005
Sort
View
SIGCOMM
2005
ACM
16 years 7 days ago
On the predictability of large transfer TCP throughput
Predicting the throughput of large TCP transfers is important for a broad class of applications. This paper focuses on the design, empirical evaluation, and analysis of TCP throug...
Qi He, Constantinos Dovrolis, Mostafa H. Ammar
SIGCOMM
2005
ACM
16 years 7 days ago
Declarative routing: extensible routing with declarative queries
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior researc...
Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, ...
SIGCOMM
2005
ACM
16 years 7 days ago
Limitations of equation-based congestion control
We study limitations of an equation-based congestion control protocol, called TFRC (TCP Friendly Rate Control). It examines how the three main factors that determine TFRC throughp...
Injong Rhee, Lisong Xu
SIGCOMM
2005
ACM
16 years 7 days ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
16 years 7 days ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
« Prev « First page 1386 / 1602 Last » Next »