Download now Free registration required
Search plays an important role in ubiquitous computing. In this paper, the authors investigate the expected cost and latency of three unstructured search schemes: broadcast, TTL-based, and random-walk-based search schemes. They build a unified analytical model for unstructured search schemes. They demonstrate, through simulation, that the different search schemes exhibit very different cost and latency trade-offs, leaving large gaps in the performance landscape. They propose randomized mixing schemes to bridge such performance gaps and bring out new Pareto frontier that offers more diverse performance choice for applications.
- Format: PDF
- Size: 296.6 KB