Computer Networks (CS610)

Assignment#03(GRADED)

BC140200360

Muhammad Nazir Qureshi

Total marks = 20

Deadline Date =14-January-2016

Please carefully read the following instructions before attempting the assignment.

Assignment Guidelines:

It should be clear that your assignment would not get any credit if:

§  The assignment is submitted after due date.

§  The submitted assignment does not open or file is corrupt.

§  The assignment is copied. Note that strict action would be taken if the submitted assignment is copied from any other student. Both students will be punished severely.

1)  You should consult recommended books to clarify your concepts as handouts are not sufficient.

2)  You are supposed to submit your assignment in .doc or docx format. Any other formats like scan images, PDF, Zip, rar, bmp etc will not be accepted.

3)  You are advised to upload your assignment at least two days before due date.

Important Note:

Assignment comprises of 20 Marks. Note that no assignment will be accepted after due date via email in any case (whether it is the case of load shedding or emergency electric failure or internet malfunctioning etc.). Hence, refrain from uploading assignment in the last hour of the deadline, and try to upload Solutions at least 02 days before the deadline to avoid inconvenience later on.

For any query please contact:

The objective of this assignment is:

·  To understand building graph of routing table.

Scenario: Suppose we had a network in which routers are connected in the following fashion as shown in figure 1.

Figure 1.

Task: you are required to build a routing table, showing destination and next hope address.

Note: An example is given in chapter 16 on page 60 on handouts.

Answer:

Step 1:

Destination / Next Hope / Nodes
A / --,(A,B) ,(A,B) ,(A,B) ,(A,B,C) or (A,B,D) / Nodes A
B / (B,A),--,(B,C),(B,D),(B,C) or (B,D) / Nodes B
C / (C,B), (C,B),--, (C,B) or (C,E),(C,E) / Nodes C
D / (D,B), (D,B), (D,B) or (D,E),--, (D,E) / Nodes D
E / (E,C,B) or (E,D,B), (E,D) or (E,C), (E,C), (E,D),-- / Nodes E

Step 2:

Destination / Next Hope
A / --
B / (A,B)
C / (A,B)
D / (A,B)
E / (A,B,C) or (A,B,D)
For Nod “A”
Destination / Next Hope
A / (B,A)
B / --
C / (B,C)
D / (B,D)
E / (B,C) or (B,D)
For Nod “B”
Destination / Next Hope
A / (C,B)
B / (C,B)
C / --
D / (C,B) or (C,E)
E / (C,E)
For Nod “C”
Destination / Next Hope
A / (D,B)
B / (D,B)
C / (D,B) or (D,E)
D / --
E / (D,E)
For Nod “D”
Destination / Next Hope
A / (E,C,B) or (E,D,B)
B / (E,D) or (E,C)
C / (E,C)
D / (E,D)
E / --
For Nod “E”