Computer Network Assignment Process ESSAY

Computer Network Assignment Process

Computer Networks, HW 5

[Do not copy and paste answers from any source. Do not send your answers to anyone. For every question, include enough descriptions, explanations, and/or intermediate steps for your answers. Check our syllabus for all details on Academic Honesty expectations and Academic Dishonesty policies.]

1. True or false: When an OSPF router sends its link state information, it sends only to its direct neighbors. Explain.

2. True or false: When an RIP router sends its distance vector, it sends only to its direct neighbors. Explain.

3. This question is on the Dijkstra’s (Link State) algorithm. Show how the algorithm works by computing a table similar to Table 5.1 in the 7th edition of the textbook. (If you are using the 6th edition, that is Table 4.3). Use the word “infinity” (no letter capitalized), to indicate that the cost to some node is currently infinite. When a node is added to the N’ set, no more updates about the cost and predecessor should be done for this node; indicate this using two minus signs, i.e., “–“, in the table cells.

For example, if we have 4 nodes, w, x, y, and z, in a network as follows:

Consider the Dijkstra’s algorithm that is run at node z. The table will be like this:

Step

N’

D(x), p(x)

D(y), p(y)

D(w), p(w)

0

z

3, z

2, z

infinity

1

zy

3, z

—

4, y

2

zyx

—

—

4, y

3

zyxw

—

—

—

Consider the Dijkstra’s algorithm that is run at node y in the following network:

Complete the following table:

Step

N’

D(t), p(t)

D(u), p(u)

D(v), p(v)

D(w), p(w)

D(x), p(x)

D(z), p(z)

0

1

2

3

4

5

6

4. Consider the network shown below, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm.

a. What are the distances from y to all other nodes after y receives one message from each of its direct neighbors (assuming that these messages are the only messages that have been sent and received so far in the entire system)?

b. What are the distances from x to all other nodes after x receives one message from each of its neighbors (assuming that these messages are the only messages that have been sent and received so far in the entire system)?

5. Consider the network shown below. Suppose AS3 and AS2 are running RIP for their intra-AS routing protocol. Suppose AS1 and AS4 are running OSPF for their intra-AS routing protocol. Suppose eBGP and iBGP are used for the inter-AS routing protocol. Initially suppose there is no physical link between AS2 and AS4.

a. Router 4c learns about prefix x from which routing protocol: OSPF, RIP, eBGP, or iBGP?

b. Router 3b learns about x from which routing protocol?

c. Router 1a learns about x from which routing protocol?

d. Router 1c learns about x from which routing protocol?

6. Questions on ICMP.

a. What ICMP messages are used in the ping program? Please give the ICMP message type, code, and the description of the message.

b. What ICMP messages are used in the traceroute program on a unix-like operating system? Please give the ICMP message type, code and description of the message.

Computer Network Assignment Process ESSAY

Write my Essay. Premium essay writing services is the ideal place for homework help or essay writing service. if you are looking for affordable, high quality & non-plagiarized papers, click on the button below to place your order. Provide us with the instructions and one of our writers will deliver a unique, no plagiarism, and professional paper.

Get help with your toughest assignments and get them solved by a Reliable Custom Papers Writing Company. Save time, money and get quality papers. Buying an excellent plagiarism-free paper is a piece of cake!

All our papers are written from scratch. We can cover any assignment/essay in your field of study.