Sciweavers

SIROCCO
2003
13 years 12 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
SIROCCO
2003
13 years 12 months ago
The Cost of Concurrent, Low-Contention Read-Modify-Write
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
Costas Busch, Marios Mavronicolas, Paul G. Spiraki...
SIROCCO
2003
13 years 12 months ago
The Do-All Problem with Byzantine Processor Failures
Antonio Fernández, Chryssis Georgiou
SIROCCO
2003
13 years 12 months ago
Bounds for Frequency Estimation of Packet Streams
Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yih...