Yes I can do that ! You need to modify the code where dijkstra is implemented. (route.cc)
Set the cost of the link to 1/BW and in addition to $ns run you have to write your own proc run to call the dijkstra like algorithm that calculate the bottleneck of the path and try to find the path where the bottleneck is max. Aurélien naveen gowda a écrit : > Can u help me regarding this pls > > On Wed, Apr 14, 2010 at 11:00 AM, naveen gowda > <naveengowd...@gmail.com <mailto:naveengowd...@gmail.com>> wrote: > > Its basically measuring capacity(bottleneck) bandwidth of targeted > path segments.. > > > On Tue, Apr 13, 2010 at 1:14 PM, Aurelien Lafranchise > <aurelien.lafranch...@ens-lyon.fr > <mailto:aurelien.lafranch...@ens-lyon.fr>> wrote: > > Hi, > > Is your problem related to the widest shotest path ? If yes I > can help you. > > Aurélien > > naveen gowda a écrit : > > Hi All, > > > > If any one worked or working with estimating bottleneck > bandwidth of path > > pls help me regarding this... I need tcl code of this.. > > > > Thankin you > > -- > > With regards > > Navi > > > > > > > -- > With regards > Navi > > > > > -- > With regards > Navi >
