Exit Zen
94
../../principles/reliability.rst:334
English
To solve this problem, a reliable protocol must include a feedback mechanism that allows the receiver to inform the sender that it has processed a frame and that another one can be sent. This feedback is required even though there are no transmission errors. To include such a feedback, our reliable protocol must process two types of frames :
0/3430 · 343
95
../../principles/reliability.rst:336
English
data frames carrying a SDU
0/260 · 26
97
../../principles/reliability.rst:339
English
These two types of frames can be distinguished by dividing the frame in two parts :
0/830 · 83
98
../../principles/reliability.rst:341
English
the `header` that contains one bit set to `0` in data frames and set to `1` in control frames
0/930 · 93
99
../../principles/reliability.rst:342
English
the payload that contains the SDU supplied by the application
0/610 · 61
100
../../principles/reliability.rst:344
English
The datalink entity can then be modeled as a finite state machine, containing two states for the receiver and two states for the sender. The figure below provides a graphical representation of this state machine with the sender above and the receiver below.
0/2570 · 257
102
../../principles/reliability.rst:353
English
The above FSM shows that the sender has to wait for an acknowledgment from the receiver before being able to transmit the next SDU. The figure below illustrates the exchange of a few frames between two hosts.
0/2090 · 209
103
../../principles/reliability.rst:372
English
Services and protocols
0/220 · 22
105
../../principles/reliability.rst:389
English
Reliable data transfer on top of an imperfect link
0/500 · 50
106
../../principles/reliability.rst:391
English
The datalink layer must deal with the transmission errors. In practice, we mainly have to deal with two types of errors in the datalink layer :
0/1430 · 143
107
../../principles/reliability.rst:393
English
Frames can be corrupted by transmission errors
0/460 · 46
108
../../principles/reliability.rst:394
English
Frames can be lost or unexpected frames can appear
0/500 · 50
110
../../principles/reliability.rst:399
English
To deal with these types of imperfections, reliable protocols rely on different types of mechanisms. The first problem is transmission errors. Data transmission on a physical link can be affected by the following errors :
0/2210 · 221
111
../../principles/reliability.rst:401
English
random isolated errors where the value of a single bit has been modified due to a transmission error
0/1000 · 100
112
../../principles/reliability.rst:402
English
random burst errors where the values of `n` consecutive bits have been changed due to transmission errors
0/1050 · 105
113
../../principles/reliability.rst:403
English
random bit creations and random bit removals where bits have been added or removed due to transmission errors
0/1090 · 109
114
../../principles/reliability.rst:405
English
The only solution to protect against transmission errors is to add redundancy to the frames that are sent. `Information Theory` defines two mechanisms that can be used to transmit information over a transmission channel affected by random errors. These two mechanisms add redundancy to the transmitted information, to allow the receiver to detect or sometimes even correct transmission errors. A detailed discussion of these mechanisms is outside the scope of this chapter, but it is useful to consider a simple mechanism to understand its operation and its limitations.
0/5700 · 570
115
../../principles/reliability.rst:407
English
`Information theory` defines `coding schemes`. There are different types of coding schemes, but let us focus on coding schemes that operate on binary strings. A coding scheme is a function that maps information encoded as a string of `m` bits into a string of `n` bits. The simplest coding scheme is the (even) parity coding. This coding scheme takes an `m` bits source string and produces an `m+1` bits coded string where the first `m` bits of the coded string are the bits of the source string and the last bit of the coded string is chosen such that the coded string will always contain an even number of bits set to `1`. For example :
0/6380 · 638
116
../../principles/reliability.rst:409
English
`1001` is encoded as `10010`
0/280 · 28
117
../../principles/reliability.rst:410
English
`1101` is encoded as `11011`
0/280 · 28