{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Homework3Answers - 5 0 2 C 6 5 0 2 Node B Table A B C D A B...

This preview shows pages 1–2. Sign up to view the full content.

CNT 4704 (Fall 2010) Homework 3 Solution 1. ( 20 points) a). Prefix Match Link Interface 11100000 00 0 11100000 01000000 1 1110000 2 11100001 1 3 otherwise 3 b) 11001000 10010001 01010001 01010101 Prefix match for first address is 5 th entry: link interface 3 11100001 01000000 11000011 00111100 Prefix match for second address is 3 nd entry: link interface 2 11100001 10000000 00010001 01110111 Prefix match for third address is 4 th entry: link interface 3 2. ( 15 points) 223.1.17.0/26 223.1.17.64/25 223.1.17.192/28 3. ( 25 points) Step N’ D(t),p(t) D(u),p(u) D(v),p(v) D(w),p(w) D(y),p(y) D(z),p(z) 0 x 3,x 6,x 6,x 8,x 1 xv 7,v 6,v 3,x 6,x 6,x 8,x 2 xvu 7,v 6,v 3,x 6,x 6,x 8,x 3 xvuw 7,v 6,v 3,x 6,x 6,x 8,x 4 xvuwy 7,v 6,v 3,x 6,x 6,x 8,x 5 xvuwyt 7,v 6,v 3,x 6,x 6,x 8,x 6 xvuwytz 7,v 6,v 3,x 6,x 6,x 8,x

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4. (25 points) Round 1 Round 2 Round 3 Node A Table A B C D A B C D A B C D A 0 1 7 00 A 0 1 6 4 A 0 1 6 4 B 00 00 00 00 B 1 0 5 3 B 1 0 5 3 C 00 00 00 00 C 7
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 5 0 2 C 6 5 0 2 Node B Table A B C D A B C D A B C D A 00 00 00 00 A 0 1 7 00 A 0 1 6 4 B 1 0 5 3 B 1 0 5 3 B 1 0 5 3 C 00 00 00 00 C 7 5 0 2 C 6 5 0 2 D 00 00 00 00 D 00 3 2 0 D 4 3 2 0 Node C Table A B C D A B C D A B C D A 00 00 00 00 A 0 1 7 00 A 0 1 6 4 B 00 00 00 00 B 1 0 5 3 B 1 0 5 3 C 7 5 0 2 C 6 5 0 2 C 6 5 0 2 D 00 00 00 00 D 00 3 2 0 D 4 3 2 0 Node D Table A B C D A B C D A B C D B 00 00 00 00 B 1 0 5 3 B 1 0 5 3 C 00 00 00 00 C 7 5 0 2 C 6 5 0 2 D 00 3 2 D 4 3 2 D 4 3 2 0 “00” represents “infinity”. Node B only broadcasts its distance vector once; the other three nodes broadcast their distance vectors twice. 5. (15 points) The three major routing protocols used in the Internet are: RIP, OSPF, and BGP. RIP: Routing Information Protocol OSPF: Open Shortest Path First protocol BGP: Border Gateway Protocol OSPF is mainly based on link state algorithm, RIP and BGP are mainly based on distance vector algorithm....
View Full Document

• Fall '08
• Guha,R
• routing protocol, Open Shortest Path First, Routing Information Protocol, 223.1.17.0, 223.1.17.192, 223.1.17.64

{[ snackBarMessage ]}

### Page1 / 2

Homework3Answers - 5 0 2 C 6 5 0 2 Node B Table A B C D A B...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online