Sciweavers

11051 search results - page 2085 / 2211
» An Investigation of Generalized Cases
Sort
View
195
Voted
SIGCOMM
2005
ACM
16 years 18 days 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...
SIGCOMM
2005
ACM
16 years 18 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
215
Voted
SIGCOMM
2005
ACM
16 years 18 days 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...
189
Voted
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
16 years 18 days ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter
196
Voted
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
16 years 18 days ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
« Prev « First page 2085 / 2211 Last » Next »