The distributed spanning tree: a scalable interconnection topology for efficient and equitable traversal

@article{Dahan2005TheDS,
  title={The distributed spanning tree: a scalable interconnection topology for efficient and equitable traversal},
  author={Sylvain Dahan and Jean-Marc Nicod and Laurent Philippe},
  journal={CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.},
  year={2005},
  volume={1},
  pages={243-250 Vol. 1}
}
Peer-to-peer and grid applications currently have few structures that allow efficient discovery mechanisms in large scale system. The trees can be an appropriate structure for this task. However, the tree's bottlenecks are a significant drawback in large scale architectures and connected graphs are used most of the time. In this paper, we propose an appropriate architecture named distributed spanning tree (DST) to allow discovery in large scale environment. This structure is organized into a… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

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

A distributed spanning tree simulator

  • S. Dahan
  • 2004
1 Excerpt

Incentives build robustness in bittorrent

  • B. Cohen
  • 2003
1 Excerpt

Scalable, distributed data structures for internet service construction

  • S. Gribble, E. Brewer, J. Hellerstein, D. Culler
  • In Symp. OSDI 2000,
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…