13214 search results - page 116 / 2643 » Pseudorandomness for network algorithms |
186
click to vote
PDCAT
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
183
click to vote
WINET
2010
15 years 4 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
180
click to vote
EUROPAR
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the ...
183
click to vote
ICC
2000
IEEE
15 years 10 months ago
2000
IEEE
The logical configuration of a WDM network can be changed by reassigning wavelengths to tunable transceivers of nodes. In this paper, we develop reconfiguration algorithms to obtai...
168
click to vote
INFOCOM
1995
IEEE
15 years 10 months ago
1995
IEEE
In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the rout...