417 search results - page 15 / 84 » A randomized algorithm for the joining protocol in dynamic d... |
IPPS
2003
IEEE
14 years 25 days ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
GIS
2007
ACM
14 years 8 months ago
2007
ACM
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-...
ICPADS
2005
IEEE
14 years 1 months ago
2005
IEEE
- This paper proposes a new distributed QoS routing protocol, called Efficient Distributed QoS Routing (EDQR), for MPLS networks. The path searching algorithm of EDQR considers an ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
DC
2010
13 years 7 months ago
2010
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...