cnp3-ebook - English @ Weblate

Exit Zen

117 ../../protocols/tcp.rst:337 • ../../protocols/tcp.rst:350

	English 500 msec 8/10000 · 8
117 ../../bibliography.rst:155

	English Prado, A., Harris, N., and Y. Gluck, `The BREACH Attack <http://breachattack.com>`_ , 2013, <http://breachattack.com/>. 119/10000 · 119
118 ../../bibliography.rst:157

	English Rago, S., `UNIX System V network programming <http://www.pearsonhighered.com/educator/product/UNIX-System-V-Network-Programming/9780201563184.page>`_, Addison Wesley, 1993 171/10000 · 171
118 ../../glossary.rst:162

	English NAT 3/10000 · 3
118 ../../principles/network.rst:601

	English We will see later a more detailed description of Multiprotocol Label Switching, a networking technology that is capable of using one or more labels. 148/10000 · 148
118 ../../principles/reliability.rst:447

	English This parity scheme has been used in some RAMs as well as to encode characters sent over a serial line. It is easy to show that this coding scheme allows the receiver to detect a single transmission error, but it cannot correct it. However, if two or more bits are in error, the receiver may not always be able to detect the error. 330/10000 · 330
118 ../../principles/sharing.rst:750

	English Deterministic Medium Access Control algorithms 46/10000 · 46
118 ../../principles/transport.rst:729

	English The initiating transport entity sends a `CR` segment. This segment requests the establishment of a transport connection. It contains a port number (not shown in the figure) and a sequence number (`seq=x` in the figure below) whose value is extracted from the `transport clock`. The transmission of the `CR` segment is protected by a retransmission timer. 354/10000 · 354
118 ../../protocols/bgp.rst:426

	English `AS3` sends `U(p,AS3:AS4:AS0)` to `AS1` and `W(p)` to `AS4`. `AS1` switches back to the direct path and we are back at the first step. 134/10000 · 134
118 ../../protocols/email.rst:250

	English a 1/10000 · 1
118 ../../protocols/ipv6.rst:404

	English Ethernet 8/10000 · 8
118 ../../protocols/ethernet.rst:377

	English Designated 10/10000 · 10
118 ../../protocols/tcp.rst:337

	English 1.05 Mbps 9/10000 · 9
119 ../../glossary.rst:164

	English A Network Address Translator is a middlebox that translates IP packets. 71/10000 · 71
119 ../../principles/network.rst:606

	English The control plane 17/10000 · 17
119 ../../principles/reliability.rst:449

	English Some coding schemes allow the receiver to correct some transmission errors. For example, consider the coding scheme that encodes each source bit as follows : 157/10000 · 157
119 ../../principles/sharing.rst:752

	English During the 1970s and 1980s, there were huge debates in the networking community about the best suited Medium Access Control algorithms for Local Area Networks. The optimistic algorithms that we have described until now were relatively easy to implement when they were designed. From a performance perspective, mathematical models and simulations showed the ability of these optimistic techniques to sustain load. However, none of the optimistic techniques are able to guarantee that a frame will be delivered within a given delay bound and some applications require predictable transmission delays. The deterministic MAC algorithms were considered by a fraction of the networking community as the best solution to fulfill the needs of Local Area Networks. 755/10000 · 755
119 ../../principles/transport.rst:731

	English The remote transport entity processes the `CR` segment and creates state for the connection attempt. At this stage, the remote entity does not yet know whether this is a new connection attempt or a duplicate segment. It returns a `CA` segment that contains an acknowledgment number to confirm the reception of the `CR` segment (`ack=x` in the figure below) and a sequence number (`seq=y` in the figure below) whose value is extracted from its transport clock. At this stage, the connection is not yet established. 513/10000 · 513
119 ../../protocols/bgp.rst:428

	English This example shows that the convergence of BGP is unfortunately not always guaranteed as some interdomain routing policies may interfere with each other in complex ways. [GW1999]_ have shown that checking for global convergence is either NP-complete or NP-hard. See [GSW2002]_ for a more detailed discussion. 308/10000 · 308
119 ../../protocols/email.rst:250

	English 43 2/10000 · 2

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.