Homework5

Homework5 - D(C),p(C) D(D),p(D) D(E),p(E) D(G),p(G)...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Kevin Deggelman 803 463 734 CS 118 Homework 5 1. a) Prefix Match Link Interface 11100000 0 11100001 00000000 1 11100001 2 otherwise 3 b) Prefix match for first address is 4 th entry -> link interface 3 Prefix match for second address is 2 nd entry -> link interface 1 Prefix match for first address is 3 rd entry -> link interface 2 2. Subnet 1 - 223.1.17.0/25, (32 – 25 = 7 bits, can support upto 27 = 128 hosts) Subnet 2 – 223.1.17.128/25, (same as above) Subnet 3 – 223.1.17.192/26, (32 -26 = 6 bits, can support upto 26 = 64 hosts) 3. Step N’ D(A),p(A) D(B),p(B)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: D(C),p(C) D(D),p(D) D(E),p(E) D(G),p(G) D(H),p(H) 3,F 1,F 6,F 1 E 4,E 2,E 6,F 2 ED 11,D 3,D 3,D 3 EDC 7,C 5,C 3,D 4 EDCG 7,C 5,C 17,G 5 EDCGB 6,B 7,B 6 EDCGBA 7,B 4. a) Dx(y) = 4, Dx(w) = 1, Dx(u) = 6 b) Any change in the link-cost between X and W will cause X to notify its neighbors of a new minimum cost path to u. c) There is no change in c(X,Y) that can make the cost from X to u through Y become less than the existing minimum cost path through W...
View Full Document

This note was uploaded on 04/28/2010 for the course CS 118 taught by Professor Chu during the Spring '08 term at UCLA.

Ask a homework question - tutors are online