$2.$ Draw an edge$-$weighted graph with $7$ nodes to be used as a model, in routing calculations for an

internet.

a$.$ Show the initial distance vectors at three different nodes, at the start of their execution of the

Distance Vector Routing algorithm.

b$.$ Show the updates of distance vectors at three different nodes, after each of the three nodes

receives three distance vectors, from other nodes.

c$.$ Show the initial shared Link State Database created at the nodes, at the start of the execution

of the Link State Routing Algorithm, at each node.

d$.$ Show the next three link state packets that will be created and sent out by $3$ chosen nodes.

Show the corresponding Link State Database updates that results. Then, show the construction

of least cost trees that occurs at two nodes, using Dijkstra Algorithm.

$3.$ Do the following problems.

a$)$ Using Sequence Charts, explain the concepts of connection establishment and connection termination

Include an explanation for the difference between $2-$way and $3-$way handshakes.

b$)$ Highlight the main features and characteristics, then compare and contrast Link State Routing and

Distance Vector Routing algorithms

c$)$ Use Sequence Charts and Finite State Machine $($FSM$)$ diagrams to provide an understanding of the

various schemes of error control and flow control at the Transport layer. Include details of the handling

packet errors, packet losses. packet discarding, duplicate packets, out of order packets in the Stop$-$andWait, Go$-$Back$-$N and Selective Repeat schemes.

d$)$ Provide an understanding of the routing protocols that are actually used in the real world, including

RIP, OSPF and BGP$4.$

e$)$ Provide an understanding of congestion control schemes that are actually used or proposed to be

used in the TCP protocol for the Internet.

$5.$ Create Your Problems.

On concepts used for developing, operating and understanding of Transport Layer $($IP$)$ protocols.