cnp3-ebook/principles/reliability

Exit Zen

80 ../../principles/reliability.rst:270

	English `DLE STX` 1 2 3 4 `DLE ETX` 43/10000 · 43
81 ../../principles/reliability.rst:271

	English 1 2 3 DLE STX 4 39/10000 · 39
82 ../../principles/reliability.rst:271

	English `DLE STX` 1 2 3 DLE `DLE` STX `4` `DLE ETX` 63/10000 · 63
83 ../../principles/reliability.rst:272

	English DLE STX DLE ETX 19/10000 · 19
84 ../../principles/reliability.rst:272

	English `DLE STX` DLE `DLE` STX DLE `DLE` ETX** `DLE ETX` 61/10000 · 61
85 ../../principles/reliability.rst:275

	English `Character stuffing`, like bit stuffing, increases the length of the transmitted frames. For `character stuffing`, the worst frame is a frame containing many `DLE` characters. When transmission errors occur, the receiver may incorrectly decode one or two frames (e.g. if the errors occur in the markers). However, it will be able to resynchronize itself with the next correctly received markers. 395/10000 · 395
86 ../../principles/reliability.rst:279

	English Bit stuffing and character stuffing allow recovering frames from a stream of bits or bytes. This framing mechanism provides a richer service than the physical layer. Through the framing service, one can send and receive complete frames. This framing service can also be represented by using the `DATA.request` and `DATA.indication` primitives. This is illustrated in the figure below, assuming hypothetical frames containing four useful bits and one bit of framing for graphical reasons. 487/10000 · 487
87 ../../principles/reliability.rst:307

	English We can now build upon the framing mechanism to allow the hosts to exchange frames containing an integer number of bits or bytes. Once the framing problem has been solved, we can focus on designing a technique that allows reliably exchanging frames. 248/10000 · 248
88 ../../principles/reliability.rst:314

	English Recovering from transmission errors 35/10000 · 35
89 ../../principles/reliability.rst:316

	English In this section, we develop a reliable datalink protocol running above the physical layer service. To design this protocol, we first assume that the physical layer provides a perfect service. We will then develop solutions to recover from the transmission errors. 263/10000 · 263
90 ../../principles/reliability.rst:318

	English The datalink layer is designed to send and receive frames on behalf of a user. We model these interactions by using the `DATA.req` and `DATA.ind` primitives. However, to simplify the presentation and to avoid confusion between a `DATA.req` primitive issued by the user of the datalink layer entity, and a `DATA.req` issued by the datalink layer entity itself, we will use the following terminology : 399/10000 · 399
91 ../../principles/reliability.rst:320

	English the interactions between the user and the datalink layer entity are represented by using the classical `DATA.req` and the `DATA.ind` primitives 143/10000 · 143
92 ../../principles/reliability.rst:321

	English the interactions between the datalink layer entity and the framing sub-layer are represented by using `send` instead of `DATA.req` and `recvd` instead of `DATA.ind` 164/10000 · 164
93 ../../principles/reliability.rst:323

	English When running on top of a perfect framing sub-layer, a datalink entity can simply issue a `send(SDU)` upon arrival of a `DATA.req(SDU)` [#fsdu]_. Similarly, the receiver issues a `DATA.ind(SDU)` upon receipt of a `recvd(SDU)`. Such a simple protocol is sufficient when a single SDU is sent. This is illustrated in the figure below. 330/10000 · 330
94 ../../principles/reliability.rst:342

	English Unfortunately, this is not always sufficient to ensure a reliable delivery of the SDUs. Consider the case where a client sends tens of SDUs to a server. If the server is faster than the client, it will be able to receive and process all the frames sent by the client and deliver their content to its user. However, if the server is slower than the client, problems may arise. The datalink entity contains buffers to store SDUs that have been received as a `Data.request` but have not yet been sent. If the application is faster than the physical link, the buffer may become full. At this point, the operating system suspends the application to let the datalink entity empty its transmission queue. The datalink entity also uses a buffer to store the received frames that have not yet been processed by the application. If the application is slow to process the data, this buffer may overflow and the datalink entity will not able to accept any additional frame. The buffers of the datalink entity have a limited size and if they overflow, the arriving frames will be discarded, even if they are correct. 1103/10000 · 1103
95 ../../principles/reliability.rst:344

	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 : 343/10000 · 343
96 ../../principles/reliability.rst:346

	English data frames carrying a SDU 26/10000 · 26
97 ../../principles/reliability.rst:347

	English control frames carrying an acknowledgment indicating that the previous frames was correctly processed 101/10000 · 101
98 ../../principles/reliability.rst:349

	English These two types of frames can be distinguished by dividing the frame in two parts : 83/10000 · 83
99 ../../principles/reliability.rst:351

	English the `header` that contains one bit set to `0` in data frames and set to `1` in control frames 93/10000 · 93

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.