806 search results - page 45 / 162 » Lower Bounds on Correction Networks |
168
click to vote
FORTE
2008
15 years 8 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
142
Voted
SRDS
2006
IEEE
16 years 21 days ago
2006
IEEE
In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks; worker processors are untrusted and m...
159
click to vote
INFOCOM
1990
IEEE
15 years 10 months ago
1990
IEEE
This paper analyzes the fault tolerance of a class of double-loop networks referred to as forwardloop backward-hop FLBH, in which each node is connected via unidirectional links t...
209
click to vote
NETWORKING
2007
15 years 8 months ago
2007
We re-examine the two reasons for the conservative 1-second Minimum TCP-RTO to protect against spurious timeouts: i) the OS clock granularity and ii) the Delayed ACKs. We find tha...
167
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...