cnp3-ebook - English @ Weblate

Exit Zen

91 ../../protocols/tls.rst:516

	English See http://www.iana.org/assignments/tls-parameters/tls-parameters.xhtml#tls-parameters-4 88/10000 · 88
91 ../../principles/transport.rst:559

	English the network layer has an upper bound on maximum length of the data; 67/10000 · 67
92 ../../glossary.rst:281

	English ISP 3/10000 · 3
92 ../../principles/network.rst:459

	English South 5/10000 · 5
92 ../../principles/reliability.rst:321

	English the interactions between the datalink layer entity and the framing sub-layer are represented by using `send` instead of `DATA.req` and `recvd` instead of `DATA.ind` 164/10000 · 164
92 ../../principles/sharing.rst:599

	English To solve this problem, networks using CSMA/CD require hosts to transmit for at least :math:`2\times\tau` seconds. Since the network transmission speed is fixed for a given network technology, this implies that a technology that uses CSMA/CD enforces a minimum frame size. In the most popular CSMA/CD technology, Ethernet, :math:`2\times\tau` is called the `slot time` [#fslottime]_. 382/10000 · 382
92 ../../principles/security.rst:970

	English Unfortunately, the Diffie-Hellman key exchange alone cannot cope with man-in-the middle attacks. Consider Mallory who sits in the middle between Alice and Bob and can easily capture and modify their messages. The modulus and the base are public. They are thus known by Mallory as well. He could then operate as follows : 320/10000 · 320
92 ../../exercises/ipv6.rst:861

	English In the output of :manpage:`traceroute6(8)`, a ``!N`` indicates that host ``a`` received from ``2001:db8:1341:12::2``, i.e. router ``r2``, a Network unreachable ICMPv6 message. The forwarding table of ``r2`` confirms the root cause of this problem. 247/10000 · 247
92 ../../exercises/routing-protocols.rst:1364

	English What is the path that packets follow from a host attached to ``AS2`` to a host attached to ``AS7`` ? 100/10000 · 100
92 ../../protocols/bgp.rst:367

	English insert a high `local-pref` attribute in the routes learned from a customer 74/10000 · 74
92 ../../protocols/email.rst:242

	English n 1/10000 · 1
92 ../../protocols/ethernet.rst:364

	English The `Spanning Tree Protocol` uses the ordering relationship to build the spanning tree. Each switch listens to `BPDUs` on its ports. When `BPDU = <R,c,T,p>` is received on port `q`, the switch computes the port's `root priority vector`: `V[q] = <R,c+cost[q],T,p,q>` , where `cost[q]` is the cost associated to the port over which the `BPDU` was received. The switch stores in a table the last `root priority vector` received on each port. The switch then compares its own `identifier` with the smallest `root identifier` stored in this table. If its own `identifier` is smaller, then the switch is the root of the spanning tree and is, by definition, at a distance `0` of the root. The `BPDU` of the switch is then `<R,0,R,p>`, where `R` is the switch `identifier` and `p` will be set to the port number over which the `BPDU` is sent. 834/10000 · 834
92 ../../protocols/ipv6.rst:346

	English ``UDP`` uses `Next Header` number ``17`` 40/10000 · 40
92 ../../protocols/tcp.rst:268

	English `rcv.nxt` : the sequence number of the next byte that is expected to be received from the remote host 101/10000 · 101
92 ../../protocols/tls.rst:518

	English A detailed explanation of the TLS 1.3 handshake may be found at https://tls13.ulfheim.net/ 90/10000 · 90
92 ../../protocols/ethernet.rst:339

	English We will use the notation `<R,c,T,p>` to represent a `BPDU` whose `root identifier` is `R`, `cost` is `c` and that was sent from the port `p` of switch `T`. The construction of the spanning tree depends on an ordering relationship among the `BPDUs`. This ordering relationship could be implemented by the Python function below. 327/10000 · 327
92 ../../bibliography.rst:116

	English Katz, D., Ward, D., `Bidirectional Forwarding Detection`, :rfc:`5880`, June 2010 81/10000 · 81
92 ../../principles/transport.rst:560

	English the network layer may duplicate data. 37/10000 · 37
93 ../../bibliography.rst:117

	English Khanna, A. and Zinky, J. 1989. `The revised ARPANET routing metric <http://doi.acm.org/10.1145/75247.75252>`_. SIGCOMM Computer Communication Review 19, 4 (Aug. 1989), 45-56. 174/10000 · 174
93 ../../glossary.rst:283

	English An Internet Service Provider, i.e. a network that provides Internet access to its clients. 90/10000 · 90

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.