Hi everybody, The default routing algorithm implemented in ns2 is the shortest path routing (Dijkstra's Algorithm). The problem is that if there exists multiple paths having same number of hops between a source-destination node pair, which of the multiple paths is choosen, as each one is the shortest path. Is a path choosen randomly or is there any tie -breaker for this ? Which c++ code file should I look into ? Thanks! Piyush
