Abstract: In this study authors are discussed the design and development of a new generalized algorithm to obtain optimal multi path routing for communication network. The selected network for the generalized algorithm is capable of handling network of any structure with any number of nodes. An algorithm is developed to obtain all possible paths from any source to any destination by considering cost of the link in the network. For the selected source and destination with in the network all multi optimal path will be shown on the screen in the text mode. From the listed paths the best any number of the path would be selected and the corresponding structure of the network with the optimal path will appear on the screen in the graphics mode. Link state algorithm is used to obtain the optimal path. The software developed is tested and dealt in this study with a typical example. In communication networks minimizing delays from entry to exit is a major concern of users. In user Optimal routing, each user chooses a path to minimize delay and without loss of the data from entry to exit. Analysis of network congestion using neural network queuing model is proposed. Performance measures of Queuing model are queue length, traffic intensity, total delay and non empty Queue of the data. Many networks especially data networks are commonly modeled as networks of Single Server queuing model. The network performance is analyzed using single server queuing model. Simulation is done with the parameters arrival and service time distribution of data using artificial neural network, Back Propagation Network (BPN) has been employed. The major focus of this work is to provide minimum delay, maximum traffic intensity without loss of the data and better network congestion control in communication network.