2. cnp3-ebook
3. exercises/reliability
4. French
5. Browse

2 / 2

/ 2

All strings

• Untranslated strings • state:empty
• Unfinished strings • state:<translated
• Translated strings • state:>=translated
• Strings marked for edit • state:needs-editing
• Strings with suggestions • has:suggestion
• Strings with variants • has:variant
• Strings with labels • has:label
• Strings with context • has:context
• Unfinished strings without suggestions • state:<translated AND NOT has:suggestion
• Strings with comments • has:comment
• Strings with any failing checks • has:check
• Approved strings • state:approved
• Strings waiting for review • state:translated

Position and priority

• Position and priority
• Position
• Priority
• Labels
• Source string
• Target string
• String age
• Number of words
• Number of comments
• Number of failing checks
• Key

	English	French
	the Internet checksum used by UDP, TCP and other Internet protocols which is defined in :rfc:`1071` and implemented in various libraries.
	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.
	The Cyclic Redundancy Checks (CRCs) are efficient error detection codes that are able to detect :	Les contrôles de redondance cyclique (CRC) sont des outils efficaces de détection d'erreurs pouvant détecter :
	all errors that affect an odd number of bits	toutes les erreurs affectant un nombre impair de bits
	all errors that affect a sequence of bits which is shorter than the length of the CRC	toutes les errors affectant une séquence de bits plus courte que la longueur du CRC
	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.
	Discussion questions	Questions de discussion
	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
	one frame	une frame
	ten frames	dix frames
	hundred frames	cent frames
	Is it possible for a go-back-n receiver to inter-operate with a selective-repeat sender ? Justify your answer.	Est-il possible pour un récepteur go-back-n de fonctionner avec un émetteur selective-repeat ? Justifiez.
	Is it possible for a selective-repeat receiver to inter-operate with a go-back-n sender ? Justify your answer.	Est-il possible pour un récepteur selective-repeat de fonctionner avec un émetteur go-back-n ? Justifiez.
	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.