Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance

@article{Fragopoulou1996EdgeDisjointST,
  title={Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance},
  author={Paraskevi Fragopoulou and Selim G. Akl},
  journal={IEEE Trans. Computers},
  year={1996},
  volume={45},
  pages={174-185}
}
Data communication and fault tolerance are important issues in multiprocessor systems. One way to achieve fault tolerant communication is by exploiting and e ectively utilizing the disjoint paths that exist between pairs of source, destination nodes. In this paper we construct a structure, called the multiple edgedisjoint spanning trees, on the star network, denoted by Sn. This is used for the derivation of an optimal single node broadcasting algorithm, which o ers a speed up of n 1 compared to… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

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

On the Properties of Breadth First Spanning Tree of the Star Graph

  • K. Qiu, S. G. Akl
  • Technical Report no. 93-350, Department of…
  • 1993
1 Excerpt

On the Tree Structure of the Star Graph

  • K. Qiu, P. Fragopoulou, S. G. Akl
  • Technical Report no. 93-349, Department of…
  • 1993
1 Excerpt

DecomposingHierarchical Cayley Graphs, with Applications to Information Dissemination and Algorithm Design

  • P. Berthom e, A. Ferreira, S. Perennes
  • Technical Report no
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…