Routing data packets in an effective way from source node to destination node is an important phase in the management of network. The efficiency of the routing depends on many factors such as service time, transmission time, waiting time, shortest and feasible path etc. An Optimal Routing Protocol along with M/M/1 queue is proposed in this paper, which combines the feature of shortest path and the waiting time of the packets, to choose the best path for the transmission. In Phase I, multiple possible paths from source to the destination are found out by implementing Breadth First Search Algorithm (BFS). Using BFS algorithm, all paths from source to destination are identified and cost for traversing each path is calculated. In Phase II, each link can be considered as M/M/1 queuing model and the total waiting time is calculated for every path. Total cost of the path is then, the Cost of the chosen path∗Total waiting time of the path. Path corresponding to the least total cost is considered for routing. In case of the link failure or congestion in the chosen path, next path with least total cost becomes the best path and considered for routing. © IAEME Publication.