msgid ""
msgstr ""
"Project-Id-Version: French (cnp3-ebook)\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2026-04-18 21:36+0200\n"
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
"Language-Team: French <https://weblate.info.ucl.ac.be/projects/cnp3-ebook/"
"exercisesreliability/fr/>\n"
"Language: fr\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"Plural-Forms: nplurals=2; plural=n > 1;\n"
"X-Generator: Weblate 5.14.3\n"

#: ../../exercises/reliability.rst:16
msgid ""
"Transmission links have sometimes different upstream and downstream "
"bandwidths. A typical example are access networks that use ADSL "
"(Asymmetric Digital Subscriber Lines). Consider two hosts connected via an "
"ADSL link having an upstream bandwidth of 1 Mbps and a downstream bandwidth "
"of 50 Mbps. The propagation delay between the two hosts is 10 milliseconds. "
"What is the maximum throughput, expressed in frames/second, that the "
"alternating bit protocol can obtain on this link if each data frame has a "
"length of 125 bytes and acknowledgments are 25 bytes long. Same question if "
"the protocol is modified to support 1500 bytes long data frames."
msgstr ""

#: ../../exercises/reliability.rst:56
msgid ""
"the Internet checksum used by UDP, TCP and other Internet protocols which is "
"defined in :rfc:`1071` and implemented in various libraries."
msgstr ""

#: ../../exercises/reliability.rst:57
msgid ""
"the 16 bits or the 32 bits Cyclical Redundancy Checks (CRC) that are often "
"used on disks, in zip archives and in datalink layer protocols. See http://"
"rosettacode.org/wiki/CRC-32 for CRC-32 implementations in various languages."
msgstr ""

#: ../../exercises/reliability.rst:67
msgid ""
"Implement a small software that computes the CRC-32 for a text file. Then, "
"modify the contents of the file to change an even number of bits or an odd "
"number of bits inside the file. When modifying the file, remember that an "
"ASCII file is composed of 8 bits characters that are encoded by using the "
"ASCII table that you can find at : http://en.wikipedia.org/wiki/ASCII . You "
"can also write a small program that produces binary files that are a small "
"variation of each other."
msgstr ""

#: ../../exercises/reliability.rst:77
msgid ""
"Consider two high-end servers connected back-to-back by using a 10 Gbps "
"interface. If the delay between the two servers is one millisecond, what is "
"the throughput that can be achieved by a reliable protocol that is using "
"10,000 bits frames and a window of"
msgstr ""

#: ../../exercises/reliability.rst:91
msgid ""
"Same question as above, but assume now that both the sender and the receiver "
"implement selective repeat. Note that the answer can be different from the "
"above question."
msgstr ""
