Thomas Kunz
Systems and Computer Engineering
8
Routing Table Calculation
nTake bandwidth into account:
ØMaximum spanning tree (in paper)
ØExtended Bellman-Ford (BF) shortest path
ØSame complexity, second algorithm guarantees that we find shortest route as well
nProof that algorithms indeed correctly find maximum bandwidth path
ØIf complete knowledge, proof by contradiction
ØCan show that TC messages have enough (i.e., the important) information
