2. cnp3-ebook
3. English
4. Zen

67 ../../exercises/tcp-2.rst:885
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — By default, packetdrill_ uses port 8080 when creating TCP segments. You can thus capture the packets injected by packetdrill_ and the responses from the stack by using ``tcpdump -i any -n port 8080`` 199/10000 · 199
67 ../../protocols/bgp.rst:282
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `BGP nexthop` 17/10000 · 17
67 ../../protocols/email.rst:236
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — C 1/10000 · 1
67 ../../protocols/ethernet.rst:309
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first Ethernet relays that operated in the datalink layers were called `bridges`. In practice, the main difference between switches and bridges is that bridges were usually implemented in software while switches are hardware-based devices. Throughout this text, we always use `switch` when referring to a relay in the datalink layer, but you might still see the word `bridge`. 380/10000 · 380
67 ../../protocols/http.rst:311
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The example below shows the operation of HTTP/1.1 over a persistent TCP connection to retrieve three URIs stored on the same server. Once the connection has been established, the client sends its first request with the `Connection: Keep-Alive` header to request a persistent connection. 286/10000 · 286
67 ../../protocols/ipv6.rst:230
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — For the companies that want to use IPv6 without being connected to the IPv6 Internet, :rfc:`4193` defines the `Unique Local Unicast (ULA)` addresses (``fc00::/7``). These ULA addresses play a similar role as the private IPv4 addresses defined in :rfc:`1918`. However, the size of the ``fc00::/7`` address block allows ULA to be much more flexible than private IPv4 addresses. 375/10000 · 375
67 ../../protocols/ethernet.rst:201
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — These network interfaces compute the TCP checksum while a segment is transferred from the host memory to the network interface [SH2004]_. 137/10000 · 137
67 ../../protocols/tcp.rst:225
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the first byte indicates the `type` of the option. 50/10000 · 50
67 ../../protocols/tls.rst:361
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — MAC-then-encrypt or Encrypt-then-MAC 36/10000 · 36
68 ../../exercises/network.rst:383
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consider the same distance vector protocol, but now with `triggered updates`. When link `B-C` fails, assume that `B` updates its routing table immediately and sends its distance vector to `A` and `D`. Assume that both `A` and `D` process the received distance vector and that `A` sends its own distance vector, ... Indicate all the distance vectors that are exchanged and update the table above each time a distance vector is sent by a router (and received by other routers) until all routers have learned a new route to each destination. How many distance vector messages must be exchanged until the network converges to a stable state ? 638/10000 · 638
68 ../../glossary.rst:159
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — IGRP 4/10000 · 4
68 ../../principles/network.rst:411
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consider in the network above that host `A` wants to send a 900 bytes packet (870 bytes of payload and 30 bytes of header) to host `B` via router `R1`. Host `A` encapsulates this packet inside a single frame. The frame is received by router `R1` which extracts the packet. Router `R1` has three possible options to process this packet. 335/10000 · 335
68 ../../principles/reliability.rst:251
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `@` : `1000000` b 17/10000 · 17
68 ../../principles/transport.rst:255
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The connectionless service 26/10000 · 26
68 ../../principles/security.rst:837
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To cope with some of the above mentioned problems, public-key cryptography is usually combined with certificates. A `certificate` is a data structure that includes a signature from a trusted third party. A simple explanation of the utilization of certificates is to consider that Alice and Bob both know Ted. Ted is trusted by these two users and both have stored Ted's public key : :math:`Ted_{pub}`. Since they both know Ted's key, he can issue certificates. A certificate is mainly a cryptographic link between the identity of a user and his/her public key. Such a certificate can be computed in different ways. A simple solution is for Ted to generate a file that contains the following information for each certified user : 728/10000 · 728
68 ../../exercises/ipv6.rst:615
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``2001:db8:1341:1::/64`` on the link between ``b`` and ``r3`` 61/10000 · 61
68 ../../exercises/routing-protocols.rst:930
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Without a BGP session between ``AS2`` and ``AS3``, there are reachability problems in this simple Internet. 107/10000 · 107
68 ../../exercises/tcp-2.rst:887
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Push` flag is one of the TCP flags defined in :rfc:`793`. TCP stacks usually set this flag when transmitting a segment that empties the send buffer. This is the reason why we observe this push flag in our example. 218/10000 · 218
68 ../../protocols/bgp.rst:283
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the attributes including the AS-Path 36/10000 · 36
68 ../../protocols/email.rst:236
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 19 2/10000 · 2