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
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
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
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
