Jadavpur University 2010 M.E Software Engineering Network Technologies in - Question Paper
Jadavpur University
M.E in Software Engineering
1st Semester Examination, 2010
Subject: Network Technology Ex PC 'S'WE/T/115 A/ * 39/7011 Master of Engineering in Software Engineerin'-. Examination, 2011
( ?rd Semester )
NrTWORK TECHNOLOGIES
Tunc : Three hours Full Marks : 100
Answer question I and any five queetinm from the rort
I Chtxm iha cwtki atomaiiv* (10*2-20)
a. fn a network. a park* of length L bits takes Bafc LI w*h a probability ofp, or Hnk L2 with a probability of p, Unk LI and U haw Ml armr pmhaNMry of *, and 6, respectively Th* potability that (he packet will be received without error via efear LI L3ir
fy that (he nerket will he received without error via etti
L 0'bpPi *(1PifP) Ml [I-ty ]pft H (l*b/(hbfpf, hr KbfprWH
b la a pacta rwferhtng network, packets are muted frnm warra e deafeNSSo* along a angle pad) having two Intermediate node* If tfw maa *t la M byia* and aedl perkar eoWains a
header of J byle*. ttwn the optimum packet *Je Ir
L 4 bytes 11 fthyvaa IH 7byaee hr 9byflaa
c Let Of*) be the generator polynomial o*ed tor CRC checking. Whm m fee onadMee da dtoald be atisfWd by 0(x) K> delect odd number of bits In arrnr*
L 0(x) contains more than two farm*
(L 0(x)does not dMde I**1, fbr any k not e*ceedh**e freer laegfc ffi. t+x ba fbctor ofG(x)
Iv. 000 has an odd numSer o? trmn
d Frame* of 1000 bits w tent wn 10* mead trip
prpdartmrfcTSm* trainee are tobetnMB*aedletoftAifc*aSM*p* ftasaii Watt Whet lathe salrdtmaa atanber of bits required to fsyrwBataaqaaaeeawdhsrfyf L 2 H- 3 ffi.4 KS
j. A aetwork with CSMA/CD protocol ta the MAC layer b nonfat at I Gfcpe w I tm cable with ao repeated. The signal speed tn the cable te 2x10s nVsec. The aaMBn franw n fbr diii thfttld be
L 10000 bits a. 10000 bytes Ui 5000Mb fe.SOQObytea
*t For which one of the following reasons does Interact Protocol (IF) aaes the time-to-lm (TTL) Held ia the IP datagram header?
L Ensure packets reach destination with in that ttoe H. Discard packets that reach bear than that time 'fli. Prevent packets from looping indefinite fy Iv. Urak the time for whkh a packet gets queued ia insa mediate routers J. Two compute*! Cl and C3 are configured as fotlows: Cl has IP adAqj 209.197X53 and acoaask 255.255.121,0. C2 has IP addreu 203.197.75.201 and neonask 255755.1910 Whkh oae of the following statements is true?
I Cl aodC2boCh assume they are on the same network
IL C2 assumes Cl Is on tame network, but Cl assumes C2 it oo a different network
ft. Cl assume* C2 is on same network, botC2 assumes Cl is on a different network
hr. Cl and C2 both assume they are oo different network k. Pacfcats of dw tame tasiioo may be routed through different paths hi:
L TCP. but aot UDP m. TCP and LDP
H. UDf. bat MX TCP hr. Neither TCP nor UDP
,L Wldch efAe following Mamets Is hbe reprding a bridge
i. Bridya is s layer 2 device
H. Bridgs radaeas ooBUaa doaais M. BrW||aiieadioooaMattwoorawLANteciMOU w.
Trwa-route reports a poaribfr root* (har n oksa by paefcats moving front toot hod A to some other boat B Which of the foncmtf* optmm inaaauas (be technique used by trac*-roue to
dentify these reuiei?
i By progrttuK querying rower* abort the next rooter on the path to B usto* (CMP picket*. ann w*h the flm fww U. By nqirirtnj each route to append (he address lo the ICMP packet as k b fcrwanfctl to 11 Tlw N of ail rowlcn en-rwut to B n returned by B in aa ICMP rapty pack*
HI By emortng that 4w IC'MP reply packet la naarrwJ id A by cadi rooter on-routo to R. in the aaeendwig ordar of (hair hop dMaM ftwn A Jv By locally compiMing the horte pa* from A loR
(7*16>
a What ara the di*adtntfg aSconnettheifrts service*? In aptu of ihe dUarfvttati is why do you ttka lo use comecfionloM tanhcaa VIm aeitaw yom would tike to take 10 eliminate the problems, hut toll uae ewmecfinalees Miitew. b Lhtaoma ways hy which pnatalanrf tetephnne natwnrti differ C Docrlbe how parkrt ti/# affects tha jwfnnnenc* of a caayaar network.
<4*d)
a. Assuming that path h> correctly hnpfcmanM. 4m Hac*Wa repeat protocol perform much be Wat than tfMteckn on a fiber npitt Mr haewaaa two aodaa abool a hatf* mile aparT
b. Conskfct the go-hacli-n algorithm with a window tua e< 1 Draw seadar and rvcctar windows and abo deacribe tha action* of bo* aeadfag mi facarva* prosocok, *tctfymg the buffer content* in (he Ibflowwtg caer
Station A acuh frame* 04. Station B receivee chon ai a*4ar, fcaa ftw 4 wee daaMgad-t *wlI a iaa aaSaa fcfc 550 aieeaaiMte1 A afcftw
window protocol with 4 Wquwfce > : *- *-* ft I MB
MB. Find out the percentage of time the wmleria Mocked.
(5*5+*)
a. Ethernet frame* must be at least 64 byte* toot to nm feat nmmaa is sell go** in the event of collision at tha far eod of the cable. Faat Eta** ton* *e one M byte minimum frame size, cao get the bits oat ten time* taaar How to i poaadble id rti the same minimum frame size?
Prove that the maximum utilization of slotted ALOHA ocean at 0*1 mi (he lima throughput is 36.t%.
y A ring network runs at 1 Mbps and has a length of 1000 mten. Tlw ipeed of signal propagation b 2x10* m/sec. How much time a frame of 1000 bto wfll take to rcawd tha ring? Will the frame tfrivc back to the ttatioa before the station oornpleios fa transmission? What should tbo minimum sin of the ring so thaa taadtog edge of dw frame doe* not return back before the station completes its transmission?
(3+4+3-*)
a. Imagine two LAN bridge*, both contacting a pair of 102.4 nefworti The first bridge is teed with 1000 $12 byte (mam per second that must be forwarded. The second is teed with 200 4096 byte frames per tocood. WMcfc bridge do you think wiO need the teaar CPU? Dbcuas.
fc- DaecrBu the work log principle of transparent bridge. Compare between vanipareat hndpB and aource routing bridgc-
a la a TDM medium accaaa oonenH bus LAN, each station b asngned one time itot par e>to fcr unsmiaaiest Aaauma diet the length of each time slot fct the time lo transmit 100 Mis plat *e endtxad rrT*f*4n*> <Jel*y Aaaume a propagation speed of
2* Tfca Ingdi of the LAN is I km w*b a bandwidth of 10 Mbps. Find oat the
|
Computer A tends a packet lo computer B wfth port naming at port number 1000 In computer R Whai acfina \ maximum number of stations dial can be allowed to the LAN to that tte throughput of each station can be Mbpt (2+4+3*7) What are the two approaches lo packet switch mg? Distinguish between them a. b.
pitii emi F.th2 On which intrrfhee will the router forward packers 192.12.17.10 respective))? |
1000 There ts no proteu B will take0 121 75 43 16 and |
0+3+2+2+*)
Suppose that a datagram network has a routing algorithm t that fterc are two disjoint paths between every aourca aad the network. Identify the benefits of this approach. What this approach?
A boat m an organization has an IP address 150.3164-34 and a subnet mask 255-255.240.0. What is the address of this subnet? What a the rae of fP addrenes that a boat cm have on this subnet?
A mfrmuty has 150 LANs with 100 hosts in each LAN. Suppose the university has one ciaaa B address Design an appropriate subnet-addressing scheme. Draw the diagram of (ha network showing subnet mask, subnet ID. and IP afthrws
What problem does TCP Reno haw with multiple packet loaaee ftwn a wfcMfcxr? Otvm m example lo Illustrate.
Ca addition to having acknowledgement field in the TCP header. ACK bit is aho provided What would happen if the ACK bit were not provided?
Whai is the maximum data rate at which a host can send 1000 byte TCP payload if the prfa* lifetime 100 seconds without having sequence number wrap-around? Assume TCP header of 20 bytes and IP header of 20 bytes.
|
Attachment: |
| Earning: Approval pending. |
