[Csci551-talk] Prioritization of routes
mike at wakerly.com
Mon Mar 22 13:48:17 PST 2004
Next-hop value. This would make the most sense, even if you just
consider the information Dijkstra's algorithm requires.
So if you had 2-<[3 or 4]>-5-6, all other things being equal, the
shortest path to 6 from 2 would not include 4.
On Mar 21, 2004, at 6:57 AM, amit pande wrote:
> for Prioritization of routes i have a doubt about what last-hop means:
> packets which are sent from 1 to 5 have next-hop as 2(the hop just
> source) and last-hop as 4(the hop just before destination).
> so for prioritization do we take the last-hop as defined above or
> which could be thought as last-hop from incoming packets point of
> destination is 1).while creating a routing table entry at 1 for 5.
More information about the Csci551-talk