cnp3-ebook/principles/reliability

Source strings

199	Strings		100%	Browse Translate
8,611	Words		100%	Browse Translate

This translation is being used as source strings within this component.

Strings status

199	All strings — 8,611 words	Browse Translate Zen
199	Read-only strings — 8,611 words	Browse Translate Zen
7	Strings with any failing checks — 412 words	Browse Translate Zen
6	Failing check: Ellipsis — 410 words	Browse Translate Zen
1	Failing check: Multiple failing checks — 2 words	Browse Translate Zen

Other components

Component	Unfinished	Unfinished words	Unfinished characters	Untranslated	Checks	Suggestions	Comments
exercises/ex-sharing CC-BY-SA-3.0	0	0	0	0	0	0	0

exercises/intro CC-BY-SA-3.0	0	0	0	0	0	0	0

exercises/reliability CC-BY-SA-3.0	0	0	0	0	0	0	0

exercises/transport CC-BY-SA-3.0	0	0	0	0	0	0	0

principles/naming CC-BY-SA-3.0	0	0	0	0	1	0	0

principles/referencemodels CC-BY-SA-3.0	0	0	0	0	0	0	0

principles/security CC-BY-SA-3.0	0	0	0	0	1	0	0

exercises/dns CC-BY-SA-3.0	0	0	0	0	3	0	0

exercises/http CC-BY-SA-3.0	0	0	0	0	0	0	0

exercises/lan CC-BY-SA-3.0	0	0	0	0	0	0	0

Browse all components

Overview

Project website	www.computer-networking.info
Project maintainers	obonaventure qdeconinck
Translation process	Translations can be made directly. Translation suggestions can be made. Any authenticated user can contribute. The translation uses bilingual files.
Translation license	Creative Commons Attribution Share Alike 3.0 Unported
Source code repository	`https://github.com/cnp3/ebook`
Repository branch	master
Last remote commit	Merge pull request #126 from INGIbot/weblate-cnp3-ebook-index `d9f8d8f` Olivier Bonaventure authored 8 months ago
Weblate repository	`https://weblate.info.ucl.ac.be/git/cnp3-ebook/index/`
File mask	`locale/*/LC_MESSAGES/principles/reliability.po`
Translation file	Download `locale/pot/principles/reliability.pot`
Last change	None
Last author	None

String statistics

	Strings percent	Hosted strings	Words percent	Hosted words	Characters percent	Hosted characters
Total		199		8,611		53,398
Translated	100%	199	100%	8,611	100%	53,398
Needs editing	0%	0	0%	0	0%	0
Read-only	100%	199	100%	8,611	100%	53,398
Failing checks	3%	7	4%	412	4%	2,564
Strings with suggestions	0%	0	0%	0	0%	0
Untranslated strings	0%	0	0%	0	0%	0

Last 12 months Previous

Activity in last 12 months


Dec	Jan	Feb	Mar	Apr	May	Jun	Jul	Aug	Sep	Oct	Nov

Quick numbers

8,611

Hosted words

199

Hosted strings

100%

Translated

Contributors

and previous 30 days

Trends of last 30 days

—

Hosted words

—

Hosted strings

—

Translated

—

Contributors

—

None Resource update cnp3-ebook / principles/reliability — English	File `locale/pot/principles/reliability.pot` was added. 2 years ago
None String updated in the repository cnp3-ebook / principles/reliability — English	English A `go-back-n` sender is also very simple. It uses a sending buffer that can store an entire sliding window of frames [#fsizesliding]_. The frames are sent with increasing sequence numbers (modulo `maxseq`). The sender must wait for an acknowledgment once its sending buffer is full. When a `go-back-n` sender receives an acknowledgment, it removes from the sending buffer all the acknowledged frames and uses a retransmission timer to detect frame losses. A simple `go-back-n` sender maintains one retransmission timer per connection. This timer is started when the first frame is sent. When the `go-back-n sender` receives an acknowledgment, it restarts the retransmission timer only if there are still unacknowledged frames in its sending buffer. When the retransmission timer expires, the `go-back-n` sender assumes that all the unacknowledged frames currently stored in its sending buffer have been lost. It thus retransmits all the unacknowledged frames in the buffer and restarts its retransmission timer. English 1011 characters edited Current translation Read only A `go-back-n` sender is also very simple. It uses a sending buffer that can store an entire sliding window of frames [#fsizesliding]_. The frames are sent with increasing sequence numbers (modulo `maxseq`). The sender must wait for an acknowledgment once its sending buffer is full. When a `go-back-n` sender receives an acknowledgment, it removes from the sending buffer all the acknowledged frames and uses a retransmission timer to detect frame losses. A simple `go-back-n` sender maintains one retransmission timer per connection. This timer is started when the first frame is sent. When the `go-back-n sender` receives an acknowledgment, it restarts the retransmission timer only if there are still unacknowledged frames in its sending buffer. When the retransmission timer expires, the `go-back-n` sender assumes that all the unacknowledged frames currently stored in its sending buffer have been lost. It thus retransmits all the unacknowledged frames in the buffer and restarts its retransmission timer. 2 years ago
None String updated in the repository cnp3-ebook / principles/reliability — English	English The simplest sliding window protocol uses the `go-back-n` recovery. Intuitively, `go-back-n` operates as follows. A `go-back-n` receiver is as simple as possible. It only accepts the frames that arrive in-sequence. A `go-back-n` receiver discards any out-of-sequence frame that it receives. When `go-back-n` receives a data frame, it always returns an acknowledgment containing the sequence number of the last in-sequence frame that it has received. This acknowledgment is said to be `cumulative`. When a `go-back-n` receiver sends an acknowledgment for sequence number `x`, it implicitly acknowledges the reception of all frames whose sequence number is earlier than `x`. A key advantage of these cumulative acknowledgments is that it is easy to recover from the loss of an acknowledgment. Consider for example a `go-back-n` receiver that received frames `1`, `2` and `3`. It sent `OK1`, `OK2` and `OK3`. Unfortunately, `OK1` and `OK2` were lost. Thanks to the cumulative acknowledgments, when the sender receives `OK3`, it knows that all three frames have been correctly received. English 1082 characters edited Current translation Read only The simplest sliding window protocol uses the `go-back-n` recovery. Intuitively, `go-back-n` operates as follows. A `go-back-n` receiver is as simple as possible. It only accepts the frames that arrive in-sequence. A `go-back-n` receiver discards any out-of-sequence frame that it receives. When `go-back-n` receives a data frame, it always returns an acknowledgment containing the sequence number of the last in-sequence frame that it has received. This acknowledgment is said to be `cumulative`. When a `go-back-n` receiver sends an acknowledgment for sequence number `x`, it implicitly acknowledges the reception of all frames whose sequence number is earlier than `x`. A key advantage of these cumulative acknowledgments is that it is easy to recover from the loss of an acknowledgment. Consider for example a `go-back-n` receiver that received frames `1`, `2` and `3`. It sent `OK1`, `OK2` and `OK3`. Unfortunately, `OK1` and `OK2` were lost. Thanks to the cumulative acknowledgments, when the sender receives `OK3`, it knows that all three frames have been correctly received. 2 years ago
None String updated in the repository cnp3-ebook / principles/reliability — English	English The figure below illustrates the operation of the sliding window. It uses a sliding window of three frames. The sender can thus transmit three frames before being forced to wait for an acknowledgment. The sliding window moves to the higher sequence numbers upon the reception of each acknowledgment. When the first acknowledgment (`OK0`) is received, it enables the sender to move its sliding window to the right and sequence number `3` becomes available. This sequence number is used later to transmit the frame containing `d`. English 528 characters edited Current translation Read only The figure below illustrates the operation of the sliding window. It uses a sliding window of three frames. The sender can thus transmit three frames before being forced to wait for an acknowledgment. The sliding window moves to the higher sequence numbers upon the reception of each acknowledgment. When the first acknowledgment (`OK0`) is received, it enables the sender to move its sliding window to the right and sequence number `3` becomes available. This sequence number is used later to transmit the frame containing `d`. 2 years ago
None String updated in the repository cnp3-ebook / principles/reliability — English	English This is implemented by using a `sliding window`. The sliding window is the set of consecutive sequence numbers that the sender can use when transmitting frames without being forced to wait for an acknowledgment. The figure below shows a sliding window containing five frames (`6,7,8,9` and `10`). Two of these sequence numbers (`6` and `7`) have been used to send frames and only three sequence numbers (`8`, `9` and `10`) remain in the sliding window. The sliding window is said to be closed once all sequence numbers contained in the sliding window have been used. English 566 characters edited Current translation Read only This is implemented by using a `sliding window`. The sliding window is the set of consecutive sequence numbers that the sender can use when transmitting frames without being forced to wait for an acknowledgment. The figure below shows a sliding window containing five frames (`6,7,8,9` and `10`). Two of these sequence numbers (`6` and `7`) have been used to send frames and only three sequence numbers (`8`, `9` and `10`) remain in the sliding window. The sliding window is said to be closed once all sequence numbers contained in the sliding window have been used. 2 years ago
None String updated in the repository cnp3-ebook / principles/reliability — English	English To overcome the performance limitations of the alternating bit protocol, reliable protocols rely on `pipelining`. This technique allows a sender to transmit several consecutive frames without being forced to wait for an acknowledgment after each frame. Each data frame contains a sequence number encoded as an `n` bits field. English 325 characters edited Current translation Read only To overcome the performance limitations of the alternating bit protocol, reliable protocols rely on `pipelining`. This technique allows a sender to transmit several consecutive frames without being forced to wait for an acknowledgment after each frame. Each data frame contains a sequence number encoded as an `n` bits field. 2 years ago
None String updated in the repository cnp3-ebook / principles/reliability — English	English The second figure illustrates how the hosts handle the loss of one control frame. English 81 characters edited Current translation Read only The second figure illustrates how the hosts handle the loss of one control frame. 2 years ago
None String updated in the repository cnp3-ebook / principles/reliability — English	English The Alternating Bit Protocol can recover from the losses of data or control frames. This is illustrated in the two figures below. The first figure shows the loss of one data frame. English 180 characters edited Current translation Read only The Alternating Bit Protocol can recover from the losses of data or control frames. This is illustrated in the two figures below. The first figure shows the loss of one data frame. 2 years ago
None String updated in the repository cnp3-ebook / principles/reliability — English	English The Alternating Bit Protocol uses a single bit to encode the sequence number. It can be implemented easily. The sender (resp. the receiver) only require a four-state (resp. three-state) Finite State Machine. English 207 characters edited Current translation Read only The Alternating Bit Protocol uses a single bit to encode the sequence number. It can be implemented easily. The sender (resp. the receiver) only require a four-state (resp. three-state) Finite State Machine. 2 years ago
None String updated in the repository cnp3-ebook / principles/reliability — English	English Unfortunately, retransmission timers alone are not sufficient to recover from losses. Let us consider, as an example, the situation depicted below where an acknowledgment is lost. In this case, the sender retransmits the data frame that has not been acknowledged. However, as illustrated in the figure below, the receiver considers the retransmission as a new frame whose payload must be delivered to its user. English 410 characters edited Current translation Read only Unfortunately, retransmission timers alone are not sufficient to recover from losses. Let us consider, as an example, the situation depicted below where an acknowledgment is lost. In this case, the sender retransmits the data frame that has not been acknowledged. However, as illustrated in the figure below, the receiver considers the retransmission as a new frame whose payload must be delivered to its user. 2 years ago

Browse all translation changes

Quick downloads

199	File in original format as translated in the repository	gettext PO file
199	All strings, converted files enriched with comments; suitable for offline translation	CSV	gettext MO	gettext PO	TBX	TMX	XLIFF 1.1 with gettext extensions	XLIFF 1.1	XLSX

Customize download

Search

Advanced query builder

Query examples

Review strings changed by other users	`changed:>=2024-11-24 AND NOT changed_by:anonymous`	Add
Translated strings	`state:>=translated`	Add
Strings with comments	`has:comment`	Add
Strings with any failing checks	`has:check`	Add
Strings with suggestions from others	`has:suggestion AND NOT suggestion_author:anonymous`	Add
Approved strings with suggestions	`state:approved AND has:suggestion`	Add
All untranslated strings added the past month	`added:>=2024-11-24 AND state:<=needs-editing`	Add