Language Translated Unfinished Unfinished words Unfinished characters Untranslated Checks Suggestions Comments
English This language is used for source strings. This component is linked to the cnp3-ebook/index repository. CC-BY-SA-3.0 0 0 0 0 7 0 0
Czech This component is linked to the cnp3-ebook/index repository. CC-BY-SA-3.0 0% 167 5,867 35,992 167 0 0 0
French This component is linked to the cnp3-ebook/index repository. CC-BY-SA-3.0 22% 130 4,463 27,478 130 2 0 0
Please sign in to see the alerts.

Overview

Project website www.computer-networking.info
Project maintainers User avatar obonaventure User avatar 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 #128 from aaaaalbert/fix-typos-in-preface 00ed7a4
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

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 533 20,345 125,382
Source 199 8,611 53,398
Translated 44% 236 49% 10,015 49% 61,912
Needs editing 0% 0 0% 0 0% 0
Read-only 37% 199 42% 8,611 42% 53,398
Failing checks 1% 9 2% 415 2% 2,571
Strings with suggestions 0% 0 0% 0 0% 0
Untranslated strings 55% 297 50% 10,330 50% 63,470
Last 12 months Previous

Activity in last 12 months

8 changes 1 change 4 changes 0 changes 7 changes 0 changes 0 changes 34 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 1 change 0 changes 0 changes 0 changes 0 changes 3 changes 0 changes 0 changes 0 changes 3 changes
Jun Jul Aug Sep Oct Nov Dec Jan Feb Mar Apr May

Quick numbers

20,345
Hosted words
533
Hosted strings
44%
Translated
1
Contributors
and previous 30 days

Trends of last 30 days

—
Hosted words
—
—
Hosted strings
—
—
Translated
—
+100%
Contributors
—
User avatar None

Component unlocked

cnp3-ebook / principles/reliability

Fixing an alert automatically unlocked the component. 11 days ago
User avatar None

Component locked

cnp3-ebook / principles/reliability

The component was automatically locked because of an alert. 11 days ago
User avatar None

New alert

cnp3-ebook / principles/reliability

Could not update the repository. 11 days ago
User avatar None

Component unlocked

cnp3-ebook / principles/reliability

Fixing an alert automatically unlocked the component. 2 months ago
User avatar None

Component locked

cnp3-ebook / principles/reliability

The component was automatically locked because of an alert. 2 months ago
User avatar None

New alert

cnp3-ebook / principles/reliability

Could not update the repository. 2 months ago
User avatar None

Resource update

cnp3-ebook / principles/reliability — English

File locale/pot/principles/reliability.pot was added. 8 months ago
User avatar None

String updated in the repository

cnp3-ebook / principles/reliability — 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.
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.
8 months ago
User avatar None

String updated in the repository

cnp3-ebook / principles/reliability — 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.
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.
8 months ago
User avatar None

String updated in the repository

cnp3-ebook / principles/reliability — 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`.
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`.
8 months ago
Browse all component changes