658 search results - page 42 / 132 » Lower bounds for sorting networks |
INFOCOM
1990
IEEE
15 years 3 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...
113
click to vote
NETWORKING
2007
15 years 1 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...
SODA
2004
ACM
15 years 1 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...
CJ
2010
14 years 12 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
102
click to vote
ALGORITHMICA
2010
14 years 12 months ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...