2. cnp3-ebook
3. English
4. Zen

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
68 ../../protocols/ethernet.rst:314
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Spanning Tree Protocol (802.1d) 35/10000 · 35
68 ../../protocols/http.rst:321
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The server replies with the `Connection: Keep-Alive` header and indicates that it accepts a maximum of 100 HTTP requests over this connection and that it will close the connection if it remains idle for 15 seconds. 214/10000 · 214
68 ../../protocols/ipv6.rst:234
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Furthermore, the IETF has reserved some IPv6 addresses for a special usage. The two most important ones are : 109/10000 · 109
68 ../../protocols/ethernet.rst:203
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fortunately, IEEE was able to define the [IEEE802.3]_ frame format while maintaining backward compatibility with the Ethernet [DIX]_ frame format. The trick was to only assign values above 1500 as `EtherType` values. When a host receives a frame, it can determine whether the frame's format by checking its `EtherType/Length` field. A value lower smaller than `1501` is clearly a length indicator and thus an [IEEE802.3]_ frame. A value larger than `1501` can only be type and thus a [DIX]_ frame. 497/10000 · 497
68 ../../protocols/tcp.rst:226
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the second byte indicates the total length of the option (including the first two bytes) in bytes 97/10000 · 97
68 ../../protocols/tls.rst:363
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When secure protocols use Message Authentication and Encryption, they need to specify how these two algorithms are combined. A first solution, which is used by the current version of TLS, is to compute the authentication code and then encrypt both the data and the authentication code. A drawback of this approach is that the receiver of an encrypted TLS record must first attempt to decrypt data that has potentially been modified by an attacker before being able to verify the authenticity of the record. A better approach is for the sender to first encrypt the data and then compute the authentication code over the encrypted data. This is the encrypt-then-MAC approach proposed in :rfc:`7366`. With encrypt-then-MAC, the receiver first checks the authentication code before attempting to decrypt the record. 811/10000 · 811
68 ../../bibliography.rst:90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Gast, M., `802.11 Wireless Networks : The Definitive Guide <http://books.google.com/books?id=9rHnRzzMHLIC&pgis=1>`_, O'Reilly, 2002 131/10000 · 131