Distributed k-ary System: Algorithms for Distributed Hash Tables

@inproceedings{Ghodsi2006DistributedKS,
  title={Distributed k-ary System: Algorithms for Distributed Hash Tables},
  author={Ali Ghodsi},
  year={2006}
}
T his dissertation presents algorithms for data structures called distributed hash tables (DHT) or structured overlay networks, which are used to build scalable self-managing distributed systems. The provided algorithms guarantee lookup consistency in the presence of dynamism: they guarantee consistent lookup results in the presence of nodes joining and leaving. Similarly, the algorithms guarantee that routing never fails while nodes join and leave. Previous algorithms for lookup consistency… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 77 CITATIONS, ESTIMATED 22% COVERAGE

77 Citations

051015'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 77 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 133 REFERENCES

MyriadStore

  • B. Stefansson, A. Thodis, A. Ghodsi, S. Haridi
  • Technical Report TR--09, Swedish Institute of…
  • 2006
Highly Influential
30 Excerpts

Similar Papers

Loading similar papers…