Link

Layer
2-3B
2-2B 2-3B2-22B
to 2-12B
to 2-12B
to 2-28B
to
2-22B to 2-37B
2-33B
to
2-33B
2-29B
CONTENTS
Correction (CSTT-Sem-6)
B
2-1
and
Sliding and
(Elementary
Control
Flow Algorithm)
Tree
Spanning
andBridge
Control
:
and Protocol, NetworksChannel Switches
Window Allocation
Protocols) (Learning
Detection
2
Access Standard
LN
Link Area Layer
Framing.
Part-1: :Medium Bridges
Error Data Local Link
UNIT
Part-2: :
:Part-5
:Part-3 Part-4 Part-6
the
1-37Bon
protocol with
(CS/TT-Sem-6) diagram
various with
medi
cable. methods
of of
necessary transmission
basis disadvantages optic
switching
fiber
suite design layer and
protocol and
topological physicalco-axial of
advantages types
TCPIP
principle.
layering different pair, various
network twisted suitable
examples.
Networks
Computer Q.Refer thetopologies.
the 1.14. 1.17. the1.20.
Q.Refer 1.21.
Discuss Explainbrief Q.Refer the 1.27.
Discuss Compare Explain
Q.
Q.
and Refer Refer
Q.4. Q.5. Ans Q.6.Ans Q.7.Ans 9.8. AS
 other at signals bits.from delimiter it other
another, the two
2-3
(CSTT-Sem-6)
B characters. added alter into
of frame Questions and
and It seguence signal.
is characters. the magnetism,can errors
addressesflag one to
&-bit as point changes
(1-byte) separate the the
a 01111110,
are bits. is Type one of classify
error.
in
results
8 destination
carried
bit.s. special frame frame. Correction. heat, timing
from
such
of &-bit to Answer
multiples redundant
a flag,
delimiter Questions-Answers from or data, can
be an
protocol-dependent
of the flows
section pattern PART-2 types. shape
interference
binary we
to frame.
next, of and Medium
dataalso and end signal condition
error
: Character-Oriented
waysFraming
: detection a the
the dataneed &-bitthe Detection its encoded
are source
character-oriented
In
framing, a change in
electromagnetic
two fromof and and bits
trailer end frame. thewe
Bit-Oriented
Framing
: special and unpredictableThis
in the errorframeof framing,
framing,beginning Error error carrying of
done the Type can data.number
information. composed
the carries
control a a electricity.
forms
of interference
carriesand of use
Computer
Networks
be and one end Answer Discuss the
bit-oriented
beginning bit-oriented protocols an is
can
header trailerseparate the to of the
signal
This
header is or other.
the define Whenever
subject meanings
flagstart on
Long Depending
TheThe The the Thethe Most 2.3. Answer ThisIfthe :as
types
To In In to
Que
is
A.
2 3. 5
B. 2. 3. 1. 2. 3.
6
Link
Layer a synchronization.
is adding error boundaries
for error a
receiver. frame well
Questions way single-bit
receipt. single-bit
by
signal. each destination frame. as
a
provides
the go. provide frame
the a
to
Type to a bit that
provides
layer a whole that framing?
of
meaningful is acknowledge
and of
form so a packet to
It the so end
Answer needed? layer. framesto frame
frames, need delimiter.
Questions-Answers the source
address.
the of of no define
in retransmission
large
disting
Framing. Medium
1PART- linkare bits recipient types is
is into one where
physical smaller there as to
it data that moving destination very
Why bits from defines different
and
acts need
bits to
and the the another.
from
distinguishable
packs message
transmission the one intoframe. :
framing itself
framing. size is frame
of of means helps in thedivided
address carried
there
Type set
function the fixed frame
a requiresmall next
a layer
transmission a and of
(CSTT-Sem-6)
B
2-2 transmit separates address is are types of
framing
Answer Define address message is tothe the
frame. of
aisFraming data-link destination Need
offraming:
is
would
that What frame of Variable
size: beginnin
data
During sender message only the : Length this
to Framing size
Long sender aare The
sender it Hence In
2.1.
Que Answer Data
The The 0Ccur
affects
2.2. Fixed
Following
Que Answer
The a
a If
4
5. 6. 1. 1.
2 2,
 introduced receivedreceived
isthere the detected data detect message segments complement
2-5 is thenis
B(CS/IT-Sem-6) sure transmission l's discarded.
signalThis to usingcomplemented.
parity
correct. receiver byte
ifand
a
or to make
transmitted the the is used segments.
odd change.
errors file to the kinto added otherwise
in same error
ignore
a is data to the l's
an not present applied divided
to of that value, using are
has is will will How integrity of
signal due the the
check sets data is
thesignal codeword is checksum. sumaccepted
segments
change error receiver
of checksum. two
is sent is
data
added the
of
parity received at retransmission
the
redundancy function thefree. The
received checked data. compare with
bits that error
matches the are sum.is
the the verify value. :byte alongreceived data
scheme, the
the of
thethe number of is
understood
then of
concept
the
of
validity checksum and
segments
get thereceived10011001111
that that parity codeword to to numerical checksum sent get
detected of used value
successful
and used type detection to all
known the complemented
is to
conclude
"even" oddthe is ?
byte
the
the checksum
typically thesum. segment data:
end,arithmetic
it for value checkssimple the
received
an transmissionthen is end,the using endthe
is be 2.4.1. error checksum
Explain be error zero,following
receiver's
Networks
Computer or request a
same. retrieveto get
sender's
it to can error change
in
parity is thatais are receiver checksumis
if going Fig. data.
errors
in received
considered bits.
ofm
each
checksum
detection to complement
means receiver the of transmitter. checksum checksumChecksums
the result
presence sum is
arithmetic
in single of and transfer. are to sum consider
alwaysshownduring Parity the theframe the the
the
That word. byte Que 2.5. Answer ais they
the The The
the Ifa If using A It A At If is Error In In At If Lets
2 5. 2 3 4. 5. 6 l. 2. 3. 4. 5. 6.
3 4
Link
Layer given1. to bit. between
to
from 1 shown parity.
erTor
the o111oo10
Error from erroneous
occurred. o1011oo
1 ? Correct
word
Receiver's
Incorrect
word word Incorrect
change Length
ofburst detection an decision
in change in is error
(5
bits) expected
bitserror
of the
bit Received
byte Received
byte presence
first
one will if
bytehave the error the error
burst
only byte theof
error. a to fromnsome thefrom of 5.
that transmitted as said the
error. in Parity presence
3,
such 2.3.2. detect
different Even 1,
suggests bit though
are extendsof helpful Odd Odd
length ie.,
error.2.3.1. Single unit
errors Fig. Burst
can
Medium Medium 0| theodd
data Even 0 0
a error the in 2.3.2. is is
receiver Message
bits 1 detects
in in Fig.
error 2.3.1. illustrated checking signal 11 1
101 1
is
a burst bit.corrupted errors
bit
is bit in
byteoneshown O11oo|1|1
Fig.
from burst
then erroneous o1110o
11
Fig.
thereceived 0
10
rors

O00
receiver
of
single
as only bits error 0 number
error:
bit
Single
B(CSIT-Sem-6)
2-4 such byte
Transmitted the are parity at 0 0
as
means more1to of have not
been Transmitted
byte checking : 0 1 The
termunit l, 0 lenggth
errors the with0 0
Burst
errors
: P
to or from last be 5bits. How of
P P
with 24.1.
ThedataThat0or Iftwo
or The
the Burst parity code
parity
0 0 to Transmitted error code
codeOne threeFig.
error
24. ReceivedReceived
1. I1. i Thethe
Answer
Que if
.
2
 checked. then ision
is remainder
div this of The corresponding
Gx). to worgenerator
d
the divisible
by exactly becomes obtained thus wordappended
(generator divisor The
transmitter. the atused was which word) The word. message appended 5
and unit oue it receiver
astreats 3. called worisd This
bit ) +sme ( byit
the divides message. the of
consists at codeword
the received The 2. end thappended
e at remainder is CRC orCRC called bits
CRC. andmessage of receiver redundant sequence
of division.A binary principle
checker. CRC 2.62. Fig. of the on works CRC
division. long helof
p the with polynomial
Mx) (message ) 4
errOrs no Remainder dataword given generated afor codeword
be can polynomial
A
Ga).
then remainder
0is If generator upona agree should receiver and sender the code CRC For 3
Divisor EX-0R. identical
to arewhich
subtraction
addition
and arithmetic
i.e., modulo-2 arithmetic
usesa Polynomial
2
division only. andcoefficients
1 0of polynomials
with formof the
Binary represented
in string
is bit whicha polynomial
incode type
of ais
CRC
CRC Message Anawer
CRC Message CRC. on
note short Wriate 2.6. ue
codeword Received
checker. CRC the shows 2.6.2 Fig. 1. data Accept Conclusion:
checker: CRC Complement
00000000
2.6.1. Fig. shown
intransmitted
as codeword
beto the get to 1,
appended Osreplace
then wil CRC 4:This Step 11111111 Sum
step inunit data the to Checksum
CRC. 11011010 11011010
bit thne in
is step2 division obtained remainder
the after The Step
3: 00100101 00100101 Sum
division. binary (generator).
aisThis
divisor the byste1p inunit generated
data newly the Divide 2:Step 1
Q00100100 Q00100100
message. the 4-zeros
to append to
have we
then long 5-bit divisoris the If
word).generator (i.e., divisorpredecided the bits
in number
of the than 10000100 10000100 4
4
less 1iswheren word message the of Appenda
to Os ntrain Step
:1 10100000 10100000
follows generation
as is CRC procedure
in stepwise The 2 00100100
00100100 3 3
generator. CRC 2.6.1. Fig. 01111100
Message 01111100
CRE 1
Codeword bits n 1
Do1111011 Qo1111011
Divisor CRC
11100010 11100010 2
2
Divisor 10011001 10011001 1
division Receiver Sender
Binary
m 4,k=
wordmessage Appended00*0 Message 4 3 2 1
bits n 10000100 00100100 11100010 10011001
2.6.1. Fig. shown
in generator
is CRC The 1. dataOriginal
generator: CRC
B(CTT-Sem
-6) 2-7 Networka Computer Layer Link (CTT-Sem-6) 2-B6
2-9 it
word.
(CSTT-Sem-6)
B checkschecks is received we
that receiver 3
and
codebits it it
positions
positions error. word. 2
theof aby the exists. 1,
whether error. steps
in sequence received
in 1
0 1 error 1's
position
bits
the the bit PD, errorword. error.
word. no the
in
the the so obtained
in in state so error
of the ones ones codeword locate parity. error parity of position 1 in
some position parity is
determines of parity P, the codeword
of
for numbernumber wrong, 1 1101’Odd
= the 1001’Even Odd of P P,
2's4's
position
parity hamming
even
D, of 2's position and 0
1 7: 7: 1011’
If D, and position
and the 7: word: P2
P, transmitted
total total 5,
thebit skips. thewrong. 0
6 6 in 3,
ofP,, =
(5)0
parity D,
calculatesthe the 7-bitAssuming 1codeword: Received
5, l's
4, D, 4's 3, 0 1,
2, = = bits = the error P4 values E-=
alternately
checks
and if or D, P, P,DDD,
the 1if the bits Error
exists
here.
the bits in
Networks
Computer to 0 to example:If correct D;
1:Analyze in D, put the
Analyze 1 the
the
the
bit of bit bit D, l D, Check =
Hence = of
positionparity parity
parity
1011011. P, P, P, :Write E Substituting 5
is P, word
codeword put bit
Put 2: 3: Hence,
odd.a
EachThe a is
is
even.
Step Hence4 Error
For Step Step Step
Set Set get
3. 4 5
Layerand the
Link bit n be in suitableexample.
error 7.5 to is thatchecked
when
it only the
data of code 2, 7,
free hence the of should error
Marks useddata bits use 1,
(positions
6,
:
requirementsis
CRC not the 5,
in for the 3,
error
errors
result
if
no
CRCdivisor).
binary
(predetermined
be usedof suitable be computer
2015-16, can
parity canin
location is
Create (positions
that should help transmission.
code code
is should + that bits
codeword and be error.
of ?CRC means data is when error-correctionhamming parity
following
the
satisfies
divisor. the with|AKTU codes can
parity its encoded
presence i.e.. there it
unit data also single
It How with working
received rejected.of occur as
requirementsdata divisor.unit then
the
of data but
error-correctionthe two be
Illustrate concept thea
indicates data zero code. can of ain
unit, of to
theby of
to identification
be divisible
the it. its validity
received data powersdata
the of incoming is accepts
hamming OR that an key
should end than division Explain the bit, theetc.).
then
remainder number errors of the The are
it the ? the parity for
if exactly receivercorrection of use been in code:
zero,Cepted.codeword
the onlyto less
bit. the ? set that error the that are 15,
17,
CRC bit 1+ destination, after makes
are same Describe code a
bit
so has one
positions
IN and allow positions
rmander is oneofn remainder
and is correct datait than bit hamming etc.). 14,
2.7.Which
e teroMrresponding if thewhich the hamming code stored.
or
moved
code after single
should valid hasis to 64, 13,
hon Appendingdivisor by unit and
sequence
CRC Hamming
and
to
Hamming more : bit 32, bit 12,
bitsfollows
added
or a
thedivided
be data identify of parity all 16, other 11,
thehee
a Answer Quedetection
the 2.8,. example. Answer detect readUsing
Working Mark
But wil Thebits, is are 8, All 10,
If the
At unit. as
It Que CRC What is extraword 4, 9,
1 2 3. 4. 2 l.
3 2
 codestep
2-11
(CSTT-Sem-6)
B P,
hamming
every 0 0
P,
0 0
and
D,
the each P,
0
1
10
1 0 Calculate
000
D,
0
0 1010
1 101 with Unit-2. using 0
0 110
0 1 D,D,
11
1 1 011
0 00
00 1 1 1
1100101 by
1 1 000
000 0 2-8B,
1 1000
000
0 1 ? used
1
code P,
0
0 1 10
101 7+*+1
>
0 0 10
10 000
0 Page bit +x +1
0
0 10 001
0 00 :
hamming D,
0 string parity
1 101
1 2.8, 13
24> 0 0
0 101 2*>
k x=
4 Di0
0
1 message Q. of =7
2 if 4
is Refer number =
Networks
Computer (k) bit D 1
110 What explained
clearly.
: bit parity
code data
following the Data/Parity received
Code
Numerical
:
2.10. Hammingcheck of of Datacode
code Parity
Answer Number
Number
Que First
for
Layer
Link 1011. we
05
destination
follows: Marks
of
divisor
1
2014-15, right.
as
codeword
anda At
AKTU is
1 0
00 001 001.network.
0 1011 data
2 1010011110 1110
101
1101
correct 10
0 101
1 be
bit
Incorrect
0
111 011
0 00
0 will the
3 0 1
11 0000
1001 overthen
the 000 1 CRC
answer.
sequence 10000
1 1 0 it 000
1011] 0 01 0000
1010
1
obtain 0 000 10 So, send
4
100 10
0 is
001.andremainder
:
errorto [10 1101
1101
0
bit 10-bityour 0
0
is data
remainder
the incorrect
= 1
-6)
(CSTT-Sem codeword Check to
Correct a Given 11
10 CRCitif
6 0 check
the CRC. sinceadd
5: Correct willto
1 StepInvert 2.9.
Que the Answer Here, have
B
2-10 Find
We
 over packets home connected designedhave data the as both any Ethernet between
2-13 faster
B(CSTT-Sem-6) to the
transfer. under
source
at internet purpose. (ISP). stations
the
with
their standard. signals
rate corrected
principle: IP is station
can
act operatemade
them. Provider
are of operates :
of from
duplication
frames.
raw connect cable. data it care elements
a and
at the framing
sends they of has
accept the :
Protocol types takes canIEEE Ethernet
frames transmission
and to andTV
protocol,
workstation
layering workstation
toService
a managing requirements. station and use, basic
to for users modemor three station theof
detected
data
machine end line control secondarycombined protocol,
to ease carry
(SLIP): Internet
ofinternet (HDLC)
following stations. adheres three
network.
send of the telephone
traditional
and primary the to
during
be basis a protocol. link primary
station. of used
prevent
destination Theat controlling every
not
must
connect
bytePoint-to-Point
modem. simple.Protocol
(PPP):an Control
control :A secondary with consists
:A station
Protocol lot data the that
equipment
networking
area medium
must the of A station nearly combined
introduced connection-oriented
flag a a : link
to machines to a server
by
through oriented
have dataprotocolstation
management. system
local
on
done destination
machine. a
used
machine
of
protocol using very
Internet
a
with
used
users
for Link
of and supports physical
capacity the used Secondary
ofa Combined
control the computers.
is is is internet manyHDLC Primary openness,
is Data
bit defined:
been primary in Ethernet
: control
sourceError
Computer
Networks controlerrors
line protocol
destination protocol line to these
protocol
computersis isa
satisfy Ethernet dominant The
the DataLine dial-up the
layer
link PPP
of the Level HDLC the Ethernet
:
Error This The
Thethan The This is Theover This Most The For
Serial a It to High to b.
iüi. iü. iüi.
i. 1. 1.
i.
4 2. 3 4.
Link
Layer its 10
Marks
2017-18; layer. Library).frames that
machine.
layer receiver
Wndow about
Questions network
network
so
called identified
machine.the
and Link
destination
Sliding at
thethe (Dynamic blocks frame
Type layer
to from be destination
Protocol, link 2016-17,
AKTU
on
interface of should data
Answer data form
Questions-Answers
dataprinciple.
layering :layer layer
DLL of
10001 11011 PART-3 transferring
via the frame flow
110000100100.
LinkProtocols). servicenetwork the
-011 Medium the network place in the
- -011 data eachby
- Data in prevent
recognized
11) 11) 12) issues a thetakes sends
machine.
of
9, 10, 12) 11, (Elementary and as
is ending
the to
act service Frame
synchronization
:
7, 7, 7, 10, : always machine to
5, 0 6, 0 5,6, =0 0 isof1100101 Type the are machine
of to layer destination
be done
3, = (2,3,= 9, =
basis and
-(1,P, P, -(4,P, (8, P, issues
provided can
(CSTT-Sem
-6)
2-12B So bit-So So - So Answer Discuss linkprinciple
transfer
sending source starting
is
: control
frames
Flow
control
bit 2 4 bit 2 bit 2 Control the
= layer data
at = at =
l's at l's at = code
l's the
checkl's check checkof
check
of Hamming Flow
Long 2.11,on TheTheon This The Thethe
Services
to
Flow
end.
of of protocol Answer
link
NumberNumberNumberNumber
P, P, P, P, Que Data i.
For For For For 1. 1. 1.
2 3.
 a frame sendingnot
accept
must an windowinclude
windowThereceived frames where
B new
2-15
(CSTT-Sem-6) but
ACK. without control. protocol.
of shrinks.
ACK to the before implement,
numberreceiver frames the to of controlwillingness
acknowledging protocols.
that an expands
number
in
received
windowbefore spaces flow flow frame wait
a
by of
the
in acknowledged number window to and Receiver
allow transmission, received the for of
its ACK easy wait
receiver areofnumber
frames. techniqueform indicates stop
frame
to the frames theto the and the Fig. and
2.13.1.
expands
for not be
equal simplest understand 0Frame 1Frame
ACK receives
framesspacesthe still
represents the sent, receiver of
operation 0ACK 1ACK stop
three
of of may returned,
is frames wait an of
window beginning
size acknowledgement theframe. back it drawbacks
of -1 that if and the until to
number w, is Sender
n thetherefore of dataframe,
technique sending simplethe
the but in, framessizebeing numberstop wait illustrates
the frame.
arrives, framescome the
atransmits
theAt of acknowledgementDiscuss must is
Networks
Computerto :windowframes of
window window acknowledged. by technique State
wait receiving data efficient.
very
number ime
frame
received.
justsender
equal -1
ACK an a 2.13.1
as for and
n receiver is soonplaces senderanother next 2.14.
an framesnot new be a
Given-3.
thesent. w 2.13. Answer
Once Receiver
contains Stop After ThetheThis Fig.
As but As Que
Que
3.
5.
2.
2. 4.
1 3
Layer
Link
fairly bits
each transmission
on time which on numbered
nextof ACK all maximum window
the since window
05 frames receipt that required.
of Marks based
in to a the an of
at and transmitted
embeddedset
computers
standardized 2017-18, sender scheme knows boundary
sender's the
the transmitted of thesends
are number a is in
data hold
they acknowledge therefore, acknowledgement
by identification receiverit left
rules
multiple AKTU based that sent means the
5, theleftwindow.frames
been
channel. number transmission,
a protocol.
protocol. packet boxes are includes end; the
control of system.
consists framesbeen which to the received.
have
of
out,the number
allow
Ethernet imaginaryneeded.have an example,
4, the either frames
of sent
access the windowwindow feature multiple introduces modulo-n,
it frame with an Window 2.12,1.
ig. of
that that ACK, at size
over
OR frames before
beenframes a
of arethe three the
shared
interface is For ACK
medium framedata a an side. acknowledgement an in have
beginning
frames then
slidingsliding is to method,which windownumberedreceive. ending
-1 sent shrinking
if
protocol receiver sends 5. an
w, acknowledgement,
theEthernet
carry refers window. number
sees4 n be
(CSIT-Sem-6)
B
2-14 of Ethernet
to 2.12.Explain window receiver
to frames number holdmay theAs
size
on of
set access to windowwindow
and trackslidingare expects sendercan frames.of
At inward,
An used note the 1. the frames window
A sender to window :
protocols. of containing window
-
frames
short SlidingSlidingsliding
an keepreceived,
of n
to the string
theframes
up 1 moves
Answer before size Whenit
frame When 1 - a last3.
The-n
C.
both 0 containsn
To theThefrom Given -
Que Write In
a of Sender windowthew
is
2 3. 4. 5. 6. 7 8 1.
 conditions: Theundamaged discovers
undamaged, and data
2-17
(CSTT-Sem-6)
B it frame, shows a receiver,timer
error,
intact, when negatively.
0. lostacknowledgement.
data 2.20.2 time its
an last receiverarrives frame. the until
arrived arrives the
contain
the frame: to
certain Fig. every retransmits
retransmits or frame
data it positively
0 The 0 Error
in frame
O transit. makes
to data It data starts
data
under receiver 1. Receiver Time ofa NAK
0.
data data time never an
: a the in loss that it, or It for
frames
protocol sender
transmits NAK.
frame:frame: lost again.
indicating This frame
the timer ACK
acknowledge waits
the 2.15.1.
Fig. be
by the 1. 0.
ACK0. a
Data0 canhandles
frame: an
a Ifthe for tries
damaged next returns 0Data and
discovered data next data 1ACK1
Data
0ACK -NAK O
Data1ACK
of 1,
and sender 1. types with
operations ACK its returns
expecting its ACK
retransmits ARQprovided waitsit timer,
transmitted.
frame
transmits and
transmits lostframe never point
returns
of thean 0 of wait device its
which
caseis NAK returns receiverdata
casethree can restarts
frame example,
now
Computer
Networks
the in sender sender
and is is receiver
sending
a in sender
receiverSender Time
frame
in thestop sender at
a returnsreceiver
areOperation is the error off,frame,
When it Operation
of
Following For and Theand The Thethe Anyhow Thedata the Thegoes
an
1. 2. 3 4 5. 3.
2.
a. b.
Layer
Link last might
other packet
transition.
sending 2.5| to flow until areby of expected
which period,
and
thesome acknowledgement
technique. 05
Marks Marks extended frames
1s been
andidentification
acknowledged
senL.
recent basic transmitted
frames. transit
0 hasreturned.
frame
frames,
NAK
between before data time
in 2017-18, the ACK it an
or 2014-15, control that in
crash, other is
frametime control damaged
to the last
If allotted
lost
occurs added frame and gotfor indicating the timer.
some ARQ.|AKTU
AKTU flow frame.is was
system one trip frame
frames allows retransmit
transmission.
receiver
onlyround error
that delayed an
:are
of
acknowledgement waitor are last
lost that a frame
within
storage
crash, moment, ARQ featuresthe dataO data numberingframe, with
protocols one andof the data
long case of for both
purposes,
A that
is to
equipped
received
least stop copyacknowledgement dataNAKframe
sender last
or disk waitOR wait in four
1. duplicate
processingaside,
subsequent
one
at of data a
and This
indicating a the
wait any wait and and form work, keeps 0 in the
senderprotocols.
as alternately discoveredis not that
1.
consideredat to stop stop of
a retransmnission
device identification
of a tell
datacase transit,device is assumes
2-16 and
(CSIT-Sem-6)
B to
as have
inefficient on
is to
ARQ retransmission
control
mechanism:
For
1frame, acknowledgement
numbered,
stopduethe on Discuss an expecting
in
wait sending sending sends
itagain.
suchtimeout pipelining.
anddisaster. No will note
receivesnumberedframes
is in
of lost wrongly wait corrupted sender
error
Drawbacks and sender ACK
is backup very short not
After stop 2.15. andinclude The nowdataan
AnswerData
it an If are The the
be in is Thenext. a Answer
Stop For
It Que Write
1. ii. 1V
2
3. 4. 5. 1. 2.
 last ARQ :condition
and from receiver. the
2-19
B(CSIT-Sem-6)
05
detected frames
Discard Retransmitted
Marks the wait retransmission in
since due damaged
to
Error treated
frames
andcontinuously. 2.16.1. the frame
2017-18,
sent stop certainis by
discarded Receiver also
are error
Fig.
is
Timeframe.
of
AKTU under in starts
framesinefficiency frame
frames theshown frame.
:damaged
so are
transmitter data
protocol lostdamaged
all
retransmitted.
the damaged,
as 2 23AK
Data damaged of
ARQ. damaged, frame
the back case
lost:
transmit
3 3 Data
OR
Go-back-N overcome is signal
of the after 0Data 1Data 2
Data Data
4} -Data
2 Data Go-back-N, thethe
frame
is
operations is
is frame signal,received 2.16.2,
frame to NAK-2 frame of
are that
to transmitter
the
on oneacknowledged
used data this Fig. as
2.16.1. awhen
when send frames
Networks
Computernote if
the second receiving in manner
methodis Sender shown
method receiver
allowingOperation Operation
short are frame
2. the TimeFig.
The On All Retransmitted
Retransmitted
Retransmitted same
thisframe Following As
Answer This
aWrite In by ii.
1. ii.
1.
l. 2. 1.
2.
Layer
Link hasACK retransmits waits
lostreturnscopy
andthe the newand
receiver If and discarded
Second
copy
Buttransit. frame. theit
acceptable. discards
then copy recognizes
Receiver
Time
the in off, datanew Receiver
acknowledgement
: to
lost goes
newthe then
Time
protocol.
0Lost
Data it notis receiver
timer theaccepts receipt,
2.15.2.
Fig, made receiver
or
1ACK acceptable of
Go-back-N
has its
until number
0Data receiver itacknowledges the
framethe ACK, -0Data
1ACK 0Data1ACK
by waits
returned
lostdataeither the
checks thean
theACK.
appropriate
of device NAK, was frame.
(CSTT-Sem-6)
B
2-18 Sender casethebe
to frame frame.
data
the duplicate,
frame
the
Time
in found sendingreceiver
case, a next Lost
Describe
Time was
out Operationthis NAK
lost
been The Theframe thea the Sender
In Time
or If as for 2.16.
out ime
1. 2. 3. 4
Que
Ce
 retransmitdata 7.5 casewithoutadditionalframes,
is in the 07 whichthe must frames
B more
(CSIT-Sem-6)
2-21 retransmissions
frame attains
Marks the Marks in
forshownsenderNAK
no Go-Back-N W,
has are:in
through those sequence.
and 2016-17, through so transmitsatransmit Go-Back-N 2018-19,
ARQ. is theframes. post
transmitter
off protocol and P)
-(1- onlythis but
getseconds. the
goes for
|AKTU frame
error,
Go-Back-N
of repeat AKTU retransmits expired,schemes, storeproper
out-of-order
timer issues
frames
numberto
9Wf -1)P,
(W,then brief.
link in required selective
the
the
a
get10 n,lRis =tt: 1-o 0, 1-n/np in has ARQ tospace in
frames
performance datato t,= frame required, by technique,
or
till
reached in average W, tPj-P.given 1+ =
teBN
retransmissions. toRN P, scheme
timer send
the storage
takes
Go-Back-N time
which among reinsert
wait 1 takes is namely, OR
where first that on
average haveGo-Back-N
is can
taBN ARQ
beenmust that therequired.
it transmission are
retransmissions
is the
retransmission R error-free,note
it have
is, we control repetitive
for efficient
that to
again.the
hasittransmit topv that (0.9) and example, =MGBN efficiency,short
or
mustpower
limit Illustrate for time 0.1, P. t, 10 total received so
complex
als0processing
Computer frames
Networks all
the issues probability duration
is, for is a error most
first
1lP,= Go-Back-N efficiency channel Write
possible selective
theto the thattheis: the receiver
frames protocol.
link Performance The atime Therefore for
/(1-P),
ARQ are2.18.1.
Fig.the
Once
2.17.
Que
Consider
where of the 2.18. Explain Answer NAKs is more
Answer error.With Each each ThusThe best The This Theand
If be
ii. Que
1. 2. 3. 4. 5. l. 2 3
Layer
Link Retransmitted sends
the casean allows
arerecieved
frames all expect
frame
Discard frame
Discard retransmitsInacknowledgement.
itframe window
not
Receiver data frame.the
acknowledged.
frame.particular
Time
:lost does
transmitter
Receiver
Time
as
is transmitter
acknowledgement
frame. ACK frames
data acknowledgem
lost lost
lost
theframe for data
areceive
Go-back-N, 0Data 1-DataACK2 O
Data1-Data
manv
Go-back-N,
0{Data1Data 2
Data 3Data 2NAK 4Data 2Data 3Data 4Data and
condition
every the as
nottransmitter
last method send
after
2.16.2.does the the acknowledgement
Sender Lost
2.16.3.
canan
sincetheshows for
(CSTT-Sem-6)
B
2-20 it
the when
Fig. ifreceiver, Go-back-N Time
Retransmitted Fig. transmitter
waiting
sent
Sender
Time NAKto 2.16.3
Operation
Retransmission frames before
The Fig. The
a
of
u. i.
3.
 2-23
(CSTT-Sem-6)
B LAN. different be connected many (FDM). Division
timeavailable allocation.
to
to is amongfixed
connected channelallocation. Multiplexing Time
two users allocation a entire channel
channel,or
sublayer: sublayer: the band and
other
communication the (FDM) static
directly channel frequency
802Standards
of IEEE
Scope
are channelsingle either
Division
The
What Multiplexing
of
Thusshared.example
(MAC)stations
media.
as
time.
for a
allocating
(LLC) allocation. called Frequency
fixed
Fig. model.
2.19.1. operations. ?allocation
channel a used user.
controlMedia
Logical
link access
control the
reference
model to to
Control at
single is a itimes
each Division
IEEE
802
Control
reference addressing userThis allocation
channel
Static
schemes either are
(LLC)(MAC)Physical Medium access of
layer thetransmitting way of entire (TDM)
control channel wait. means
methods
to
Access
of Link network, traditional allottedFrequency
802 controlunique
different
should or Multiplexing
IEEE of Logicalflow
Detection
errors. by bandwidth
Computer
Networks Media Explain is these
the the theUser
Error
addressing.
recovery. schemes
for
used broadcast two is
TheusersIn slot The
onemedium
as
called perform
performsof performs to
of are
allocated
Functions Functions 2.20. thisThere
ii.
Answer
a ii.
is
It To It It Que In to
2. 1, 2. 3. 1. 2. 3. 2.
Layer sequence
Link frame broadcast
important
only uestions
of for a
track Networs is
NAK it sublayer.
in
LANs
sublayer.very
keeping Type because
Receiver
sends
0ACK 1
ACK 2ACK 3ACK 4ACK 2ACK 5ACK 6ACK
Area
MAC
and Answer
while 18.1. Allocation.
Channel Questions-Answers
Local control
menmory 3FRAME PART-4 of
receiver FRAME
0 FRAME1
FRAME
2 2 5FRAME
FRAME
4RAMR. FRAME
6 and Medium position
access
in Control
damaged.Sender
theframes the
ARQ,
0
for 1 2
3
send sernd and medium show
for for 2
for
Time-out
the time time time 0 1
frame
2send Access Type
for for again
-6) repeator Set time time is 2.19.1,
buffers
(CSSIT-Semmissing Set Set
Explain sublayer
Close Close Medium Answer
selective Fig.
numbers,
is MAC network.
which Long 2.19. Answer
B In The
2-22 Que
4 1.
 uses It
corresponding successful transmission
is the then frame, complete one to
encounter protocol
to MAC 2.
collision. data afor
collision frame,
if thesends then It
for usedCSMA/CDis 1.
strategies. period nothere
is 3.
Ethernet. traditional one line thesenses Then
it
CSMA/CD: Uses
of zero. parameter persistent the of using 2.
to 1 ready having station The
degradesperformance lts backoff the sets frame l.
when 3.
added. stations
are moreexponentially procedure: CSMA/CD
networks. for
largeappropriate not is It 2.
collisions. of stations
are other transmitting.
thisThough
until
no
transmissions carrier-sensing
defer to uses It 3.
it
not doescollisions, detectsalgorithm 1. place. taken has
number threduce
e
CSMA/CD :Disadvantages of collision transmissions
after
a only handles works
to protocol CSMA/CD
attempted. be
can retry beforea 2
as attempt
to devices simultaneously. channel data usea
required the
timeshortening detected,
thus collision
is aassoon two when respond devices network determine
how
transmission terminating performance
by CSMA improve used
to is It 1. which ofrules sDetection
et Access/Collision
ais Multiple Sense Carrier l.
CSMA/CD: Advantages
of
CSMA/CD:
procedure. CSMA/CD 2.23.1. Fig. Answer
Success Abort
CSMA/CD. concept
of Explain
the 2.23. Que
NO | lYES
signal backoff Jimit? utilization. channel used
in is It 2.
Collision jam Send Increment Backoff frames. databetween collision avoid to
used is It
YES 1.
CSMA/CA: of
Uses
NO
consumption. power high has It 2.
frame times. waiting long for algorithm
calls
the Send The
time CSMA/CA: Disadvantages of
backoff Wait
strategy
transmissions. wireless forsuited much very is It
Persistent transmission. wasteful avoids It
unnecessarily. acknowledgements, 3
lost not isdata toDue 2
zero to
collision. prevents CMSA/CA
backoff Set 1
CSMA/CA: Advantages
of
START collision. theavoids
completely CA
CSMA /
again, line the senses and time backoff the for waits
parameter,
backoff increments
the thiten expiry timer acknowledgement
thebefore
expected threceive
e not does station
transmitting the ifBut
Ethernet. traditional the for usedCSMA/CDis 7.
7. successful. transmissionis
transmission. the then time, the expiry
of before received
acknowledgement
is the If
aborts
the station the then limit reached its hasbackoff the If 6.
6. receiver. the from
again. frame the sends and time backoff
random afor
waits and timne backoff increments
th e
acknowledgement the for waits and timer setas frame,
it sending
the After
then station The 5. 5.
collision. the about stations other the
inform frame. the sends and timerandom more some for waits then It 4.
signal
to jam
the sends station collision)
the event
of the Otherwise (IFG). Interframe
Gap an
(in 1.
(CSTT-Sem-6) 2-2B
7 equal
to time foar waits station the idle, be toline the finds it as
soon As 3.
Networks Computer Layer Link (CS/IT-Sem-6) 2-26B
 2-29
(CSTT-Sem-6)
B
of
preamble, contains 10101011)
timing.
receiving tellsthe is nextits sixthe routerbytes the
format field on allotted
Questionsformat. SFD with packet's forward of
(DA) encoded recent twolength
bytes
CRC
input
The 4 preamble, The
byte: starting
frame :fields
the alsoto next
CRC. 46-1500
bytes its frame. Address
alerts thepattern device most These the
synchronize
(one is
Type seven Data
data, of field If
sublayer the the address the PDU.
that field the Destination last
(SA) or
(PDU):
Answer and2.26.1. frame, bit
containing l's of
second is thestation coming
Questions-Answers follows physicala address
frame Length
PDU bytes andto beginning is of
Standard.
LAN MAC Fig. 802.3 address address Unit
PART-S 2 it
Medium in
O's enable
(SFD):The sending
the
802.3 frame 802.2 2.26.1.
Fig. alternating The source Data
shownOs. (10101011)
bytes
the
that the packet.
and the physical
(NIC). physical in
6 :
everything contains bytes
and IEEE of PDU, and of at (DA) (SA):Thethe Protocol
is ls address
Destination field frame signals be the
type CSMA/CD alternating
flag bytes
Delimiter Address Card
system's
Type the of of
first and thecanforwardofnumber
onelength/typedelimiter,
6 coming
bits) device
frame
that Interfacecontains
Address of
Networks
Computer Answer Explain specifies ofbits SFD bytes The bytes
field
in Preamble:56
(56
the FramereceiverDestinationA and LengthType
bytes 802.3 six destination. Thatreceivethe
1
frame Start Preamble :Preamble
to addresses. Network and
Long SA,
2.26. 802.3
bytes
SFD: system the allotted Sourcepacket. indicate
AnswerDA,MAC 7 seven Start bytes
Que of the to
SFD,
IEEE
the
1. 2. 3. 4. 5.
protocol.
different controls transmission
and : for system the transmit, transmits in
Link
Layer 10 protocols finds
it
Marks contention then
if reducedtransm
sharedsensing. it and
(CSMA) they2017-18, that
the andtransmitting)
channelto then to
collisions frame wants is allowed
method retransmissions
theaffect
a carrier
of idle.
on presence
Access are participants accordingly. resolves the
and
which becomes
HowAKTU basic of
a
not transmit
is idle not
Unit-2.
Unit-2.
then of
principle station status station are
Multiple protocols. a
the
it
does is
it stations
channel
is different
2-26B, as and CSMA. and
(CSMA) seeact 2-24B. to other until
medium.
transmission
decentralized protocol wantstime.the the
theto to
multiple checks scheme collisions
SenseOR on
decides PagePage
listens are
collision (some
of
transmit.channel waiting
the
sense Access protocols of station
interval as
operates protocols collision types
Carrier station
and
2.22,2.23, busy again
Non-persistent will the
:CSMA
this suchthe soon
p-persistent
CSMA.the
carrier
?
protocols of
Multiple
communication any a CSMA:n
the if is fixedit it monitors all as
(CSTT-Sem-6)
B
2-28 Explain protocolcable Q. Q.
ReferRefersense
fron1 channel
scheme, time,
P-persistent
CSMA:
of
simultaneously
a sense without Explain free possibility
scheme,
different protocol,
the for
Sense CSMA/CA: different
carrier
CSMA/CD: CSMA:
of
Types thisis
collision CSMAon carrier thewait channel
this
1-persistent
continuously
immediately. this
Carrier (carrier) channel
performance. After
2.24.
Discuss Answer this 2.25. Answer In thatwill The
In
the The Different areis
Que than In
HowCSMA Que 1. 2. 2
the
2 3. 1. 2. a. b.
C
 dataaddress.tokento transmit in IEEE station
monitor
2-31 2.28.1
B(CSIT-Sem-6) allowed transmnit Token
802.5 designated
A fiber
and
maintenance.m
optic.
Twisted1000
pair
Mbps
its
token performs
the 802.5 Ring 5000
bytes
By
Fig. transmit
destination to 100
in 28.1 is toopportunity
passes
frames.
to RingRing m to
shown passing. station chancesand 50 4
2. can it m
Fig dataover, Token
802.4 maintenance. 500
081 onlyand it. 802.4, Distributed
By algorithmco-Co-axial
as in That to
ring shown token :
these
source an of assigned Bus token pair,
Twisted 10Mbps 8191
provides to bytes
follows
token is number802.3, m
156 station
sequence.
get Linear
a receive Ring m200
form in will
as topology thecontains chance
Random
topology
stations as a station
moreis between Ethernet
8023 axial 100
optic
fiber
place
holds to of address maintenance 2000
timelogical to 1500
030 Physical which
taken frameready
each
get Bus central
No
to
Mbps bytes
interconnected
bus transmission canone Linear
950 are the operation, Differentiate
Every
None m
50 10 Mbps
station
istopology
2.28.1. bus stationstationsin now. than
128| :control
token station topology
Physical
topology
Logical structure
Frame
Networks
Computer bus. data more Parameters
Fig. the same Maintenance length
CableFrequency
the of used
Cable
thephysical of time, the other
its cycle if
Contention
Logically access
operationon as next transmit Thecycle standards.
thesoon
any frames the one once.
2.29.
Que Answer
The Media At All As to one
In
The S. No. 1 5. 6. 7 8
2 3
2 2 3 4
Layerother and detectionDiscuss. in ring received
Link
the Thetheas transmit
theexpiry
to be a5
shown
for bytes) the delay. by of number
ring.
time must known
base operates? to the controlledlocation the
(0-1500error as Interface
Ring fixed frame
is connected
some (RIU)
Unit the logical operates?is
a which
regenerates before
(MAC)
as the round
physical can getsa token
or Data after is
tvpe, contains LAN system transmnit) on
other
onlybut
station Control
stations station dependentframes the
indicateparts 802.5 it the token THT,
LAN
ring therefore the on
two frame every 802.4 Access
standard of next will to dependentthedata the
to into token (RIU).
number not
used CRC-32.
802.3 the who station Thus After standard
of more
up repeater; token. is station. Media
a Unit to It possession
be IEEE is 2.27.1.
Fig. (i.e., or (THT).msec.
split the
LAN
a them :(MAC)called one ring.
is
can a Interface for
in case
of medium passingsystem.one
from other IEEE
field be
canbytes). in consistsa sends
&802.5
the
Time of
transmit
10 standard
(CSTT-Sem-6)
B
2-30 (0-46
padding
field
this does basically
Controlframepassedto
in
is
this field token bus is
connected some does
lastin Ring and
standard the
How data.time
which Holding
transmit
its
fixed. This The information, It
2.27.1.is frames to control
is
token
may thisto How
802.4
protocols. athrough
RIU Access ofsequence
access token over
isPDU :Data CRC: 2.27. Answer of station
It Token Typically IEEE
token
bus.
IEEE special stations handed
Fig. Thedata case frames. 2.28.
Que The The
Media Answer
in A of
The
Que
7. 1. 2 1. 2.
3 4 1
 2-33
B and 10
(CSTT-Sem-6) maps corresponding
isbit a
transmitted calledbetweenend so
in Spanning bridges. and
FDDIMarks strategy.
and l resulting Questions
Type
Answer the
logical nodes, D,
connections
to
iin 2016-17, codes
Unit-2. and connected C,
then
a and B,
implemented data.encoding (1111) bits,
NRZI, interlinked A,
bits are Bridge switches labeled
data
AKTU of 2-32B, temporary andV.
four F codes
transition are
group lettercodes using
sequential
(LearningQuestions-Answers nodes are IV,
in of
coding data the
bit Page Tree
Algorithm). layer series switch. devices)
in five PART-6 creatingthese III,
in used for Medium link network.
codes. bit five 2.30, telephones). II,
routing.(communicating
schemetakes code These
a labeledI,
line is five Bridges of
the
every Q. on of of
methodbit data consists to some switched
how NRZI scheme
:implementation
five
transmitting
11101. Refer and note capable
linked
bit once and for
network, are
corresponding FDDI: or
about use 4B/5B fourencoding
encoding least Switches
Type short network
devices
devices only
(computers switches
a
Networks
Computer format.
describe
its coding
scheme, the By at transition.
signal Answer Write systems
usedshows
Brief for switched
example,
bit using
NRZI.
transmitted are more
line 4B/5B five format Layer : switched
Switches are 2.32.1the
Switches systems end
coding switches. Others and
2.31. Answer this to
FDDI them
Long 2.32. or
the
In
The For Frame Link
Answer twoa Fig Theon,
In
to A
Que Line Que
3. 4. A. 2. 4. 5.
2 3 6
Layer detail
Link in alternative access
protocol.
starting
the addresses fome with
: ring.
bytes.
identifies svmbole
allotted bvtes laver
(FDDI) network 1.5bytes
bytes data token
1.5
speed
FS frame's
first. source 4 of
ED 0.5 data.of thephysical
T
two of consists
its consists
Interface
Data areahigh the frame in that
sent
within Information and of byte or
Datalcommand
CRC is bytes to
a
localprovides be field the destination theframe and
similar
CDDI. 4
fielda in
half
candata arfeme
a
is LLC
data
unit ofthe of
byte
4500
The
changed
datalcommand
Control 0-4500
bytes of is
(FDDI) as it time
to : consists field:
bytes.
Distributed and known as 2.30.1.
Fig. datalcommand
frames byte secondthe up (CRC)is
format. Mbps
Interface tine. real SSAP aresix carry It FS
first field
frame. FDDI
is that address fields
to
The Check
100 ring.FDDI
by many DSAPDestination|
Source bytes
2-6 The twocan the
(ED):This
framne provision
limited two in (FS):The
Fiber
2.30.
Define Dataof |
:
(SD):(FC) of frame token the
rates
token
of as address nextconsists
symbol
Redundancy
2-32
(CSTT-Sem-6)
B version send in
its Distributed
data is 2-6 bytes data
the
only
and access the Control
Delimiter The the
token
frame.
of may ED Delimiter
in violation
Status
help supports
Ethernet
copper withFrame
format
: 1 Token byte byte
address
Addresses:
Each Itincluded
SD
FC frame
type.
station
FDDI, SD
FC l Frame
fields
:
1
: Cyclic T
with Answer
the Fiber period, byte Frame full Frame
Start
Que FDDI:It The 1 flag. EachData Enda one is
to In A 1 or
1 2. 3. 5.
1. 2. 3. 4 5. 7.
 updating network.
C, now D,
for lport
from sourcelookup) for entry
2-35
(CS/IT-Sem-6)
B
entry
destined destned to
learnsthe C second
(tabie
for to the oiy
frame first
and and loods
graduaily decision framesits iramesits rame
Port
Addres
destinationto
the
tabie with sends
has
2 frame has the
that forwarding back D
that tabie that tabieforwards
After 1.
port
through 2
C the port
means
bridge the entries replies e. means The The
D. ports;
233.1.
Fig. or through
both the Addres
Port tabie. tabie.
it
C three
toC. This
a adding Bridge senda
D This so
need D either
its C,
to
for
inspects and 3
C its
frame 2.portout to tor
rame 1. out
we used C
After
all port to
used
for D for from sententry sententry entry
to b.
a D.
dynamic. is entry on fromon
address
bridge frame D. sends
the
frame
movements Port
Address
out is be thisby is be thisan
address
is D. C must D must has tlooding
framne
received
Networka
Computer
table the destination sends Origunal to no goesthat adds and that addsbridge
has
frame future, generates future,
this, B
bridge
notes
frame
bridge
seesnotes bridge no
a source C
make addresses.purposes.
Suppose sends is theis
do Example: the Frame Bridge
theBridge
Bridge
the
in There
The The The The The Now
To To C So in D
10. 11 12.
5. 6. 8. 1. 2. 3. 5. 6 7. 8 9
4
Link
Layer LANS bridges.
MAC on bridges.repeater
based
H
multiple the
E twowith framesof a
G LAN
4 presencelike setup.
3LAN by static.
connects do
connected strength
D to forwards bridge
table.
automatical
F has of
devices. bridge. were
G
IN which B2 it
unawaresignal dynamic
thatduring
are ie., selectively
D) links. learningtables
self-learning
H 2.32.1.
Fig. 2.32.2.whichframes,
Pig.
the
entered
device are a ports
multiple 2LAN boosts
signal. is
LAN's address.
and hosts forwarding
table
LAN. Bridge Ethernet on to
layer header id.,andbridge
the note manuallyaddresses
to static
four IP
connected
linklarger MAC regenerates
plug-and-play
transparent,
destination
address.
the
are forwards
frame short
the had the
34 B
(CSAT-Sem-6)
B dataa than level was maps
there bridges to
form examines a solution
is a entry
rather physicalWrite tabie
A switch are to B 1LAN 2.32.2
and
are are
compietely
eariest
:Bridges
Bridges
together table
stores Briages
Briages 2.33. Dynamc
better
Each Fig addressalso the
In It At or TheEach
Answer
lt Que A
B.
1 2 3 4 5 6 1 2 3 4
 the
suitable its link they and
2-37 thereceived
by
B(CSIT-Sem-6)
in questions about data FDDI
of are
part LAN
with Go-Back-NHow
as and in
notframesother
protocols.implemented
well working protocol.
are QUESTIONS
IMPORTANT
VERY
These layer
principle.
any EXAMINATION.
UNIVERSITY
as ARQ.
the bridge.
that to SESSIONALS
important. link ARQ. for
block LAN its windowwait
ports created. issues ?
protocols
layering
Explain data Go-back-N sense learning
which any and coding
those
the sliding stop performance carrier
ports, from
are very collision
?
mark loops
path your code in of on line on
blocking are basis on format.
its
describenote
hammingissues note note note
No on different how
also single in
questions than
system. asked the short the short
We short
Q.Refer 2.16.
Q.Refer 2.15.
2.12. 2.17. 2.24. about2.31. 2.33.
the
tree,
Networks
Computer one 2.8. theon 2.11. short Ilustrate different
receives. example. protocol protocol.Discuss a Q.
onlytree be is Q. DiscussQ. a a Q. Q. . Brief Q.ReferWrite
the
bridge.spanning Following
may What Refer ReferWrite Write Write Refer Refer Refer Refer
spanning
is
bridge There
Q.1. Ans.Q.2. Ans. Q.3.Ans Q.4.Ans Q.5.Ans. Q.6. Ans. Q.7. Ans. Q.8. Ans: Q.9.Ans.
9.
Link
Layer systemrepaired
transparent undesirable.
to intopology
path physical the eacharc. so The the
algorithm the the rootcreates of
ID part
frames. one by with withLAN, that
the represented this the
is algorithm. through of bridgepath from paths areframe
make one a becauseone. cost
(metric)
to broadcasts
forwards system verytree creating steps: or that
?
required failed physical tree). bridgeshortest
spanning The (a cost a
ports
to forward
is LAN system three thepath total
the bridgesthe which tree means
is
nodes.
versa ID.
bridge other
bridge
in until other the of shortest the the
smallest
is the spanning
system, the a involves (root the which
algorithmbridgesredundant algorithm
any overlay
as vice assign
Each every of mark
the over use of bridges.represented bridge examining
combination
from topology and the the we ports,
as
continues redundant takes thebridges that bridge to treeID. has find
to
tree,
on built-in bridge
have in treereached andtopology needspanningroot forwarding
tree bridge note physical one to spanning
problem,
loops u we thetries by The
spanning to topology. spanning cables are to
tree, a which
rootfound
learning no desirableanothercreate short be present. LAN
bridges has as
algorithm
the
destination.
logical the selected
are looping can thebetween spanning know
bridge be thethe
(CSIT-Sem-6)
B
2-36 fine.
work
bridges a LAN, change a
of
find from
there can loopless LAN loop connecting
arcs. to Every can tree.on tree,
the
shortest
of Why morefails, RedundancyWrite
is reliable. a andconnection bridges
is Based
process replaced.
or the bridged create
connections Thecost)paththe spanning
As itHowever
as
long bridge each no cannot LANs theprocess ID
2.34. Answer solve
a is 1: all smallest
2: shortest to
shortest 3:
create
2.35. which we Both find
To Step Step bridge Step
The Ifa To a only.There
Answer
In We
So The The that the
Que Que
13.
2 3 4 5 1 2. 3. 4. 6 7 3