2. cnp3-ebook
3. English
4. Zen

29 ../../exercises/ex-sharing.rst:588
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Simple network topology 23/10000 · 23
29 ../../exercises/sockets.rst:266
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A program can use the ``socket`` system call to create a new socket. 68/10000 · 68
29 ../../principles/network.rst:205
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Any solution which is used to compute the forwarding tables of a network must ensure that all destinations are reachable from any source. This implies that it must guarantee the absence of black holes and forwarding loops. 222/10000 · 222
29 ../../principles/referencemodels.rst:215
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Two reference models have been successful in the networking community : the OSI reference model and the TCP/IP reference model. We discuss them briefly in this section. 168/10000 · 168
29 ../../exercises/reliability.rst:57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Cyclic Redundancy Checks (CRCs) are efficient error detection codes that are able to detect : 97/10000 · 97
29 ../../glossary.rst:270
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A synonym for a regular telephone line, i.e. a line that can be used to dial any telephone number. 98/10000 · 98
29 ../../principles/sharing.rst:204
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a network node forwards small packets, its performance is usually limited by the number of lookup operations that it can perform every second. This lookup performance is measured in packets per second. The performance may depend on the length of the forwarded packets. The key performance factor is the number of minimal size packets that are forwarded by the node every second. This rate can lead to a capacity in bits per second which is much lower than the sum of the bandwidth of the node's links. 506/10000 · 506
29 ../../principles/transport.rst:80
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `@` : `1000000b` 16/10000 · 16
29 ../../principles/security.rst:354
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — AES is widely used as of this writing, but other secret key encryption schemes continue to appear. ChaCha20, proposed by D. Bernstein is now used by several internet protocols :rfc:`7539`. A detailed discussion of encryption schemes is outside the scope of this book. We will consider encryption schemes as black boxes whose operation depends on a single key. A detailed overview of several of these schemes may be found in [MVV2011]_. 435/10000 · 435
29 ../../exercises/dns.rst:81
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The DNS protocol can run over UDP and over TCP. Most DNS servers prefer to use UDP because it consumes fewer resources on the server. However, TCP is useful when a large answer is expected. Compare `time dig +tcp` and `time dig` to query a root DNS server. Is it faster to receive an answer via TCP or via UDP ? 311/10000 · 311
29 ../../exercises/ipv6.rst:292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consider the network below that contains only routers. This network has been configured by a group of students and you must verify whether the configuration is correct. All the IPv6 addresses are part of the same ``/48`` prefix that we name ``p``. The following subnets are defined in this ``/48`` prefix. 305/10000 · 305
29 ../../exercises/routing-protocols.rst:362
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a router starts, it sends a request message. This is illustrated in the figure below with the first message sent by router ``r2``. This message is sent inside an IPv6 packet whose source address is the link-local address of the router and the destination address is ``ff02::9`` which is the reserved multicast address for RIPng. 333/10000 · 333
29 ../../exercises/tcp-2.rst:167
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another example is the simultaneous establishment of a TCP connection. The TCP stack sends a ``SYN`` and receives a ``SYN`` in response instead of a ``SYN+ACK``. It then acknowledges the received ``SYN`` and retransmits its own ``SYN``. The connection becomes established upon reception of the fourth segment. This script is available from :download:`/exercises/packetdrill_scripts/dual.pkt`. 392/10000 · 392
29 ../../protocols/bgp.rst:97
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Border Gateway Protocol 27/10000 · 27
29 ../../protocols/congestion.rst:177
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — routers that have a single FIFO queue 37/10000 · 37
29 ../../protocols/dnssec.rst:331
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Footnotes 9/10000 · 9
29 ../../protocols/email.rst:170
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To solve this problem, the IETF_ developed the Multipurpose Internet Mail Extensions (:term:`MIME`). These extensions were carefully designed to allow Internet email to carry non-ASCII characters and binary files without breaking the email servers that were deployed at that time. This requirement for backward compatibility forced the MIME designers to develop extensions to the existing email message format :rfc:`822` instead of defining a completely new format that would have been better suited to support the new types of emails. 535/10000 · 535
29 ../../protocols/ethernet.rst:171
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Thick coaxial cable, 500m 25/10000 · 25
29 ../../protocols/http.rst:120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The response sent by the server also contains three parts : 59/10000 · 59
29 ../../protocols/http2.rst:224
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The HTTP/2.0 streams can provide performance benefits, but they also increase the complexity of the implementations since an HTTP/2.0 receiver must be able to simultaneously process frames that correspond to different web objects. This complexity mainly resides on the client side. The HTTP/2.0 protocol includes several techniques that enable clients to manage the utilization of the HTTP/2.0 session. 402/10000 · 402