Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
q what is sliding window protocolsalternatives sliding window protocols - one task begins prior to the other one ends
q illustrate the drawbacks of stop and waitdrawbacks of stop and wait - only one frame is able to be in transit at a time- after every frame sent the
q explain stop--and--wait automatic repeat request1 numbering frames prevents the retaining off duplicate frames2 numbered acknowledgement are needed
priority and reservation higher priority stations may possibly access the token sooner each station has a priority code since token passes by
q why we use numbering frameswhy numbering framesstop--and-wait arq 1 numbering frames prevents the retaining of duplicate frames2 numbered
token passing - token ring ieee 8025 needs that station take turns sending data token passing coordinates process token is a especially formatted
q illustrate stop-and-wait automatic repeat request- simplest flow as well as error control mechanism- the sending device keeps a duplicate copy of
q describe flow and error control mechanismsflow and error control mechanisms - stop and wait arq- go-back arq- selective repeat
q show the use of flow controlflow control denotes to a set of procedures used to restrict the amount of data that the sender can send before waiting
q what do you mean by flow control- how much data sender is capable to transmit before receiving the ack- why flow control- limitation with receiver1
q error correction in burst error correctionerror correction-burst error correction in its place of sending all the bits in a data unit together we
when an error is discovered the receiver is able to ask the sender to retransmit the entire data uniterror correction-forward error correction a
q what are the error correction techniques error correction error correction techniques retransmission forward error correction burst error
q show example on check sumdata 10101001 00111001computing checksum 1010100100111001---------------sum 11100010receiver side
q show the steps used at sender end by check sumthe sender follows these steps the data unit is divided into k sections each off n bits all sections
control frames for lost tokens if station goes down token lost predecessor listens for data frame or token noticing none retransmits token sends
error detection- check sum the checksum generator are subdivides the data unit into equal segments of n bits usually 16 these segments are added
control frame claimtoken consider first station turned on station notices no tokens sends claimtoken no competitors so makes a ring of just itself
q show the crc-performance crc-performance crc is able to detect all burst errors that affect an odd number of bits crc is able to detect all burst
lrc - performance detects every burst errors up to length n number of columns if two bits in one data unit are damaged as well as two bits in
control frame setsuccessor station x wants to leave successor s predecessor p x sends setsuccessor frame to p with s as data field p changes its
error detection- 2dlrc adds an additional character instead of a bit a block of bits is prearranged in a table the parity bit for every data unit
q show the parity check - performanceparity check - performance is able to detect all single-bit errors can as well detect burst errors if the
control frame solicitsuccessor periodically ask for any station to link by sending solicitsuccessor token with senders addr and successors addr
q explain types of redundancy checksparity check simple parity check two dimensional parity check longitudinal redundancy check lrc crc cyclic