cnp3-ebook - English @ Weblate

Exit Zen

89 ../../exercises/ipv6.rst:827

	English Starting from the :download:`/exercises/ipmininet_scripts/static-1.py` IPMininet_ script, we can explore classical problems when networks are configured with static routes. A first problem is when a router has an incomplete forwarding table. We configure the static routes as shown below. The entire script is available from :download:`/exercises/ipmininet_scripts/static-1-hole.py`. 383/10000 · 383
89 ../../exercises/routing-protocols.rst:1327

	English What is the path that packets follow from a host attached to ``AS1`` to a host attached to ``AS8`` ? 100/10000 · 100
89 ../../protocols/bgp.rst:354

	English `AS1` can install the following import filter on `R1` to ensure that it always sends packets via `R2` when it has learned a route via `AS2` and another via `AS4`. 162/10000 · 162
89 ../../protocols/email.rst:242

	English 22 2/10000 · 2
89 ../../protocols/ethernet.rst:359

	English 100 Gbps 8/10000 · 8
89 ../../protocols/ipv6.rst:341

	English It is interesting to note that there is no checksum inside the IPv6 header. This is mainly because all datalink layers and transport protocols include a checksum or a CRC to protect their frames/segments against transmission errors. Adding a checksum in the IPv6 header would have forced each router to recompute the checksum of all packets, with limited benefit in detecting errors. In practice, an IP checksum allows for catching errors that occur inside routers (e.g. due to memory corruption) before the packet reaches its destination. However, this benefit was found to be too small given the reliability of current memories and the cost of computing the checksum on each router [#fipv4checksum]_. 702/10000 · 702
89 ../../protocols/ethernet.rst:335

	English the `cost` of the shortest path between the switch that sent the `BPDU` and the root switch (`c`) 97/10000 · 97
89 ../../protocols/tcp.rst:265

	English `snd.nxt` : the sequence number of the next byte in the byte stream (the first byte of a new data segment that you send uses this sequence number) 146/10000 · 146
89 ../../protocols/tls.rst:512

	English There are many more differences between TLS 1.2 and TLS 1.3. Additional details may be found in their respective specifications, :rfc:`5246` and :rfc:`8446`. 157/10000 · 157
89 ../../bibliography.rst:113

	English Krishnamurthy, B. and Rexford, J., `Web Protocols and Practice: HTTP/1.1, Networking Protocols, Caching, and Traffic Measurement <https://books.google.be/books?id=g_1SAAAAMAAJ&q=Web+Protocols+and+Practice:+HTTP/1.1,+Networking+Protocols,+Caching,+and+Traffic+Measurement&dq=Web+Protocols+and+Practice:+HTTP/1.1,+Networking+Protocols,+Caching,+and+Traffic+Measurement&hl=en&sa=X&ved=0ahUKEwi4r4O4p73lAhU3SBUIHSOWBwkQ6AEIKTAA>`_, Addison Wesley, 2001 448/10000 · 448
89 ../../principles/transport.rst:557

	English the network layer may loose data; 33/10000 · 33
90 ../../glossary.rst:274

	English ISO-3166 8/10000 · 8
90 ../../principles/network.rst:457 • ../../principles/network.rst:499 • ../../principles/network.rst:511 • ../../principles/network.rst:523 • ../../principles/network.rst:535

	English label 5/10000 · 5
90 ../../principles/reliability.rst:318

	English The datalink layer is designed to send and receive frames on behalf of a user. We model these interactions by using the `DATA.req` and `DATA.ind` primitives. However, to simplify the presentation and to avoid confusion between a `DATA.req` primitive issued by the user of the datalink layer entity, and a `DATA.req` issued by the datalink layer entity itself, we will use the following terminology : 399/10000 · 399
90 ../../principles/sharing.rst:586

	English Removing acknowledgments is an interesting optimization as it reduces the number of frames that are exchanged on the network and the number of frames that need to be processed by the hosts. However, to use this optimization, we must ensure that all hosts will be able to detect all the collisions that affect their frames. The problem is important for short frames. Let us consider two hosts, A and B, that are sending a small frame to host C as illustrated in the figure below. If the frames sent by A and B are very short, the situation illustrated below may occur. Hosts A and B send their frame and stop transmitting (point `(1)`). When the two short frames arrive at the location of host C, they collide and host C cannot decode them (point `(2)`). The two frames are absorbed by the ends of the wire. Neither host A nor host B have detected the collision. They both consider their frame to have been received correctly by its destination. 944/10000 · 944
90 ../../principles/security.rst:956

	English Bob computes :math:`S_{B}=A^{b} \mod p= 16^{13} \mod 23=3` 58/10000 · 58
90 ../../exercises/ipv6.rst:841

	English We first check with ``pingall`` whether the network works correctly. 68/10000 · 68
90 ../../exercises/routing-protocols.rst:1339

	English What is the path that packets follow from a host attached to ``AS8`` to a host attached to ``AS1`` ? 100/10000 · 100
90 ../../protocols/bgp.rst:363

	English However, this import filter does not influence how `AS3` , for example, prefers some routes over others. If the link between `AS3` and `AS2` is less expensive than the link between `AS3` and `AS4`, `AS3` could send all its packets via `AS2` and `AS1` would receive packets over its expensive link. An important point to remember about `local-pref` is that it can be used to prefer some routes over others to send packets, but it has no influence on the routes followed by received packets. 489/10000 · 489
90 ../../protocols/email.rst:242

	English W 1/10000 · 1

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.