Note:  You have plenty of time.  Think hard about this stuff. Feel free
to explain yourself fully.  Some of these questions are better answered
by a paragraph than a sentence.

Don't just give a single word answer.  Say why your answer is correct.  For
example, don't say "Ford".  Say "Ford because it has an explicit cost measure"
or some such thing.
<ol>

<li> Which of the routing algorithms (BGP, Ford, Djikstra, Flooding) uses
a time-to-live field to prevent infinite routing loops?

<li> Which of the algorithms above gives the router the most complete picture 
of the topology of the internet?

<li> Which of the algorithms does your laptop use to do it's routing?

<li> Under what situations will BGP have the 'count to infinity' problem?

<li> Suppose a router were to send out bad information.  Of the protocols BGP, 
Ford, and Djikstra, which is most tolorant of this error?

<li> There exists a topology involving more than two routers where flooding
is the most effecient algorithm in terms of total bandwidth used compared to
data delivered.  Draw a map showing such a topology.

<li> Suppose I'm using the Ford algorithm and everything is working fine.
I'm sending packets and the packets are being received.  Then a link goes
down.  How long after the link goes down before all the routers have 
made the needed adjustments?

<li> Which fields of an IP header are generally used to make routing decisions?
Which other fields might be reasonably useful?

<li> Assuming no errors, which of BGP, Ford, Djikstra, and Flooding is 
guarenteed to use the route with the minimum cost or latency?

<li> Which part of routing is the most confusing to you?
</ol>

This is due Wednesday Oct 15th at 11:05am.  There is no extension.  Mail the answers to rappleto@nmu.edu.