2. cnp3-ebook
3. English
4. Zen

15 ../../exercises/ipv6.rst:45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The forwarding paths used in a network depend on the forwarding tables installed in the network nodes. Sometimes, these forwarding tables must be configured manually. 166/10000 · 166
15 ../../exercises/lan.rst:93
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Most commercial Ethernet switches are able to run the Spanning tree protocol independently on each VLAN. What are the benefits of using per-VLAN spanning trees ? 161/10000 · 161
15 ../../exercises/routing-policies.rst:153
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — How is the reachability of these addresses affected when link `R1`-`R3` fails ? 79/10000 · 79
15 ../../exercises/routing-protocols.rst:241
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first packet that this router received his a Hello packet that was sent by router ``r2``. There are several interesting points to note about this packet. First, its source address is the link-local address (``fe80::68bc:b4ff:fe19:42b7``) of router ``r2`` on this interface. The destination address of the packet is reserved IPv6 multicast address for OSPFv3, i.e. ``ff02::5``. The Hop Limit of the packet is set to 1 and OSFPv3 uses a next header of type 89. 462/10000 · 462
15 ../../exercises/tcp-2.rst:86
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Each line of a packetdrill_ script starts with a `timing` parameter that indicates at what time the event specified on this line should happen. packetdrill_ supports absolute and relative timings. An absolute timing is simply a number that indicates the delay in seconds between the start of the script and the event. A relative timing is indicated by using ``+`` followed by a number. This number is then the delay in seconds between the previous event and the current line. Additional information may be found in [CCB+2013]_. 528/10000 · 528
15 ../../exercises/trace.rst:94
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The wireshark_ window is divided in three parts. The top part of the window is a summary of the first packets from the trace. By clicking on one of the lines, you can show the detailed content of this packet in the middle part of the window. The middle of the window allows you to inspect all the fields of the captured packet. The bottom part of the window is the hexadecimal representation of the packet, with the field selected in the middle window being highlighted. 470/10000 · 470
15 ../../protocols/bgp.rst:57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — over a `customer->provider` relationship, the `customer` domain advertises to its `provider` its own prefixes and all the routes that it has learned from its own customers. 173/10000 · 173
15 ../../protocols/congestion.rst:91
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Initial congestion window 25/10000 · 25
15 ../../protocols/dnssec.rst:166
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `RRSIG` record is used to encode the signature of a DNS record. This record contains several sub-fields. The most important ones are the algorithm used to generate the signature, the identifier of the public key used to sign the record, the original TTL of the signed record and the validity period for the signature. 321/10000 · 321
15 ../../protocols/email.rst:100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The sender address. This header line starts with `From:`. This contains the (optional) name of the sender followed by its email address between `<` and `>`. Email addresses are always composed of a username followed by the `@` sign and a domain name. 250/10000 · 250
15 ../../protocols/ethernet.rst:94
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An Ethernet network provides an unreliable connectionless service. It supports three different transmission modes : `unicast`, `multicast` and `broadcast`. While the Ethernet service is unreliable in theory, a good Ethernet network should, in practice, provide a service that: 276/10000 · 276
15 ../../protocols/http.rst:75
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first component of a URI is its `scheme`. A `scheme` can be seen as a selector, indicating the meaning of the fields after it. In practice, the scheme often identifies the application-layer protocol that must be used by the client to retrieve the document, but it is not always the case. Some schemes do not imply a protocol at all and some do not indicate a retrievable document [#furiretrieve]_. The most frequent schemes are `http` and `https`. We focus on `http` in this section. A URI scheme can be defined for almost any application layer protocol [#furilist]_. The characters `:` and `//` follow the `scheme` of any URI. 631/10000 · 631
15 ../../protocols/ipv6.rst:91
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — SIPP proposed in :rfc:`1710` 28/10000 · 28
15 ../../protocols/ppp.rst:37
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The IANA maintains the registry of all assigned PPP protocol fields at : http://www.iana.org/assignments/ppp-numbers 116/10000 · 116
15 ../../protocols/routing.rst:50
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Each RIP message contains a set of route entries. Each route entry is encoded as a 20 bytes field whose format is shown below. RIP was initially designed to be suitable for different network layer protocols. Some implementations of RIP were used in XNS or IPX networks :rfc:`2453`. The format of the route entries used by :rfc:`2080` is shown below. `Prefix length` is the length of the subnet identifier in bits and the `metric` is encoded as one byte. The maximum metric supported by RIP is `15`. 498/10000 · 498
15 ../../protocols/rpc.rst:43
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — XDR also supports 64 bits integers and booleans. The booleans are mapped onto integers (`0` for `false` and `1` for `true`). For the floating point numbers, the encoding defined in the IEEE standard is used. 207/10000 · 207
15 ../../protocols/ssh.rst:131
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Once the cryptographic algorithms have been negotiated, the key exchange algorithm is used to negotiate a secret key that will be shared by the client and the server. These key exchange algorithms include some variations over the basic algorithms. As an example, let us analyze how the Diffie Hellman key exchange algorithm is used within the ``ssh`` protocol. In this case, each host has both a private and a public key. 421/10000 · 421
15 ../../protocols/tcp.rst:40
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the address of the server 25/10000 · 25
15 ../../protocols/tls.rst:45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — NNTP 4/10000 · 4
15 ../../protocols/transport-service.rst:51
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `abcd:ef01:2345:6789:abcd:ef01:2345:6789` 41/10000 · 41