Hi everybody, There is some issue regarding the shortest path routing algorithm implementation in ns2. The problem is that if there exist more than one path, all of equal costs, between a source-destination node pair (i.e. multiple equal shortest paths), than the path choosen is the one with the minimum node id values (i.e. if n1,n2,n3,...are the next hop nodes to choose from, the one that is always choosen is n1 and similarly for the other next hops). But since the costs of all the paths are the same, any path should be choosen randomly... How can I do it ? Thanks! Piyush
