摘要
In this research paper, a routing problem of undirected networks has been solved. The problem was to determine the optimal routes of a telecommunication network. A heuristic approach has been adopted,due to the specific uature of the problem.The problem is only concerned withdistant(remote) nodes of the network which are indirectly linked through a single intermediate node.To determine the optimal routes,the devised heuristic has been coded in FORTRAN language. Forthe validation of developed heuristic,it has been implemented on two sample networks. Finally, ithas been applied to the actual(gived) network. The achieved results have proved its application insepcific networking problem. It can also enhance the effective utilization of available resources.
In this research paper, a routing problem of undirected networks has been solved. The problem was to determine the optimal routes of a telecommunication network. A heuristic approach has been adopted,due to the specific uature of the problem.The problem is only concerned withdistant(remote) nodes of the network which are indirectly linked through a single intermediate node.To determine the optimal routes,the devised heuristic has been coded in FORTRAN language. Forthe validation of developed heuristic,it has been implemented on two sample networks. Finally, ithas been applied to the actual(gived) network. The achieved results have proved its application insepcific networking problem. It can also enhance the effective utilization of available resources.
