2. cnp3-ebook
3. English
4. Zen

31 ../../bibliography.rst:42
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Chiu, D., Jain, R., `Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks <https://dx.doi.org/10.1016/0169-7552(89)90019-6>`_, Computer Networks and ISDN Systems Vol 17, pp 1-14, 1989 225/10000 · 225
31 ../../exercises/network.rst:259
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The network below uses port forwarding tables. It has been running for several hours and all hosts have exchanged packets. What is the content of the port forwarding tables ? 174/10000 · 174
31 ../../exercises/reliability.rst:60
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — all errors that affect a sequence of bits which is shorter than the length of the CRC 85/10000 · 85
31 ../../principles/sharing.rst:214
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Let us first explore which mechanisms can be used inside a network to control congestion and how these mechanisms can influence the behavior of the end hosts. 158/10000 · 158
31 ../../principles/transport.rst:83
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In addition, the :term:`ASCII` table also defines several non-printable or control characters. These characters were designed to allow an application to control a printer or a terminal. These control characters include `CR` and `LF`, that are used to terminate a line, and the `Bell` character which causes the terminal to emit a sound. 336/10000 · 336
31 ../../principles/security.rst:367
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a public key (:math:`K_{pub}`) that he can distribute to everyone 65/10000 · 65
31 ../../exercises/dns.rst:93
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The next three questions ask you to go one step further by predicting the values of specific fields in the DNS messages. 120/10000 · 120
31 ../../exercises/ipv6.rst:295
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``p:13/64`` for the link between ``R1`` and ``R3``. On this subnet, ``R1`` uses address ``p:13::1`` while router ``R3`` uses address ``p:13::3`` 144/10000 · 144
31 ../../exercises/tcp-2.rst:213
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As for the establishment of a connection, it is also possible for the two communicating hosts to close the connection at the same time. This is shown in the example below where the remote host sends its own ``FIN`` when acknowledging the first one. This script is available from :download:`/exercises/packetdrill_scripts/local-close2.pkt`. 339/10000 · 339
31 ../../protocols/bgp.rst:101
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The figure below shows a simple example of the BGP routes that are exchanged between domains. In this example, prefix `2001:db8:cafe::/48` is announced by `AS1`. `AS1` advertises a BGP route towards this prefix to `AS2`. The AS-Path of this route indicates that `AS1` is the originator of the prefix. When `AS4` receives the BGP route from `AS1`, it re-announces it to `AS2` and adds its AS number to the AS-Path. `AS2` has learned two routes towards prefix `2001:db8:cafe::/48`. It compares the two routes and prefers the route learned from `AS4` based on its own ranking algorithm. `AS2` advertises to `AS5` a route towards `2001:db8:cafe::/48` with its AS-Path set to `AS2:AS4:AS1`. Thanks to the AS-Path, `AS5` knows that if it sends a packet towards `2001:db8:cafe::/48` the packet first passes through `AS2`, then through `AS4` before reaching its destination inside `AS1`. 879/10000 · 879
31 ../../protocols/congestion.rst:180
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Routers that use a single queue measure their buffer occupancy as the number of bytes of packets stored in the queue [#fslot]_. A first method to detect congestion is to measure the instantaneous buffer occupancy and consider the router to be congested as soon as this occupancy is above a threshold. Typical values of the threshold could be 40% of the total buffer. Measuring the instantaneous buffer occupancy is simple since it only requires one counter. However, this value is fragile from a control viewpoint since it changes frequently. A better solution is to measure the *average* buffer occupancy and consider the router to be congested when this average occupancy is too high. Random Early Detection (RED) [FJ1993]_ is an algorithm that was designed to support Explicit Congestion Notification. In addition to measuring the average buffer occupancy, it also uses probabilistic marking. When the router is congested, the arriving packets are marked with a probability that increases with the average buffer occupancy. The main advantage of using probabilistic marking instead of marking all arriving packets is that flows will be marked in proportion of the number of packets that they transmit. If the router marks 10% of the arriving packets when congested, then a large flow that sends hundred packets per second will be marked 10 times while a flow that only sends one packet per second will not be marked. This probabilistic marking allows marking packets in proportion of their usage of the network resources. 1524/10000 · 1524
31 ../../protocols/email.rst:174
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `MIME-Version:` header line indicates the version of the MIME specification that was used to encode the email message. The current version of MIME is 1.0. Other versions of MIME may be defined in the future. Thanks to this header line, the software that processes email messages will be able to adapt to the MIME version used to encode the message. Messages that do not contain this header are supposed to be formatted according to the original :rfc:`822` specification. 474/10000 · 474
31 ../../protocols/ethernet.rst:172
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Thin coaxial cable, 185m 24/10000 · 24
31 ../../protocols/http.rst:123
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a `header`, that contains additional information about the response. The response header ends with an empty line. 113/10000 · 113
31 ../../protocols/http2.rst:228
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — By using multiple streams, the server can multiplex different web objects over the same underlying transport connection. However, these objects are only sent in response to requests from clients. There are some situations where the server might know in advance that the client will request a given object. It could speedup the transfer by sending it before having received a client request. This is the `push` feature of HTTP/2.0. A server can independently push web objects to a client without having received any request. This feature can only be used by the server if the client has enabled it by sending `SETTINGS_ENABLE_PUSH` in its `Settings` frame. A classical use case for this `push` feature is to enable a server to automatically send an object which cannot be cached by the client, such as a dynamic javascript code, when another web object that references it is requested. However, measurement studies indicate that very few web servers seem to have adopted this feature [ZWH2018]_. 994/10000 · 994
31 ../../protocols/ipv6.rst:119
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``2001:db8:0:0:8:800:200c:417a`` is represented as ``2001:db8::8:800:200c:417a`` 82/10000 · 82
31 ../../protocols/ethernet.rst:96
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — delivers frames to their destination with a very high probability of successful delivery 88/10000 · 88
31 ../../protocols/routing.rst:97
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `RC` advertises `2001:db8:5678::/48` at a distance of `2` and `2001:db8:1234::/48` at a distance of `3` 103/10000 · 103
31 ../../protocols/rpc.rst:116
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `id`: the same identifier as the identifier chosen by the caller 64/10000 · 64
31 ../../protocols/ssh.rst:228
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``padding`` : random bytes added in each message (at least four) to ensure that the message length is a multiple of the block size used by the negotiated encryption algorithm 174/10000 · 174