This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: x (u) = 7 b. First consider what happens if c(x,y) changes. If c(x,y) becomes larger or smaller (as long as c(x,y) > 0), the least cost path from x to u will still have cost at least 7. Thus a change in c(x,y) will not cause x to inform its neighbors of any changes. Now consider if c(x,w) changes. If c(x,w) = 1, then the least-cost path to u continues to pass through w and its cost changes to 5 + ; x will inform its neighbors of this new cost. If c(x,w) = > 6, then the least cost path now passes through y and has cost 11; again x will inform its neighbors of this new cost. c. Any change in link cost c(x,y) will not cause x to inform its neighbors of a new minimum-cost path to u . Problem 29 a. eBGP b. iBGP c. eBGP d. iBGP...
View Full Document
This note was uploaded on 06/15/2009 for the course ECE 3076 taught by Professor Copeland during the Spring '08 term at Georgia Tech.
- Spring '08