552 search results - page 14 / 111 » Routing complexity of faulty networks |
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
75
Voted
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
113
click to vote
SECPERU
2006
IEEE
15 years 3 months ago
2006
IEEE
Ad hoc routing protocols have been designed to efficiently reroute traffic when confronted with network congestion, faulty nodes, and dynamically changing topologies. The common d...
MOBIHOC
2010
ACM
14 years 7 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...