SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 304 Weeks Ago, 1 Day Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 30 Nov 2017 My Price 10.00

distance vector routing algorithm (the cost may be asymmetric)

The following table is used in distance vector routing algorithm (the cost may be asymmetric). Node 1’s routing table before update is

 

Screen Shot 2017-05-29 at 3.30.26 PM.png

 

(a) Node 1 has three neighbors N2, N3, and N4. After a moment, N1 receives the following:

                             N2 tells N1 that its cost to N6 has been changed to 7.

                             N3 tells N1 that its cost to N6 has been changed to 3.

                             N4 tells N1 that its cost to N6 has been changed to 9.

Based on these results, N1 updates its routing table. After running one round of the algorithm, in the new table, what will be the cost from N1 to N6? Which node should be the next node in order to achieve the new cost?

 

 

(b) Suppose N4 also tells N1 its cost to N3 is 2. Will this change the result of question (1) in the next round of the algorithm?

 

 

(c) With this information, when the algorithm terminates, for N1, what will be the cost from N1 to N6? Which node should be the next node in order to achieve the new cost?

Attachments:

Answers

(5)
Status NEW Posted 30 Nov 2017 11:11 AM My Price 10.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)