Exercise 5 (19th February 2002)

NOTE! The English Exercise Group in on Tuesdays 12-14 in C476. Your instructor will be Krishnan Narayanan.

1. Answer shortly the following questions. The answers are usually almost directly found from the course book or from the lectures.
   1. What differences there are between distance vector routing and link state routing?
   2. How does a router function? How can it forward packets to their right direction? Can a router loose packets? In which situations?
   3. Why, in your opinion, does IP protocol count the checksum over the header only and not include the data part?
   4. What is the count-to-infinity problem and what solution has been proposed to solve it?
   5. The header field for IP address is 32 bits long and with that one can have over 4 miljard IP addresses. In spite of that there has been worries about IP addresses running out. Why?

2. Dijkstra's shortest path algorithm in routing

   1. Find using Dijkstra's algorithm the shortest (lowest cost) routes from node A to all other nodes in the network below.

                                  3
                          B . . . . . . .F
                        .  .            .  . 
                     .      .          .    .
                3  .       1 .      4 .      . 2
                 .            .      .        .
                .     3        .   .     3     .
      network  A . . . . . . .  D . . . . . . . .E
                 .             .  .             .
                  .           .    .           .
                   .         . 2    . 2       .
                 2  .       .        .       .  1
                     .     .          .     .
                      .   .            .  .
                       C . . . . . . .  G
       
                                2

   2. Give, based on the routes found, the routing table for node A. In the routing table there is, for each node the outlink to be used and the cost of the route. The outlinks are numbered so that the link from A to be is number 1, from A to D number 2 and from A to C number 3.

3. For routing the distance vector algorithm is used. Supposing each node in the network below, first knows only the distances to its neighbors. What is the content of routing table of the node E after the node E has changed routing information with its neighbors?

                 1
        A --------------- B
        |               / |
        |              /  |
        |           5 /   |
        |            /    | 
        |           /     |
        |2         /      |15
        |        E        |
        |      /   \      |
        |     /     \     |
        |    /       \    |
        |   / 2    10 \   |
        |  /           \  |
        | /             \ |
        C --------------- D
                1
    

4. Flooding
   1. Suppose that, in the network of the previous problem, the node A sends a packet using flooding. Presume also that for a packet to cross a link it takes one time unit for each link and the sending and receiving of packets does not consume any time. How does the sending of packets continue? How many packets in total has been sent after four time units?
   2. What different ways there are to stop the continuous and increasing sending of packets in flooding?
   3. In which kind of situations is flooding useful?

5. The network layer of host A gets from its transport layer 3000 bytes of data to be sent to the host B. A and B are situated in different networks that are connected by one router. A's LAN can carry at most 1500 bytes of data in one packet and the maximum size of data in B's LAN is only 1000 bytes. Suppose that the next sequence number for A's IP packet is 100.

           A - XXXXXXXXX  -  router  -  XXXXXXXXXXXX - B
   
                LAN  a                     LAN b 
         max. 1500 bytes data        max. 1000 bytes  data

   What kind of IP packets does A send? What does the router do to these packets? What kind of IP packets does B receive? Give the contents of the IP header fields involved in fragmentation in the sent and received IP packets.

6. In the SMTP connection the first message sent is the HELO message.

   1. What kind of TCP segment carries the HELO message in the TCP connection? What information is included in the header fields of this TCP segment? What TCP segments have already been sent before this TCP segment carrying the HELO message?

   2. How are these TCP segments transferred in IP packets? What information do the header fields of these IP packets contain?