Challenge!

taotaolang · ‎07-13-2009

The topology is in attachment.

All routers run both RIPv2 and OSPF.

Attempt this exercise based on what you know about OSPF, Dijkstra's

algorithm, and the distance command. Using only the distance command,

write out the commands necessary to confuse the routers in this topology so

that packets destined for 172.16.3.1 would continually bounce between R1 to

R2?

andrew.prince · ‎07-13-2009

Why?

Leo Laohoo · ‎07-13-2009

Is this a "challenge" for you or a challenge for us.

If this is a challenge for us, I agree with Andrew's succinct comment.

taotaolang · ‎07-13-2009

of course,the "challenge" for me,SOS.

scottmac · ‎07-13-2009

OP: Perhaps you should have titled the post more honestly: "Homework!!!"

or

"Oh please please please help me figure out this stuff that I slept through in class" ...

;-{

taotaolang · ‎07-13-2009

sorry,This 'challenge' just for me ,I'm a self-learner,SOS!

wandering_997 · ‎07-13-2009

do you mean both of r1 and r2 should have route loop destinated to 172.16.3.1 ?

taotaolang · ‎07-13-2009

yes, using only distance command to implement.