1259 search results - page 33 / 252 » On Survivable Access Network Design: Complexity and Algorith... |
119
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
135
click to vote
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
15 years 4 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
135
click to vote
SIGCOMM
2009
ACM
15 years 10 months ago
2009
ACM
Enterprise network security is typically reactive, and it relies heavily on host security and middleboxes. This approach creates complicated interactions between protocols and sys...
152
click to vote
SIGMETRICS
2008
ACM
15 years 4 months ago
2008
ACM
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
139
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...