RASTER: a light-weight routing protocol to discover shortest overlay routes in randomized DHT systems

@article{Wang2006RASTERAL,
  title={RASTER: a light-weight routing protocol to discover shortest overlay routes in randomized DHT systems},
  author={Chih-Chiang Wang and Khaled Harfoush},
  journal={12th International Conference on Parallel and Distributed Systems - (ICPADS'06)},
  year={2006},
  volume={1},
  pages={8 pp.-}
}
In this paper, we propose a novel routing protocol, RASTER, that approximates shortest overlay routes between nodes in randomized DHTs. Unlike previously proposed routing protocols, RASTER encodes and aggregates routing information. Its simple bitmap-encoding scheme together with the proposed RASTER routing algorithm enable a performance edge over current overlay routing protocols. RASTER provides a forwarding overhead of merely a small constant number of bitwise operations, a routing… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
5 Extracted Citations
15 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 15 references

Know thy neighbor’s neighbor: the power of lookahead in randomized p2p networks

  • G. S. Manku, M. Naor, U. Wieder
  • In Proceedings of 4th USENIX Symposium on…
  • 2003

Similar Papers

Loading similar papers…