Problem

[Uma Subramanian <umasub@ee.lsu.edu>]

Hi,

I am a Master's student specialising in computer engg. I have a problem
regarding my thesis. 

Routing in networks takes place using the shortest path algorithm. Let us
consider a link which is congested (due to stuffing of packets). At this
instance it is better for the packets to take a longer route rather than
taking the shortest path. Thus the time taken for the packet to reach via
the longer route is going to be lesser than the time taken for that packet
to go thru the shorter path. Thus delay is lesser in this case only if
that particular link is congested.

How can I simulate such a situation? Above all, will it work?? One of my
friend suggested that I should write here and I would definitely receive
an answer. Is Network Simulator the only way that this situation can be
simulated? Is there an easy way to do this?

Awaiting ur replies. 

-Uma