Raiciu, C; Huici, F; Handley, M; Rosenblum, DS; (2009) ROAR: Increasing the Flexibility and Performance of Distributed Search. In: Rodriguez, P, (ed.) SIGCOMM '09: Proceedings of the ACM SIGCOMM 2009 conference on Data communication. (pp. 291 - 302). Association for Computing Machinery: New York, US.
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 subquery. 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:||ACM SIGCOMM 2009 conference on Data communication|
|Dates:||16 Aug - 21 Aug 2009|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record