A fast algorithm for computing minimum routing cost spanning trees

@article{Campos2008AFA,
  title={A fast algorithm for computing minimum routing cost spanning trees},
  author={Rui Campos and Manuel Ricardo},
  journal={Computer Networks},
  year={2008},
  volume={52},
  pages={3229-3247}
}
Communication networks have been developed based on two networking approaches: bridging and routing. The convergence to an all-Ethernet paradigm in Personal and Local Area Networks and the increasing heterogeneity found in these networks emphasizes the current and future applicability of bridging. When bridging is used, a single active spanning tree needs to be defined. A Minimum Routing Cost Tree is known to be the optimal spanning tree if the probability of communication between any pair of… CONTINUE READING