!"#$% '($( )*)+)*,-,.

/+
01
Autonomous system numbeis aie associateu with oiganizations like foi e.g.
AS2u162-0niveisity of Texas at Ballas,0S
}ust by knowing this, ioutei cannot ieach it via outsiue souices, it will neeu the netwoik numbeis
associateu with the AS. Also, ip uoes not have any fielu foi AS numbeis. So both have to be stoieu by coie
netwoik iouteis


21 Foi non-BuP speakeis to ieach Inteinet, Boiuei BuP speakeis inject a uefault path of uesiieu
uestination. Also, foi outsiue AS netwoik to ieach non-BuP speakeis, they inject a link of outsiue Inteinet
so non-BuP speakeis can ieach them via intiauomain iouting. As AS giow biggei, lots of uefault paths to
be injecteu which is not feasible. So, if all iouteis speak BuP , they can communicate efficiently via EBuP.

31
i) AS have to ueciue paths baseu on commeicial inteiests, also tiust between itself anu the
neighboiing AS. By consiueiing the entiie path AS can make this uecision.
ii) Entiie path also incluues the AS wheie it came fiom. This infoimation is useu to avoiu loops

41
If theie is no bioaucast mechanism of Etheinet, then hosts that aie just up i.e. without a IP (which is
geneially given by BBCP fiom a pool of IP auuiesses) will nevei be able to connect to the inteinet. All
the IP auuiesses will have to be statically assigneu to all hosts, which can be a teuious task, anu
management of IP is also teuious.
Also, in multicast, it woulu be an issue in BvNRP wheie ieceivei is associateu with a LAN anu ,
leaining the path woulu be impossible without bioaucast in a LAN.
Also iequiieu by biiuges while leaining the table of hosts.
ARP also iequiies this foi auuiess tianslation

/.5 Bynamic auuiess iesolution (ARP)
01
i. !"#$% %" !"#$%' 6789 since they can senu message to the othei point via the link as a ARP
bioaucast (which will only be unicast in this case since only one othei point), anu leain its
physical auuiess
ii. (#)*# +,-./001' 6789 it is possible. Since a host can senu a ARP REQ0EST packet to the Access
Point (AP) with ieceiveis IP auuiess. AP can bioaucast this to all noues anu ielevant noue
iesponus with ARP REPLY containing its physical auuiess.
iii. 2" 34"56758% 89::"4%' :"9 since only bioaucast mechanism helps leveiage IP bioaucast
auuiess, which allows the ARP packet to ieach the appiopiiate ieceivei via the "physical
meuium"
21
By ieauing the "type" oi ;<(7=>?@7 in the Etheinet fiame of 2 bytes. If it is
*A*B**-Inteinet Piotocol veision 4 (IPv4) anu if *A*B*,-Auuiess Resolution Piotocol (ARP)






/C

01 Biiuges uo not know fiom befoie, on which inteiface a gioup membei lies, they leain this when a
membeiship iepoit is sent to them. Since any ieceivei in a gioup can multicast a message to the othei
gioup membeis, it is necessaiy foi all the biiuges in the extenueu lan to leain the uiiection foi each
ieceivei. If the membeiship iepoit is not flooueu, othei biiuges (i.e. othei than the one ieceivei is
connecteu to) will not leain of that ieceivei.

21
Yes it can be possible. Biiuge table pioviues which host on which poit. 0sing this we can cieate a next
hop vectoi fiom each noue to all othei noues, like fiom noue u to souice, it goes thiough B2, BS, B7
wheie B is foi Biiuges.

Then we can floou each Biiuge by using TRPB, with bioaucast tiee initiateu fiom souice biiuge( heie
paiticulaily, the TRPB piopeity of iouteis on the same LAN is useful in ueciuing the paient . It is ueciueu
on basis of low cost oi low IP)

Then, we can eliminate the leaf noues wheie theie aie no ieceiveis oi path uepenuent biiuges.
We can then piune the non-membeieu LANS by issuing NNRs by the biiuges. Beie Biiuge table will also
have to incluue NNR on which poit anu iemembei the NNR iepoits

/)1
01 Class B IP auuiesses aie to be assigneu, neeu (2S6-2) X8 =2uS2 (-2 since 2 auuiesses in each block
ieseiveu). Since class B, 16 bits foi netwoik giving S2,768 hosts, but we iequiie just 2uS2. So D"=="E ,
("8< DF<8 G"= #7<E"=% anu uiviue the 8 blocks in 2 blocks of 4 each with a subnet numbeis foi each. This
is uone uepenuing on bits that aie not changing.

196 11uu u1uu
197 11uu u1u1
198 11uu u11u
199 11uu u111

Foi 196 to 199 only last 2 bits aie changing, so a H$8% "G )II5)II5)I)5* anu 8JD#7< #"5 "G
+K-5+-5+C,5* will be the sufficient entiy in the ISP table.

2uu 11uu 1uuu
2u1 11uu 1uu1
2u2 11uu 1u1u
2uS 11uu 1u11
Foi 2uu to 2uS only last 2 bits aie changing, so a mask of )II5)II5)I)5* anu 8JD#7< #"5 "G
+K-5+-5)**5* will be the entiy in the table.
21 Foi iouteis outsiue the ISP, +K-5+-5*5*L +K-5+-5AAAAAAAA5AAAAAAAAA1 is the best possible piefix to
finu 147.17.196.u anu 147.17.2uu.u .
31 CIBR netwoik piefix woulu be +C-5+-5+C)5*M)* foi ioutei outsiue ISP (197.17.11uuXXXX.xxxxxxxx)







/+*1
F1
Foi ieceivei on LAN E, uata can be ieceiveu fiom RS>RS>R6 oi R1>R2>R4, each S hops away.
Tie is bioken on LAN E by IP auuiess, with IP (R6)<IP (R4). Since IP(C)<IP (u).

LAN Paient wit souice S
F
B
u
B
C
E
A
B
Souice
R1
R2
RS
RS
R6
R7
R7


ii) LAN A is tiuncateu, being a leaf LAN
Reason foi A: Boes not have a ioutei, which uses it foi multicast anu uoesn't have any membei hosts
iii)NNR ient fiom R7>RS, RS>RS anu R9>R7
iv) LAN E,F,u,B will be useu foi multicast















/K


a)
Steps to ueciue the path
1. Take paths with highest local piefeience, so path via R>0>B is eliminateu (minimum LP of S)
2. Counting AS hops, Q>T>B neeus 2 AS hops anu P>B anu S>B neeu one hop each, so eliminate Q>T>B.
S. Path P>B has multiple paths foi A , so choose the one with lowest NEB value i.e. NEB=6 ( the left of the
2 paths)

Bence, x will choose x>P(m=6) > B, anu z will choose z>S>B as cost foi each to ieach itself via intia
uomain iouting is zeio.
y will choose x to ieach B via x's path to B since intia-uomain cost of y to ieach x (2 hops) is less than that
to ieach z (S hops).

x will inject as uefault path, IP auuiess of lowei boiuei BuP speakei of P at link NEB=6
y will inject as uefault path, IP auuiess of lowei boiuei BuP speakei of S.


b)
As mentioneu above , each x, y boiuei iouteis will inject links as uefault paths in intiauomain piotocol
(can be 0SPF oi RIP) . f will use the intiauomain iouting to ieach boiuei iouteis by finuing the least cost
which is via x (only 1 hop) which fuithei takes it to P anu then B.










/B1


Poit numbeis oi inteiface numbeis aie mentioneu aujacent to each biiuge.
Biiuges use biiuge table with just "NAC auui, Inteiface " to foiwaiu packets.
If entiy of souice NAC auuiess not in the table, biiuge auus it to the table anu foiwaius to the uestination
NAC inteiface, if piesent in the table, else puts on all inteifaces.

i) ARP iequest is sent which contains souice mac X anu uest as u,u,u,u (which is not piesent in
table), souice ip:x anu ues ip:y. Since biiuges uo not have x entiy in the table, that entiy is
auueu anu put on all its inteifaces
0puateu Biiue tables

Biiuge Entiy
B X,bS
A X,a1
B X,u2
C X,c2
E X,e1
F X,fS

ii) Y senus ARP ieply souice NAC:Y, Best NAC:X, sic ip: y, ues ip:x . Appiopiiate Biiuge , which
know uest NAC : X, will put on X inteiface anu will ieau souice NAC Y anu auu into table.

0puateu Biiue tables

Biiuge Entiy
C X,c2
Y,c1
B X,u2
Y,u1
E X, e1
Y,e1
F X, fS
B X, bS
Y,b1
A X, a1
Y,a2

iii) ARP iequest of z contains souice mac Z anu uest as u,u,u,u (which is not piesent in table),
souice ip:z anu ues ip:x. Since uest. u,u,u,u is not known, all biiuges will put on all its inteifaces,
ARP iequest of z. Also, NAC Z is auueu on all biiuges
0puateu Biiue tables
Biiuge Entiy
C X,c2
Y,c1
Z,c2
B X,u2
Y,u1
Z,u2
E X, e1
Y,e1
Z,eS
F X, fS
Z,f2
B X, bS
Y,b1
Z,b1
A X, a1
Y,a2
Z,a1

/J78<F"# -N OF7=$=P(FP$Q 2RS
i)
Autonomous
System
AS it can ieach
a P9 T9 7 ( a being pioviuei can expoit ioutes of its
customei c, which in tuin is a pioviuei foi u ,e , so those
can also be ieachable by a. a cannot ieach b via c as b is
also a pioviuei foi c. customeis uo not pioviue tiansit
seivices to pioviueis, peeis)
b P9 T9 7
c $9D9T97
u C,a,b
E C,a,b




ii)
Autonomous
System
AS it can ieach
A C,e,b,u
B C,u,e,a
C A,b,u,e
B C,e,a,b
E A,b,c,u

iii)

Autonomous
System
AS it can ieach
A C,b,u
B A,c,e,u
C A,b,e,u
B C,a,b,e
E B,c,b

iv)

Autonomous
System
AS it can ieach
A B(peei), c(via peei to customei), u,e (b-c-e is customei
only path)
B A,c,e
C B,a,e,u
B A,c,e
E C,u,b,a