2. cnp3-ebook
3. English
4. Zen

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
31 ../../protocols/tcp.rst:99
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The rest of this section is organized as follows. We first explain the establishment and the release of a TCP connection, then we discuss the mechanisms that are used by TCP to provide a reliable bytestream service. We end the section with a discussion of network congestion and explain the mechanisms that TCP uses to avoid congestion collapse. 345/10000 · 345
31 ../../protocols/tls.rst:101
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Securely agree on the keys that will be used to encrypt and authenticate the messages exchanged over the TLS session 116/10000 · 116
31 ../../protocols/wifi.rst:26
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 70/250 6/10000 · 6
31 ../../principles/referencemodels.rst:221
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In contrast with OSI, the TCP/IP community did not spend a lot of effort defining a detailed reference model; in fact, the goals of the Internet architecture were only documented after TCP/IP had been deployed [Clark88]_. :rfc:`1122`, which defines the requirements for Internet hosts, mentions four different layers. Starting from the top, these are : 352/10000 · 352
31 ../../glossary.rst:222
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Domain Name System is a distributed database that can be queried by hosts to map names onto IP addresses. It is defined in :rfc:`1035` 138/10000 · 138
31 ../../exercises/routing-protocols.rst:370
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Later, router ``r2`` will regularly transmit its distance vector inside an unsolicited response message that is sent towards the IPv6 multicast address ``ff02::9``. 164/10000 · 164
32 ../../exercises/ex-sharing.rst:610
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If host `A` uses a window of two segments and needs to transmit five segments of data. How long does the entire transfer lasts ? 128/10000 · 128
32 ../../exercises/sockets.rst:286
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Now that we created an IPv6 socket, we can use it to reach another program if we know its IPv6 address. IPv6 addresses have a human-readable format that can be represented as a string of characters. The details of IPv6 addresses are out of scope of this section but here are some examples : 290/10000 · 290
32 ../../principles/naming.rst:142
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The :term:`hosts.txt` file is not maintained anymore. A historical snapshot from April 1984 is available from http://ftp.univie.ac.at/netinfo/netinfo/hosts.txt 159/10000 · 159
32 ../../principles/network.rst:217
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The simplest `control plane` for a network is to manually compute the forwarding tables of all routers inside the network. This simple control plane is sufficient when the network is (very) small, usually up to a few routers. 225/10000 · 225
32 ../../principles/referencemodels.rst:223
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the Application layer 21/10000 · 21
32 ../../principles/reliability.rst:128
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A similar reasoning applies when the clock of the sending host is slower than the clock of the receiving host. In this case, the receiver will sense more bits than the bits that have been transmitted by the sender. This is illustrated in the figure below where the second bit received on the right was not transmitted by the left host. 335/10000 · 335
32 ../../exercises/network.rst:282
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — At this point, a new link is added between `R1` and `R3`. What happens for the forwarding of packets ? 102/10000 · 102
32 ../../glossary.rst:168
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — eBGP 4/10000 · 4
32 ../../exercises/reliability.rst:62
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Implement a small software that computes the CRC-32 for a text file. Then, modify the contents of the file to change an even number of bits or an odd number of bits inside the file. When modifying the file, remember that an ASCII file is composed of 8 bits characters that are encoded by using the ASCII table that you can find at : http://en.wikipedia.org/wiki/ASCII . You can also write a small program that produces binary files that are a small variation of each other. 473/10000 · 473
32 ../../principles/sharing.rst:216
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As explained earlier, one of the first manifestation of congestion on network nodes is the saturation of the network links that leads to a growth in the occupancy of the buffers of the node. This growth of the buffer occupancy implies that some packets will spend more time in the buffer and thus in the network. If hosts measure the network delays (e.g. by measuring the round-trip-time between the transmission of a packet and the return of the corresponding acknowledgment) they could start to sense congestion. On low bandwidth links, a growth in the buffer occupancy can lead to an increase of the delays which can be easily measured by the end hosts. On high bandwidth links, a few packets inside the buffer will cause a small variation in the delay which may not necessarily be larger that the natural fluctuations of the delay measurements. 848/10000 · 848
32 ../../principles/transport.rst:85
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `carriage return` (`CR`) : `0001101b` 37/10000 · 37
32 ../../principles/security.rst:368
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a private key (:math:`K_{priv}`) that he needs to store in a secure manner and never reveal to anyone 101/10000 · 101