2. cnp3-ebook
3. English
4. Zen

27 ../../exercises/reliability.rst:53
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the Fletcher checksum [Fletcher1982]_, see https://en.wikipedia.org/wiki/Fletcher%27s_checksum for implementation details. 122/10000 · 122
28 ../../exercises/ex-sharing.rst:582
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Compute the max-min fair bandwidth allocation in the network below. 67/10000 · 67
28 ../../exercises/sockets.rst:263
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Until now, we learned how to use sockets that were already created. When writing a whole program, you will have to create you own sockets and choose the concrete technology that it will use to communicate with others. In this section, we will create new sockets and allow a program to communicate with processes located on another computer using a network. The most recent standardized technology used to communicate through a network is the :term:`IPv6` network protocol. In the IPv6 protocol, hosts are identified using *IPv6 addresses*. Modern operating systems allow IPv6 network communications between programs to be done using the socket API, just as we did in the previous sections. 689/10000 · 689
28 ../../principles/network.rst:203
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A second type of problem may exist in networks using the datagram organization. Consider a path that contains a cycle. For example, router `R1` sends all packets towards destination `D` via router `R2`. Router `R2` forwards these packets to router `R3` and finally router `R3`'s forwarding table uses router `R1` as its nexthop to reach destination `D`. In this case, if a packet destined to `D` is received by router `R1`, it will loop on the `R1 -> R2 -> R3 -> R1` cycle and will never reach its final destination. As in the black hole case, the destination is not reachable from all sources in the network. In practice the loop problem is more annoying than the black hole problem because when a packet is caught in a forwarding loop, it unnecessarily consumes bandwidth. In the black hole case, the problematic packet is quickly discarded. We will see later that network layer protocols include techniques to minimize the impact of such forwarding loops. 958/10000 · 958
28 ../../principles/referencemodels.rst:212
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Reference models 16/10000 · 16
28 ../../exercises/network.rst:249
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `R1->R5->R4` and `R3->R2->R4` 29/10000 · 29
28 ../../glossary.rst:268
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — dial-up line 12/10000 · 12
28 ../../principles/sharing.rst:202
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The node's capacity in bits per second mainly depends on the physical interfaces that it uses and also on the capacity of the internal interconnection (bus, crossbar switch, ...) between the different interfaces inside the node. Many vendors, in particular for low-end devices will use the sum of the bandwidth of the nodes' interfaces as the node capacity in bits per second. Measurements do not always match this maximum theoretical capacity. A well designed network node will usually have a capacity in bits per second larger than the sum of its link capacities. Such nodes will usually reach this maximum capacity when forwarding large packets. 648/10000 · 648
28 ../../principles/transport.rst:79
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `z` : `1111010b` 16/10000 · 16
28 ../../principles/security.rst:329
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — AES or the Advanced Encryption Standard is an encryption scheme that was designed by the Belgian cryptographers Joan Daemen and Vincent Rijmen in 2001 [DR2002]_. This algorithm has been standardized by the U.S. National Institute of Standards and Technology (NIST). It is now used by a wide range of applications and various hardware and software implementations exist. Many microprocessors include special instructions that ease the implementation of AES. AES divides the message to be encrypted in blocks of 128 bits and uses keys of length 128, 192 or 256 bits. The block size and the key length are important parameters of an encryption scheme. The block size indicates the smallest message that can be encrypted and forces the sender to divide each message in blocks of the supported size. If the message is larger than an integer number of blocks, then the message must be padded before being encrypted and this padding must be removed after decryption. The key size indicates the resistance of the encryption scheme against brute force attacks, i.e. attacks where the attacker tries all possible keys to find the correct one. 1133/10000 · 1133
28 ../../exercises/dns.rst:79
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — sends DNS requests containing random identifiers 48/10000 · 48
28 ../../exercises/ipv6.rst:290
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Do your forwarding tables impose the path used to reach host ``B`` which is attached to router ``R4`` or do you need to configure an additional entry in these tables ? 167/10000 · 167
28 ../../exercises/routing-protocols.rst:360
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the responses that contain the router's routing table 53/10000 · 53
28 ../../exercises/tcp-2.rst:165
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The ``tcpi_state`` variable used in this script is returned by ``TCP_INFO`` [#ftcpinfo]_. It tracks the state of the TCP connection according to TCP's finite state machine [#fstates]_. This script is available from :download:`/exercises/packetdrill_scripts/client.pkt`. 269/10000 · 269
28 ../../protocols/bgp.rst:92
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Import and export policies 26/10000 · 26
28 ../../protocols/congestion.rst:175
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The last point that needs to be discussed about Explicit Congestion Notification is the algorithm that is used by routers to detect congestion. On a router, congestion manifests itself by the number of packets that are stored inside the router buffers. As explained earlier, we need to distinguish between two types of routers : 328/10000 · 328
28 ../../protocols/dnssec.rst:317
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If a resolver queries `delta.example.org`, the server will parse its zone. If this name were present, it would have been placed, in lexicographical order, between the `beta.example.org` and the `gamma.example.org` names. To confirm that the `delta.example.org` name does not exist, the server returns the `NSEC` record for `beta.example.org` that indicates that the next valid name after `beta.example.org` is `gamma.example.org`. If the server receives a query for `pi.example.org`, this is the `NSEC` record for `gamma.example.org` that will be returned. Since this record contains a name that is before `pi.example.org` in lexicographical order, this indicates that `pi.example.org` does not exist. 701/10000 · 701
28 ../../protocols/email.rst:166
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Initially, email was used to exchange small messages of ASCII text between computer scientists. However, with the growth of the Internet, supporting only ASCII text became a severe limitation for two reasons. First of all, non-English speakers wanted to write emails in their native language that often required more characters than those of the ASCII character table. Second, many users wanted to send other content than just ASCII text by email such as binary files, images or sound. 485/10000 · 485
28 ../../protocols/ethernet.rst:171
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 10Base5 7/10000 · 7
28 ../../protocols/http.rst:118
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — an optional MIME document attached to the request 49/10000 · 49