Beruflich Dokumente
Kultur Dokumente
3. List four properties by hich transmission media can differ. %'5 /90 (+#+& !# %*&
). "hree packet sitching netorks each contain n nodes. "he netorks has a star topology ith central
sitch$ a ring respectively and third is fully interconnected ith a ire form every node to othernode.
8hat are the best$ average and orst case transmission paths in hopsG
%'5/90 (+#+&!# %#(&
=. Explain about coaxial cable and fiber optics media for communication. %'5/90 (+#+&!# %*&
1oaxial cable %)&
;iber optics cable %)&
%i& Explain about transmission modes available for data flo. %'5 /90 (+#+& !# %)&
%ii& Explain the categories of netorks. %'5 /90 (+#+& !# %)&
>. 0escribe the circuit sitched netorks$ data gram netorks and cable netorks ith suitable diagrams.
%'5 /90 (+##& !# %#>&
1ircuit sitched netorks %)&
0ata gram netorks %)&
1able netorks %)&
0iagram %)&
?. Explain types of sitching netorks and mention its advantages and disadvantages.
%'5 /90 (+#(& !# %#>&
1ircuit sitched netorks %)&
0ata gram netorks %)&
1able netorks %)&
'dvantages and 0isadvantages %)&
*. 8rite a short note on various types of transmission media$ highlighting their merits and demerits.
%'5 /'. (+#+& !# %*&
Juided .edia %)&
5nguided .edia %)&
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
H. Briefly explain the different types of packet sitching techni,ues ith suitable netorks. 8rite each of
its advantages and disadvantages. %'5 /'. (+##& !# %#>&
4irtual 1ircuit 2acket 6itching ith advantages K 0isadvantages %*&
0atagram 2acket 6itching ith advantages K 0isadvantages %*&
#+. Explain the "12/I2 reference model ith a neat sketch. %'5/I. (+#3& !# %*&
0iagram %)&
Explanation %)&
##. 1ompare the performance of "12/I2 and I6O/O6I reference model %'5/I.(+#3& !# %*&
#(. Explain in detail about 9etork dependent and netork independent layers of O6I reference model.
%'5 /I. (+#3&!# %#>&
9etork dependent layers of O6I reference model. %*&
9etork independent layers of O6I reference model. %*&
#3. 0escribe the key elements of protocols and the standards. %#>&
#). 8ith relevant examples differentiate beteen simplex$ half duplex and full duplex communication.
%#>&
UNITDII DATA LINK LAYER
PART A
1. W)( #* ()* (y0*' ./ /#7*' ,"161* "$ )"-) 1*,*1 D( 1"$A C.$(#.12 (AUND 2009) -1
#. Information ;rames %I!;rames&
(. 6upervisory ;rames %6!;rames&
3. 5nnumbered ;rames%5!;rames&
2. W)( "' (.A*$ #"$-2 (AU ND 2009)
-1
#. "oken ring is a L'9 protocol standardi-ed by IEEE and numbered as IEEE *+(.).
(. In a token ring netork$ the nodes are connected into a ring by point!to!point links.
3. It supports data rate of : I 1= M60'.
). Each station in the netork transmits during its turn and sends only one frame during each turn.
=. "he mechanism that coordinates this rotation is called T.A*$ 0''"$-.
>. ' token is a simple placeholder frame that is passed from station to station around the ring. '
station may send data only hen it has possession of the token.
3. D*/"$* /#7"$- $+ #*'.$ /.# "(' $**+. (AU ND 2010) -1
%i& ;raming is the data link layer separates a message from one source to a destination$ or from other
message to other destinations$ by adding a sender address and a destination address.
%ii& "he destination address defines here the packet is to go$ the sender address helps the recipient
acknoledge the receipt.
:. C.70#* 0"3.$*( $+ '3((*#$*(. (AU ND 2010) -1
E"G P"3.$*( :
' Bluetooth netork is called a piconet $ or a small net.
"he communication beteen the primary and the secondary can be one!to!one or one!to!many.
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
E""G S3((*#$*(:
2iconets can be combined to form hat is called a scatternet.
>. W)( "' ()* 05#0.'* ./ )77"$- 3.+*2 (AU MJ 2012) -1
' hamming code can be designed to correct burst errors of certain lengths. 6o the
simple strategy used by the hamming code to correct single bit errors must be redesigned to be applicable
for multiple bit correction.
=. C.70#* G.63A N ARJ 8"() '(.0 $+ 8"( ARJ. (AU AP 2010) -1
(i) Goback N ARQ: 6ender keeps copy of up to 86 outstanding packets$ k!bit se,uence number$ 69 in
packet header. 8hen the receiver notices a missing/erroneous frame it discards 'LL frames ith greater
69s and sends no '1L .
%ii&S(.0 $+ W"( ARJ:6ender ' transmits a packet$ then ait$ If frame is error!free$ B sends
acknoledgement %'1L&$ else$ B sends a negative acknoledgement %9'1L&$! 6ender ' sends next
packet or retransmit hen it receives '1L or 9'1L.
;. W)( #* ()* 0#.61*7' ./ "$(*#3.$$*3("$- ,#".5' $*(8.#A'2 EAU &ND 2011G -1
#. "otal Bandidth (. Link Bandidth 3. .essage Latency ). Bisection Bandidth = .9umber of connections per node
>. 9umber of links as a function of the number of nodes ?.0iameter
C. D*/"$* /1.8 3.$(#.1 I *##.# 3.$(#.1. (AU AM 2011) -1
;lo control refers to a set of procedures used to restrict the amount of data. "he sender can send
before aiting for acknoledgment.
Error 1ontrol refers to primarily to methods of error detection and retransmission.
10. D*/"$* B15*(..(). (AU ND 2012)
-Bluetooth is a ireless L'9 technology designed to connect devices of different function such as
telephone$ notebooks$ 3.705(*#' E+*'A(.0 $+ 10(.0G% 37*#'% 0#"$(*#'% 3.//** 7A*#' $+ '. .$.
'pplications< ireless mouse or keyboard$ monitoring device$ security device.
11. W)y E()*#$*( "' '"+ (. 6* 1D0*#'"'(*$( 0#.(.3.12 (AU ND 2012) -1
Ethernet is said to be a # persistent protocol because an adaptor ith a frame to send (#$'7"(' 8"()
0#.66"1"(y 1 8)*$*,*# 65'y 1"$* -.*' "+1*
12. W)( #* ()* #*'0.$'"6"1"("*' ./ +( 1"$A 1y*#2 (AU AM 2010) -1
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
6pecific responsibilities of data link layer include the folloing.
a& ;raming b& 2hysical addressing c& ;lo control
d& Error control e& 'ccess control
13. W)"3) ARJ 7*3)$"'7 5("1"K*' 0"0*1"$-2 (AU AM 2010) -1
JO / Back! 9 7*3)$"'7 5("1"K*' 0"0*1"$-
12. H.8 "' #*0*(*# +"//*#*$( /#.7 $ 701"/"*#2 (AU AM 2011) -1
' repeater is an electronic device that receives a netork signal$ cleans it of unnecessary noise$ and
regenerates it. "he signal is retransmitted at a higher poer level
'mplifier is an electronic circuit that increases the poer of an input signal.
13. W)( "' ()* 05#0.'* ./ $*(8.#A "$(*#/3* 3#+2 (AU AM 2013) -1
Each station on an Ethernet netork has its on netork interface card.
"he 9I1 fits inside the station and provides the station ith a >!byte physical address.
1:. W)( #* V"#(51 LAN'2 (AU AM 2013) -1
%i&' virtual %or logical& L'9 is a local area netork ith a definition that maps orkstations on some
other basis than geographic location %for example$ by department$ type of user$ or primary application&.
%ii&"he virtual L'9 controller can change or add orkstations and manage load balancing and
bandidth allocation more easily than ith a physical picture of the L'9. 9etork management
softare keeps track of relating the virtual picture of the local area netork ith the actual physical
picture.
1=. W)( "' SONET2 SONET ()( "' 5'*+ ' (#$'0.#( $*(8.#A (. 3##y 1.+' /#.7 .()*# WAN'.
"he different Layers available in 6O9E" are listed belo<
%i& 2hotonic Layer %ii&6ection Layer %iii&Line Layer %iv&2ath Layer
1B. D*/"$* 6#"+-*'2
Bridge is nothing but a sitch that is used to forard packets beteen shared /media L'9s such as
Ethernet
1;. W)( "' #*+5$+$3y2
It is the error detecting mechanism$ hich means a shorter group of bits or extra bits may be appended at
the destination of each unit.
1C. L"'( .5( ()* ,"161* +*(*3(".$ 7*().+'.
"here are ) types of redundancy checks are used in data communication.
a& 4ertical redundancy checks %4R1&.b& Longitudinal redundancy checks %LR1&.
c& 1yclic redundancy checks %1R1&.d& 1hecksum.
21. W#"(* ').#( $.(*' .$ *##.# 3.##*3(".$.
It is the mechanism to correct the errors and it can be handled in ( ays.
a& 8hen an error is discovered$ the receiver can have the sender retransmit the entire data unit.
b& ' receiver can use an error correcting coder$ hich automatically corrects certain errors.
1C. W)( "' 65//*#2
Each receiving device has a block of memory called a buffer$ reserved for storing incoming data until
they are processed.
20. M*$(".$ ()* 3(*-.#"*' ./ /1.8 3.$(#.1.
"here are ( methods have been developed to control flo of data across communication links.
a& 6top and ait! send one from at a time. b& 6liding indo! send several frames at a time.
PART B
#. Explain the classification of E"7ER9E". %'5 /90 (++H& !# %#>&
6tandard Ethernet
;ast Ethernet
Jiga Byte Ethernet
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
"en Jiga byte Ethernet
(. 0escribe the collision avoidance mechanism used in *+(.## ireless L'9. %'5 /90 (+#+&!# %#>&
0iagram
Explanation
3. 8rite don the sender and receiver algorithm for Jo!Back!9 data link protocol.
%'5 /90 (+#+&!# %*&
'lgorithm
Explanation
). Explain 70L1 and explain it in detail. %'5/90 (+##&!( %#>&
0efinition
0iagram
Explanation
=. 0iscuss in detail about standard Ethernet and fast Ethernet. %'5/90 (+##&!( %#>&
0iagram
Explanation
>. Explain the flo and error control mechanism in data link control. %'5/90 (+##&!# %#>&
0iagram
Explanation
?. 8rite briefly about blue tooth technology. List the application and limitation.
%'5/90 (+##&!( %#>&
0efinition
0iagram
Explanation
'pplication
*. 0escribe in detail the architecture and layers of '". %'5 /90 (+#+&!# %#>&
0efinition
0iagram
Explanation
H. 0iscuss the sliding indo protocol in detail. %'5/'. (+#+$'5 /.I (+#3&!( %*&
0efinition
0iagram
Explanation
#+. Explain to problems in *+(.## .'1 sub layer protocol. . %'5 /'2(+#+&!# %*&
##. 0iscuss any to error correction techni,ues used in ireless links. . %'5 /'. (+#+&!# %*&
Block coding
.inimum distance
Retransmission
#(. 8hat is 10.'/10 ho does it orkG 0istinguish beteen #!persistent and non persistent 16.'.
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
%'5 /'2 (+##&!# %*&
10.' / 10 0efinition
8orking method
0ifference beteen #!persistant and non persistent 16.'
#3. 8ith neat diagram explain in detail about the stop and ait protocol in detail.
%'5 /.I (+#3&!# %*&
0iagram
Explanation of 6top and ait 2rotocol
#). 1ompare the standard Ethernet$ fast Ethernet$ gigabit Ethernet and ten!gigabit Ethernet.
%'5 /.I (+#3&!# %*&
#=. 0iscuss about piconet and scatter net ith diagrams. %'5 /.I (+#3&!# %*&
2iconet Explanation ith digram
6catternet Explanation ith diagram
UNIT III NETWORK LAYER
PART A
1. W)( "' ()* $*(8.#A ++#*''2 (AU ND 2009)-1
#. ' $*(8.#A ++#*'' serves as a uni,ue identifier for a computer on a netork.
(. 8hen set up correctly$ computers can determine the addresses of other computers on the netork and
use these addresses to send messages to each other.
3. C.70#* 3.$$*3(".$ 1*'' $+ 3.$$*3(".$ .#"*$(*+ '*#,"3*. (AU AM 2010, AU ND 2010)-2
S.N.. C)#3(*#"'("3' C.$$*3(".$1*'' S*#,"3* C.$$*3(".$ O#"*$(*+ S*#,"3*
#. Example of 2rotocol 502 %5ser 0atagram 2rotocol&
"12 %"ransmission control
protocol&.
(. Jeneral 0escription
6imple$ high!speed$ lo functionality
MrapperM that interfaces applications
to the netork layer.
;ull!featured protocol that allos
applications to send data reliably
ithout orrying about netork
layer issues.
3. 1onnection setup
0ata is sent ithout setup i.e.
connectionless.
1onnection must be established
pNrior transmission.
).
0ata interface to
application
.essage!based C data is sent in
discrete packages by the applications.
6tream!based C data is sent by the
application ith no particular
structure.
=.
Reliability and
acknoledgments
5nreliable$ best efforts delivery
ithout acknoledgments
Reliable delivery of messagesC all
data is acknoledged.
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
3. W)( "' 31''1*'' ++#*''"$-2 (AU AM 2010)-1
"o overcome address depletion. 9o classes$ but the address are still granted in blocks. "he si-e of the
block %the number of addresses& varies based on the nature and si-e of the entity.
:. W)( #* ()* #*'0.$'"6"1"("*' ./ $*(8.#A 1y*#. (AU AM 2010,AU MJ 2012)-2
"he netork layer is responsible for the source!to!destination delivery of packet across multiple netork
links. "he specific responsibilities of netork layer include the folloing<
O Logical addressing. O Routing.
>. W)( "' ()* /5$3(".$ ./ #.5(*#2 D*/"$* #.5(*#'. EAU &MF 2012% AU ND 2009)-2
%i&06'2 66'2 1ontrol Information Routers relay packets among multiple interconnected netorks.
%ii&"hey Route packets from one netork to any of a number of potential destination netorks on
Internet routers operate in the physical$ data link and netork layer of O6I model.
=. W)( "' ()* /5$3(".$ ./ RIP 7*''-*2 (AU ND 2010)-1
%i&RIPDR.5("$-I$/.#7(".$P#.(.3.1. RI2 is a dynamic$ distance vector routing protocol and as
developed for smaller I2 based netorks. 's mentioned earlier$ RI2 calculates the best
routebasedonhopcount.
%ii&4ersions<RI2v#$andRI2v(.RI2v#< RI2 version # is among the oldest protocols.
B. C.70#* '8"(3) 8"() )56. (AU ND 2011)-1
S.$. S8"(3) H56
#
6itch is a layer!( device$ in this data
transmission in the form of frames.
7ub is a layer!# device$ in this data
transmission in the form of bits.
(
68I"17 is layer ( device hich breaks
collision domain.ie every device connected to
the sitch has the e,ual bandidth.
75B is layer # device hich does not breaks
collision domain.ie if more devices are added
the bandith ill be shared.
3 It transmit data only to the destination port It is a multiple!port repeaterany signals send.
;. W#"(* ()* A*y' /.# 5$+*#'($+"$- ()* 1"$A '((* #.5("$-. (AU ND 2011)-1
O Lnoledge about the neighborhood. O Routing to all neighbors.
O Information sharing hen there is a range.
C. D*/"$* ICMP. (AU ND 2012)-1
%i&I1.2 is Internet 1ontrol .essage 2rotocol$ a netork layer protocol of the "12/I2 suite
used by hosts and gateays to send notification of datagram problems back to the sender.
%ii& It uses the echo test / reply to test hether a destination is reachable and responding. It
also handles both control and error messages.
10. W#"(* ()* A*y' /.# 5$+*#'($+"$- ()* +"'($3* ,*3(.# #.5("$-. . (AU ND 2012)-1
"he three keys for understanding the algorithm are
#. Lnoledge about the hole netorks
(. Routing only to neighbors
3. Information sharing at regular intervals
11. S((* ()* +5("*' ./ $*(8.#A 1y*#. (AU AM 2010)-1
%i& Responsible for the source!to!destination delivery of a packet.
%ii&Logical addressing
%iii&Routing
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
12. D*/"$* -*.-#0)"3 #.5("$-. (AU AM 2010)-1
Jeographical routing uses a nodeAs location to discover path to that node
#. 9odes kno their on geographical location
(. 9odes kno their #!hop neighbors!Routing destinations are specified geographically
%a location$ or a geographical region&
3. Each packet can hold a small amount of routing information.
13. F"$+ ()* 31'' ./ *3) ++#*''. (AU AM 2011)-1
%a& +++++++# ++++#+## ++++#+## ###+####
"he first bit is +. "his is a class ' address.
%b& #).(3.#(+.*
"he first byte is #) %beteen + and #(?&$ the class is '
1:. D#8 ()* -*$*#1 /.#7( ./ ICMP. (AU AM 2011)-1
1>.W)y IP,= 0#*/*##*+ .,*# ()$ IP,:2 (AU AM 2013)-1
%i& Larger address space %ii& Better header format %iii& 9e options
%iv&'lloance for extention %v& 6upport for resource allocation
%vi&6upport for more security
1=.W)( "' ()* 5'* ./ $*(8.#A ++#*'' (#$'1(".$G (AU AM 2013)
%i& 9'"! enables a user to have a large set of addresses internally and one address$ or a
small set of addresses$ externally.
%ii& "he traffic inside can use the large set$ the traffic outside$ the small set
1B. W)( #* ()* $*(8.#A '500.#( 1y*#' $+ ()* 5'*# '500.#( 1y*#'2
E"GN*(8.#A '500.#( 1y*#':
"he netork support layers are 2hysical layer$ 0ata link layer and 9etork layer. "hese deals ith
electrical specifications$ physical connection$ transport timing and reliability.
E""GU'*# '500.#( 1y*#':
"he user support layers are< 6ession layer$ 2resentation layer$ 'pplication layer. "hese allo
interoperability among unrelated softare system.
1;. W"() $*( +"-#7 *901"$ ()* #*1(".$')"0 ./ IEEE P#.!*3( (. ()* OSI 7.+*12
"he IEEE has subdivided the data link layer into to sub layers<
P Logical link control %LL1&
P .edium access control %.'1&
LL1 is non!architecture specific. "he .'1 sub layer contains a number of distinct modules$ each
carries proprietary information specific to the L'9 product being used.
1C. W)( #* ()* /5$3(".$' ./ LLC2
"he IEEE pro:ect *+( models take the structure of an 70L1 frame and divide it into ( sets of functions.
One set contains the end user portion of the 70L1 frame / the Other layers 9etork 0ata link 2hysical
Other layers 9etork$Logical Link 1ontrol$.edia 'ccess 1ontrol$2hysical logical address$ control
information$ and data. "hese functions are handled by the IEEE *+(.( logical link control %LL1&
protocol.
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
20. W)( #* ()* /5$3(".$' ./ MAC2
.'1 sub layer resolves the contention for the shared media. It contains synchroni-ation$ flag$ flo and
error control specifications necessary to move information from one place to another$ as ell as the
physical address of the next station to receive and route a packet.
21. W)( "' 0#.(.3.1 +( 5$"(2
"he data unit in the LL1 level is called 2rotocol 0ata 5nit %205&. It contains four
fields.
#. 0estination 6ervice 2oint 'ddress %06'2& (.6ource
6ervice 'ccess 2oint
3. 1ontrol field ).Information field
22. D*/"$* R.5(*#'.
06'2 66'2 1ontrol Information Routers relay packets among multiple interconnected netorks. "hey
Route packets from one netork to any of a number of potential destination netorks on Internet routers
operate in the physical$ data link and netork layer of O6I model.
(3. W)( "' 7*$( 6y ).0 3.5$(2
"he pathay re,uiring the smallest number of relays$ it is called hop!count routing$ in hich every link
is considered to be of e,ual length and given the value one.
2:. H.8 3$ ()* #.5("$- 6* 31''"/"*+2
"he routing can be classified as$
#. 'daptive routing (.9on!adaptive routing.
2>. W)( "' ("7*D(.D1",* .# 03A*( 1"/*("7*2
's the time!to!live field is generated$ each packet is marked ith a lifetime$ usually the number of hops
that are alloed before a packet is considered lost and accordingly$ destroyed. "he time!to!live
determines the lifetime of a packet.
(>. W)( "' 7*$( 6y 6#.5(*#2
' brouter is a single protocol or multiprotocol routers that sometimes act as a router and sometimes act
as a bridge.
2B. W#"(* ()* A*y' /.# 5$+*#'($+"$- ()* +"'($3* ,*3(.# #.5("$-.
"he three keys for understanding the algorithm are
#. Lnoledge about the hole netorks(.Routing
only to neighbors
3. Information sharing at regular intervals
2;. W#"(* ()* A*y' /.# 5$+*#'($+"$- ()* 1"$A '((* #.5("$-.
"he three keys for understanding the algorithm are
#. Lnoledge about the neighborhood. (. Routing to all neighbors.
3. Information sharing hen there is a range.
2C. H.8 ()* 03A*( 3.'( #*/*##*+ "$ +"'($3* ,*3(.# $+ 1"$A '((* #.5("$-2
In distance vector routing$ cost refer to hop count hile in case of link state routing$ cost is a eighted
value based on a variety of factors such as security levels$ traffic or the state of the link.
PART B
#. 0escribe distance vector routing. (AU ND 2009, AU MJ 2012)-2
(8)
0efinition
0iagram
Explanation
'pplication
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
(. 1ompare the distance vector and the link state routing protocol. (AU ND 200,)-2 (8)
3. Explain in detail about Link state routing protocol. %'5 /'. (+#+$ '5 /.I (+#(&!( (8)
0efinition
0iagram
Explanation
). Explain about I2 addressing methods . (AU AM 2010,)-1 (8)
0efinition
Explanation
=. 6tate the advantages of I2v> over I2v). (AU ND 2010)-1 (8)
'dvanatges of 2v >
'dvanatges of 2v )
>. 8hat is subnettingG 0iscuss. 'lso state hich classes of I2 address can be subnetted.
(AU ND 2010)-1
(8)
0efinition
Explanation
?. 8hat is subnet maskingG 0iscuss. (AU ND 2010)-1 (8)
0efinition
Explanation
*. Explain about internet protocol!I2v) and I2v>. (AU ND 2011, AU ND 2012)-2 (8)
0efinition
Explanation
H. Explain about routing!unicast$ multicast routing protocols. (AU ND 2011)-1 (8)
0efinition
0iagram
Explanation
#+. 8rite short notes on BOO"2. (AU ND 2012)-1 (8)
##. 7o looping problem is solved by sitches and by routers. 7o do sitches / routers
handle link failureG (AU ND 2010)-1 (8)
#(. 6tate the advantages of I2v> over I2v) (AU ND 2010)-1 (8)
#3. 8hat is subnettingG 0iscuss. 'lso state hich classes of I2 address can be subnetted.
%'5 /90 (+#+&!( %*&
#). 8hat is subnet .askingG 0iscuss. (AU ND 2010)-2 (8)
#=. Explain the folloing (AUND2011,AUND 2012)-2
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
%i& Internet protocol!I2v)$I2v> %ii& Routing! 5nicast$ .ulticast routing protocols
#>. 8rite short notes on the folloing (AU ND 2012)-1 (16)
a. BOO"2 %ii&.ulticast routing
#?. Briefly explain the various routing techni,ues in detail. (AU AM 2010)-1
(16)
#*. 8rite short notes on 9etork 'ddress "ranslation. (AU AM 2010)-1 (8)
#H. 7o ill you transmit the packets by using 0atagram approachG Explain in detail ith a neat
diagram. (AU AM 2010)-1 (8)
(+. Briefly explain IJ.2 message format and IJ.2 operation in detail. %AU AM 2011)-1 (8)
UNIT IV TRANSPORT LAYER
PART A
1.W)( "' 1*Ay 653A*(2 (AU ND 2009)-1
"he input rate can vary$but the output rate remains constant.6imilarly$in netorking$
a techni,ue called leaky bucket can smooth out bursty traffic.
Bursty chunks are stored in the bucket and sent out at an average rate.
2.D*/"$* 751("01*9"$- $+ +*751("01*9"$-. (AU ND 2009)-1
M51("01*9"$-: .any D(.D .$* 0#.3*''% A33*0(' 7*''-*' /#.7 +"//*#*$( 0#.3*''*'%
0ifferentiated 6y ()*"# ''"-$*+ 0.#( $576*#'.
D*751("01*9"$-: One !to! .any process$ receives message from netork layer$ check
the error and deliver each message to appropriate process based on port number
3. I$ 3'*' 8)*#* #*1"6"1"(y "' $.( ./ 0#"7#y "70.#($3*% UDP 8.51+ 7A* -..+
(#$'0.#( 0#.(.3.1. G",* *9701* ./ '0*3"/"3 3'*2 (AU ND 2010)-1
1. ";"2!T#","1 F"1* T#$'/*# P#.(.3.1. 2. SNMP 3. RIP
:. W)( #* ()* /.5# -*$*#1 (*3)$"45*' (. "70#.,* ()* JOS "$ ()* (#$'0.#( 1y*#2
(AU ND 2009,AU AM 2011)-2
#. 6cheduling "raffic (.6haping 3.'dmission control ).Resource reservation
>. W)( #* ()* +5("*' ./ (#$'0.#( 1y*#2 (AU ND 2011)-1
"he services provided by the transport layer
#. End!to! end delivery (.'ddressing 3.Reliable delivery ).;lo control =..ultiplexing
=. W)( "' 7*$( 6y '*-7*$(2 (AU ND 2011)-1
't the sending and receiving end of the transmission$ "12 divides long transmissions into smaller data
units and packages each into a frame called a segment.
B. E901"$ ()* 7"$ "+* ./ ()* UDP. 2 (AU ND 2012)-1
%i& 5ser 0atagram 2rotocol is called a connectionless$ unreliable transport protocol!does not add
anything to the services of I2 except to provide process to process communication instead of host!to!
host communication.
%ii& It performs very limited error checking.
%iii& 502 is a very simple protocol using a minimum of overhead.
;. W)( "' 7*$( 6y 451"(y ./ '*#,"3*2 (AU ND 2012)-1
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
"he ,uality of service defines a set of attributes related to the performance of the connection. ;or each
connection$ the user can re,uest a particular attribute each service class is associated ith a set of
attributes.
C. W)( "' ()* 05#0.'* ./ TCP 05') .0*#(".$2 (AU AM 2010)-1
%i& "he sending "12 must not ait for the indo to be filled. It must create a segment and send it
immediately.
%ii& 2ush bit to let the receiving "12 kno that the segment includes data must be delivered to the
receiving application program as soon as possible.
10. N7* ()* ()#** (y0*' ./ '.3A*( "$(*#/3*'. (AU AM 2010)-1
"here are several Internet socket types available<
D(-#7 '.3A*('$ also knon as connectionless sockets$ hich use 5ser 0atagram 2rotocol %502&
S(#*7 '.3A*('$ also knon as connection!oriented sockets$ hich use "ransmission 1ontrol
2rotocol %"12& or 6tream 1ontrol "ransmission 2rotocol %61"2&.
R8 '.3A*(' E.# R8 IP '.3A*('G$ typically available in routers and other netork e,uipment. 7ere
the transport layer is bypassed$ and the packet headers are made accessible to the application.
11. S500.'* TCP 3.$$*3(".$ "' (#$'/*##"$- /"1* ./ >000 6y(*'% ()* /"#'( 6y(* "' $576*#*+ 10001.
W)( #* ()* '*45*$3* $576*#' /.# *3) '*-7*$( "/ +( #* '*$( "$ /",* '*-7*$('% *3) 3##y"$-
1000 6y(*'2 (AU AM 2011)-1
6egment # 6e,uence 9umber< #+$++# %range< #+$++# to ##$%++&
6egment ( 6e,uence 9umber< ##$++# %range< ##$++# to #($+++&
6egment 3 6e,uence 9umber< #($++# %range< #($++# to #3$+++&
6egment ) 6e,uence 9umber< #3$++# %range< #3$++# to #)$+++&
6egment = 6e,uence 9umber< #)$++# %range< #)$++# to #=$+++&
13. W)( "' ()#** 8y )$+ ')A"$-2 (AU MJ 2013)-1
"he connection establishment in "12 in called three ays hand shaking.
1:. D"//*#*$("(* 3.$'($( 6"( #(* $+ ,#"61* 6"( #(*. (AU MJ 2013)
S1.$. C.$'($( 6"( #(* V#"61* 6"( #(*
# ;ixed si-e 4ariable si-e
( 0ata rate does not change 0ata rate change in time
3 'verage rate and peak rate are same 'verage rate and peak rate are different
) "raffic is easy to handle "raffic is difficult to handle
1>. W)( "' '50*#$*(("$-2 EAU &AM 2010GD1
#. 6upernetting refers to increase host and reduce the subnets. It means reduce the netork bits and
increase the host bits.
(. 6upernetting is the collection of the subnets. In supernetting$ an organi-ation can combine several
class 1 blocks to create a larger range of addresses.
1=. W)y ()* 3.$-*'(".$ .335#' "$ $*(8.#A2 EAU &FM 2012GD1
If the load on the netork /the number of packets sent to the netork is greater than the capacity of the
netork!the number of packets a netork can handle.
1B. W)( "' 7*$( 6y S.3A*(2 EAU &FM 2012GD1
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
#. ' netork socket is an endpoint of an inter!process communication flo across a computer netork.
"oday$ most communication beteen computers is based on the Internet 2rotocolC therefore most
netork sockets are Internet sockets.
(. "he combination of an I2 address and a port number is called s socket address.
1;. W)( "' /5$3(".$ ./ (#$'0.#( 1y*#2
%i&"he protocol in the transport layer takes care in the delivery of data from one application program on
one device to an application program on another device.
%ii&"hey act as a link beteen the upper layer protocols and the services provided by the loer layer.
1C. W)( "' ()* +"//*#*$3* 6*(8**$ $*(8.#A 1y*# +*1",*#y $+ ()* (#$'0.#( 1y*# +*1",*#y2
1. N*(8.#A 1y*# +*1",*#y: T)* netork layer is responsible for the source!to!destination delivery of
packet across multiple netork links.
2. T#$'0.#( 1y*# +*1",*#y: "he transport layer is responsible for source!to!destination delivery of the
entire message.
20. W)( #* ()* /.5# '0*3(' #*1(*+ (. ()* #*1"61* +*1",*#y ./ +(2
;our aspects are %i& Error control %ii& 6e,uence control
%iii& Loss control %iv& 0uplication control
21. W)( "' 7*$( 6y '*-7*$((".$2
8hen the si-e of the data unit received from the upper layer is too long for the netork layer datagram
or data link layer frame to handle$ the transport protocol divides it into smaller usable blocks. "he
dividing process is called segmentation.
22. W)( "' 7*$( 6y C.$3(*$(".$2
"he si-e of the data unit belonging to single sessions are so small that several can fit together into a
single datagram or frame$ the transport protocol combines them into a single data unit. "he combining
process is called concatenation.
23. T)* (#$'0.#( 1y*# 3#*(*' ()* 3.$$*3(".$ 6*(8**$ '.5#3* $+ +*'("$(".$. W)(
#* ()* ()#** *,*$(' "$,.1,*+ "$ ()* 3.$$*3(".$2
;or security$ the transport layer may create a connection beteen the to end ports. ' connection is a
single logical path beteen the source and destination that is associated ith all packets in a message.
1reating a connection involves three steps<
%i& 1onnection establishment %ii& 0ata transfer K 1onnection release.
2:. W)( "' 7*$( 6y 3.$-*'(".$2
1ongestion in a netork occurs if user sends data into the netork at a rate greater than that alloed by
netork resources.
2>. W)y ()* 3.$-*'(".$ .335#' "$ $*(8.#A2
1ongestion occurs because the sitches in a netork have a limited buffer si-e to store arrived packets.
2=. W)( #* ()* (8. 3(*-.#"*' ./ JOS ((#"65(*'2
"he to main categories are
%i& 5ser Oriented %ii& 9etork Oriented
2B. L"'( .5( ()* 5'*# #*1(*+ ((#"65(*'2
5ser related attributes are
%i& 61R / 6ustainable 1ell Rate %ii& 21R / 2eak 1ell Rate
%iii& .1R! .inimum 1ell Rate %iv& 140" / 1ell 4ariation 0elay "olerance
2;. W)( #* ()* $*(8.#A' #*1(*+ ((#"65(*'2
"he netork related attributes are$
%i& 1ell loss ratio %1LR& %ii& 1ell transfer delay %1"0&
%iii& 1ell delay variation %104& %iv& 1ell error ratio %1ER&
2C. W)( "' ()* +"//*#*$3* 6*(8**$ '*#,"3* 0."$( ++#*''% 1.-"31 ++#*'' $+
0)y'"31 ++#*''2
E"GS*#,"3* 0."$( ++#*''"$-
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
"he transport layer header includes a type of address called a service point address or port address$
hich makes a data delivery from a specific process on one computer to a specific process on another
computer.
E""GL.-"31 ++#*''"$-
If a packet passes the netork boundary e need another addressing to differentiate the source and
destination systems. "he netork layer adds headers$ hich indicate the logical address of the sender
and receiver.
E"""GP)y'"31 ++#*''"$-
If the frames are to be distributed to different systems on the netork$ the data link layer adds the
header$ hich defines the source machineAs address and the destination machineAs address.
30. W)( #* ()* #51*' ./ $.$ 6.5$+#yD1*,*1 7'A"$-2
#. "he bytes in the I2 address that corresponds to (== in the mask ill be repeated in the
subnetork address
(. "he bytes in the I2 address that corresponds to + in the mask ill change to + in the subnetork
address.;or other bytes$ use the bit!ise '90 operator.
31. D*/"$* G(*8y.
' device used to connect to separate netorks that use different communication protocols
32. W)( "' LSP2
In link state routing$ a small packet containing routing information sent by a router to all other router by
a packet called link state packet.
PART B
#. Explain in detail about integrated services and impact of @O6 . %'5 /'. (+#+&!# %*&
(. 8ith a neat sketch explain 5ser 0atagram format. %'5 /'. (+#+&!# %*&
3. 8ith a neat sketch explain "12 segment format. %'5 /'. (+#+&!# %*&
). 0ra the "12 header and explain its fields. %'5 /.I (+#(&!# %*&
=. 8hat are the functions performed by 502G 8hat are the fields in its headerG
%'5 /.I (+#(& !# %*&
>. Explain the sliding indo protocol. %'5 /90 (++H&!# %*&
?. Explain the to categories of congestion control in detail. %'5 /90 (++H&!# %*&
*. 8hat is @O6 in internetorkingG 6tate the techni,ues to improve @O6.%'5 /90 (+#+&!# %*&
H. Explain "12 connection$ "ermination and error control mechanism. %'5 /90 (+#+&!# %*&
#+. 0iscuss the congestion control mechanism and transmission control protocol ith neat
sketches. %'5 /90 (+##&!# %*&
##. Explain the leaky bucket and token bucket algorithm ith flo charts. %'5 /90 (+##&!# %*&
#(. Explain the congestion control techni,ue in "12. %'5 /90 (+#(&!# %*&
#3. Explain the segment formats for "12 and 502. %'5 /90 (+#(&!#
#). 7o is I2 address space divided into different classful addressesG Explain.
%'5 /'. (+#+&!# %*&
#=. 8hat do you understand by Q3!ay hand shakeR in "12G Explain (AU AM 2011&!# %*&
#>. Explain the features of "12. (AU AM 2011)-1 (8)
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
#?. Elaborate the characteristics of @O6. (AU AM 2011)-1 (8)
#*. Explain the folloing characteristics. (AU MJ 2013)-1 (8)
%i& Reliability %ii& 0elay %iii& Iitter %iv&Bandidth
#H. Explain ho connection is established and released in "12 ith a neat sketch.
(AU MJ 2013)-1 (8)
(+. Explain the default timer mechanism folloed in "12. (AU MJ 2013)-1 (8)
UNIT & V APPLICATION LAYER
PART A
1. W)( "' DNS $+ ()* 05#0.'* ./ DNS2 %'5 /.I (+#(&!#
"he 096 converts the 0omain names into I2 numbers !0omain 9ame 6ystem can map a name to an
address and conversely an address to name.
0ivisions of 096 #.Jeneric domains (.1ountry domains 3.Inverse domains
2. W)( "' ()* /5$3(".$ ./ SMTP2 EAU &MF 2012GD1
#. "he "12/I2 protocol supports electronic mail on the Internet is called simple .ail "ransfer%6."2&.
It is a system for sending messages to other computer users based on e!mail addresses.
(. 6."2 provides mail exchange beteen users on the same or different computers.
3. M*$(".$ ()* '"-$"/"3$3* ./ $*(8.#A '*35#"(y. EAU &AM 2010GD1
1. P#",3y: "he sender and the receiver expect confidentiality.
2. A5()*$("3(".$: "he receiver is sure of the senderAs identity and that an imposter
has not sent the message.
3. I$(*-#"(y: "he data must arrive at the receiver exactly as it as sent.
4. N.$DR*05((".$: "he receiver must able to prove that a received message came
from a specific sender.
:. D*/"$* 3#y0(.-#0)y $+ $**+ /.# 3#y0(.-#0)y. (AU ND 2009, AU &AM 2010)-
2
1ryptography is the science and art of transforming messages to make them secure and
immune to attack.
>. W)( "' $.$y7.5' FTP2 (AU ND 2010)-1
#. FTPD F"1* T#$'/*# P#.(.3.1. "o donload and upload files from and to the server.
(. ;"2 establishes to connections beteen the hosts. One connection is used for data
transfer$ the other for control information. "he control connection uses very simple
rules of communication. "he data connection needs more complex rules due to the
variety of data types transferred.
=. W)( "' '56'("(5(".$1 $+ (#$'0.'"(".$ *$3#y0(".$. (AU ND 2011)-1
S56'("(5(".$1:
#. ' character level encryption in hich each character is replaced by another character in the set.
(. 6ubstition ciphers encrypt plaintext by changing the plaintext one piece at a time. "he 1easar 1ipher
as an early substitution cipher. In the 1aesar 1ipher$ each character is shifted three places up.
"herefore$ ' becomes 0 and B becomes E$ etc...
T#$'0.'"(".$1:
3. ' 1haracter level encryption in hich the characters retain theirplaintext but the position of the
character changes.
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
). "ransposition ciphers encrypt plaintext by moving small pieces of the message around. 'nagrams are
a primitive transposition cipher. "his table shos M4OF'JERM being encrypted ith a primitive
transposition cipher here every to letters are sitched ith each other<
B. W)( "' +"-"(1 '"-$(5#*2 (AU ND 2011)-1
0igital signature is a method to authenticate the sender of a message. It is similar to that of signing
transactions documents hen you do business ith a bank. In netork transactions$ you can create an
e,uivalent of an electronic or digital signature by the ay you send data.
;. H.8 "' 'y77*(#"3 A*y +"//*#*$( /#.7 0561"3 A*y2 (AU ND 2012)-1
%i&In secret key$ the same key is used by both parties. "he sender uses this key and an encryption
algorithm to encrypt dataC the receiver uses the same key and the corresponding decryption algorithm to
decrypt the data.
%ii&In public key$ there are to keys< a private key and a public key. "he private key is kept by the
receiver. "he public key is announced to the public.
C. D"'35'' ()* ()#** 7"$ +","'".$' ./ ()* DNS. (AU ND 2012)-1
M"$ +","'".$' ./ DNS #. Jeneric domains (.1ountry domains 3.Inverse domains
G*$*#"3 +.7"$: 0efine registered hosts according to their generic behavior$ uses generic
suffixes.
C.5$(#y +.7"$: 5ses to characters to identify a country as the last suffix.
I$,*#'* +.7"$: ;inds the domain name given the I2 address.
10. W)( "' ()* 05#0.'* ./ "$,*#'* +.7"$2 EAU &AM 2010GD1
"o finds the domain name given the I2 address.
11. W)( "' ()* /5$3(".$ ./ PDB.92 EAU &AM 2010GD1
In cryptography$ a permutation box %or 2!box& is a method of bit!shuffling used to permute or transpose
bits across 6!box inputs$ retaining discussion hile transposing.
12. W)y +. 8* $**+ POP3 .# IMAP: /.# ED7"12 EAU &AM 2011GD1
%i& 8orkstations interact ith the 6."2 host$ hich receives the mail on behalf of every host in the
organi-ation$ to retrieve messages by using a client!server protocol such as 2ost Office 2rotocol$ version
3%2O23&.
%ii& 2O23 is used to donload messages from the server$ the 6."2 client still needed on the desktop to
forard messages from the orkstation user to its 6."2 mail server.
13. D"//*#*$("(* 3"0)*# (*9( $+ 01"$(*9(. EAU &AM 2011GD1
1ipher text is the unreadable output of an encryption algorithm
2lain text means its text that hasnNt been formatted %i.e.$ a plain text file&
1:. S((* ()* +"//*#*$3* 6*(8**$ /511y 451"/"*+ $+ 0#("11y 451"/"*+ +.7"$
$7*. EAU &MF2013GD1
#. F511y J51"/"*+ D.7"$ N7* EFJDNG
"he domain names alays read from the node up to the root. 7ence the last label is the label of the
root %null&.If a label is terminated by a null string$ then it is called fully ,ualified domain %;@09& that
contains the full name of a host. Ex<CS.0#"$3*+.$.*+5
(. P#("11y J51"/"*+ D.7"$ N7* EPJDNG
If a label is not terminated by a null string$ then it is called as partially ,ualified domain name
%2@09&. It starts from the node$ but it does not reach the root. E9701*: CS
1>. D"'35'' ()* 6'"3 7.+*1 ./ FTP.
#. "he client has three components< the user interface$ the client control process$ and the client data
transfer process.
(. "he server has to components< the server control process and the server data transfer process. "he
control connection is made beteen the control processes. "he data connection is made beteen the
data transfer processes.
1=.W)( "' ()* +"//*#*$3* 6*(8**$ 5'*# -*$( EUAG $+ 7"1 (#$'/*# -*$( EMTAG2
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
%i&"he 5' prepares the message$ creates the envelope$ and puts the message in the envelope.
%ii&"he ."' transfers the mail across the Internet.
1B. H.8 +.*' MIME *$)$3* SMTP2
%i& .I.E is a supplementary protocol that allos non!'61II data to be sent through 6."2. .I.E
transforms non!'61II data at the sender site to 94" '61II data and deliverers it to the client 6."2 to
be sent through the Internet.
%ii& "he server 6."2 at the receiving side receives the 94" '61II data and delivers it to .I.E to be
transformed back to the original data.
1;.W#"(* +.8$ ()* ()#** (y0*' ./ WWW +.357*$('.
"he documents in the 888 can be grouped into three broad categories< static$ dynamic and active.
1. S(("3: ;ixed!content documents that are created and stored in a server.
2. Dy$7"3: 1reated by eb server henever a broser re,uests the document.
3. A3(",*: ' program to be run at the client side.
1C. W)( "' ()* 05#0.'* ./ HTML2
%i& 7".L is a computer language for specifying the contents and format of a eb document.
%ii&It allos additional text to include codes that define fonts$ layouts$ embedded graphics and
hypertext links.
20.D*/"$* CGI.
%i&1JI is a standard for communication beteen 7""2 servers and executable programs.
%ii&It is used in crating dynamic documents.
21. W)( #* ()* +,$(-*' I +"'+,$(-*' ./ 0561"3 A*y *$3#y0(".$2
A+,$(-*':
a& Remove the restriction of a shared secret key beteen to entities. 7ere each entity can create a pair
of keys$ keep the private one$ and publicly distribute the other one.
b& "he no. of keys needed is reduced tremendously. ;or one million users to communicate$ only to
million keys are needed.
D"'+,$(-*:
a& If you use large numbers the method to be effective. 1alculating the cipher text using the long keys
takes a lot of time. 6o it is not recommended for large amounts of text.
22. W)( #* ()* +,$(-*' I +"'+,$(-*' ./ '*3#*( A*y *$3#y0(".$2
A+,$(-*:
6ecret Ley algorithms are efficient< it takes less time to encrypt a message. "he reason is that the key is
usually smaller. 6o it is used to encrypt or decrypt long messages.
D"'+,$(-*':
a& Each pair of users must have a secret key. If 9 people in orld ant to use this method$ there needs to
be 9 %9!#&/( secret keys. ;or one million people to communicate$ a half!billion secret keys are needed.
b& "he distribution of the keys beteen to parties can be difficult.
23.W)( "' 888
b) World Wide Web is: all the resources and users on the Internet that are using the Hypertext Transer
!rotocol (HTT!)
PART B
#. 8ith a relevant example discuss ho the domain space is dividedG 'nd list the risks faced by messages
that are transmitted over the internet. (AU ND 2010)-1 (8)
(. 0istinguish beteen a fully ,ualified domain name and partially ,ualified domain name. Jive relevant
example. (AU ND 2010)-1 (8)
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN
Subject Code / Name:EC2352 COMPUTER NETWORKS
3. 8hat is the acronym 6."2$ ;"2$ 888 and 7""2 stands forG Explain their uses and state the
strengths and eaknesses of each of them. (AU ND 2010)-1 (8)
). Explain in detail R6'!25BLI1 LEF 1RF2"OJR'27F ith examples. %'5 /90 (++H&!(
%*&
=. 7o does the E!mail system orkG Explain about E!mail services. %'5 /90 (++H)-1 (8)
>. Explain the functioning of 096. %'5 /'. (+#+$ AU ND 2011, AU AM 2010)-3 (8)
?. Explain the 6imple .ail "ransfer 2rotocol. %'5 /'. (+#+&!# %*&
*. Explain the various services provided by security. %'5 /'. (+#+&!# %*&
H. 8hat are the servers involved in Lerberos protocolG Explain in detail.%'5 /'. (+#+&!# %*&
#+. 0escribe ho 6."2 protocol is used in E!mail applications. %'5 /'. (+##&!# %*&
##. Explain about 0igital 6ignature. %'5 /'. (+##&!# %*&
#(. 0iscuss in detail about 7""2. %'5 /'. (+#+$ (AU ND 2012)-2 (8)
#3. Explain in detail about 888 architecture. (AU MJ 2012, '5 /.I (+#3&!( %*&
0iagram
Explanation
#). 8rite short notes on< (AU JM 2012, AU ND 2012)-2 (8)
%i& ;"2 %ii& 6ymmetric key.
#=. Explain the concept of cryptography and discuss about symmetric key and public key algorithms.
(AU ND 2011)-1 (8)
Definition for Criptograp!.
"#p$ain %!&&etri' (e! A$gorit&.
)*+$i' (e! A$gorit&.
--------------------
By : P.R! P"#"$. M.E.%M.B.A.% KCE/ECE/QB/III YR/CN