Raiciu, C and Huici, F and Handley, M and Rosenblum, DS (2009) ROAR: Increasing the Flexibility and Performance of Distributed Search. In: COMPUTER COMMUNICATION REVIEW. (pp. 291 - 302). ASSOC COMPUTING MACHINERY
Full text not available from this repository.
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are added for each of these machines. The key parameter of these algorithms is the trade-off between replication and partitioning: increasing the partitioning level improves query completion time since more servers handle the query, but may incur non-negligible startup costs for each sub-query. Finding the right operating point and adapting to it can significantly improve performance and reduce costs.We introduce Rendezvous On a Ring (ROAR), a novel distributed algorithm that enables on-the-fly re-configuration of the partitioning level. ROAR can add and remove servers without stopping the system, cope with server failures, and provide good load-balancing even with a heterogeneous server pool. We demonstrate these claims using a privacy-preserving search application built upon ROAR.
|Title:||ROAR: Increasing the Flexibility and Performance of Distributed Search|
|Event:||SIGCOMM 2009 Conference|
|Dates:||2009-08-17 - 2009-08-21|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record