A dynamic simplex routing algorithm of telecommunication network routing scheme

Guanhua Li · Journal of China Institute of Communications · 2004

This paper discusses how to solve dynamic routing problem with simplex algorithm in a long-distance telecommunication switch network. The computed results are shown in the paper. An effective global optimized routing scheme can be achieved in quick speed when using simplex algorithm.

Read the paper · More papers on PaperTik