SIROCCO
2003
13 years 5 months ago
2003
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...
SIROCCO
2003
13 years 5 months ago
2003
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...
SIROCCO
2003
13 years 5 months ago
2003
SIROCCO
2003
13 years 5 months ago
2003
SIROCCO
2003
13 years 5 months ago
2003
SIROCCO
2004
13 years 5 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
SIROCCO
2004
13 years 5 months ago
2004
SIROCCO
2004
13 years 5 months ago
2004
Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with ef...
SIROCCO
2004
13 years 5 months ago
2004
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a...
SIROCCO
2004
13 years 5 months ago
2004
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...