Sciweavers

580 search results - page 91 / 116
» Choosing a random peer
Sort
View
SPAA
2005
ACM
15 years 5 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
WOSP
2005
ACM
15 years 5 months ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills
PKDD
2005
Springer
161views Data Mining» more  PKDD 2005»
15 years 5 months ago
Active Sampling for Knowledge Discovery from Biomedical Data
Abstract. We describe work aimed at cost-constrained knowledge discovery in the biomedical domain. To improve the diagnostic/prognostic models of cancer, new biomarkers are studied...
Sriharsha Veeramachaneni, Francesca Demichelis, Em...
DBISP2P
2004
Springer
70views Database» more  DBISP2P 2004»
15 years 5 months ago
Using Information Retrieval Techniques to Route Queries in an InfoBeacons Network
We present the InfoBeacons system, in which a peer-to-peer network of beacons cooperates to route queries to the best information sources. The routing in our system uses techniques...
Brian F. Cooper
ICPP
2003
IEEE
15 years 5 months ago
A Recovery Algorithm for Reliable Multicasting in Reliable Networks
Any reliable multicast protocol requires some recovery mechanism. A generic description of a recovery mechanism consists of a prioritized list of recovery servers/receivers (clien...
Danyang Zhang, Sibabrata Ray, Rajgopal Kannan, S. ...