L4 Flashcards

1
Q

draw basic diagram of communication channel (L4 2)

A

write on paper

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

define entropy and write equation (L4 4)

A
  • measure of uncertainty of a discrete random variable X
  • entropy is measured in bits
  • example: entropy of a fair coin toss is 1 bit
  • more uncertainty means more new information is transmitted (my opinion)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

calculate entropy of a binary symmetric channel (BSC) (L4 5)

A

write on paper

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

define joint entropy and write equation (L4 7)

A

measures how much uncertainty there is in the two random variables taken together

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

write equations of mutual information and channel capacity (L4 8)

A

write on paper

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Main ideas of automatic repeat request (ARQ)

A
  • technique necessary at receiver side to detect erroneous frames based on error detections at the DLC layer
  • received frame from network layer is appended with control bits at header and trailer to identify erroneous frames
  • receiver side request retransmission of erroneous frames
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

draw frame structure at DLC layer (L4 12)

A

write on paper

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

list types of ARQ

A
  • stop-and-wait
  • modified stop-and wait
  • Go back n
  • selective repeat ARQ
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Main ideas of stop-and-wat ARQ

A
  • assures each packet has been received correctly and then acknowledges the transmitter to transmit the next one
  • if frame is received erroneously, receiver sends negative acknowledgement to retransmit it once more
  • transmitter might receive ACK too late causing problems or to retransmit a wrong frame
  • receiver cannot tell wheter second frame is a retransmission of packet 0 or first transmission of packet 1 (major drawback)
  • solution is to identify each frame and use a counter in the receiver
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

draw schematic of major problem of stop-and-wait ARQ (L4 15)

A

write on paper

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

main problem of modified stop-and-wait ARQ

A

channel is not used optimally and there will be repeated frames

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

main ideas of Go back n ARQ (L4 20)

A
  • avoids transmitting ACKs or NAKs but rather numbering transmission sequence at transmitter side
  • packets are sent successively without waiting for ACKs/NAKs
  • number n determines how many successive packets can be sent before requesting a new packet
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

main properties of selective repeat ARQ (L4 23)

A
  • different of Go BacK n in the sense that it can retransmit only erroneous or lost packets
  • when a frame is lost receiver keeps requesting that frame, but sender continues sending frames that are kept in the buffer of receiver
  • requires more storage memory
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

functions of DLC layer

A
  • error detection based on parity check and cyclic redundancy check (CRC) techniques
  • to provide error-free packets to higher layers
  • received frame is appended with control bits at header and trailer to identify erroneous frames
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

give an example of even single parity check (L4 28)

A

write on paper

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

main ideas of cyclic redundancy check

A
  • parity checks codes used for error detection are CRC
  • CRC codes are based on polynomial arithmetic
17
Q

Example of CRC (division of polynomials over GF(2)) (L4 35)

A

write on paper