Sciweavers

23 search results - page 4 / 5
» sigcomm 2005
Sort
View
SIGCOMM
2005
ACM
14 years 3 months 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
14 years 3 months ago
One more bit is enough
Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing endto-end cong...
Yong Xia, Lakshminarayanan Subramanian, Ion Stoica...
SIGCOMM
2005
ACM
14 years 3 months 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
14 years 3 months 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
14 years 3 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...