MST algorithm for performance modeling of a tactical switching network
Wei Wu, M.A. Comeau · 2002
An algorithm for performance modeling of a tactical switching network operated under a diffusion routing technique is presented. This algorithm is derived based on the concept of a minimum cost spanning tree (MST) in graph theory. The MST algorithm can solve a network of 50 switches and 170 links within 15 min with a confidence interval higher than 85%. Thus, this MST algorithm provides a means for network performance modeling in a real-time application. The test platform of the algorithm was an Apollo computer with 2 Mps and 8 Mbytes cache memory.>