2. cnp3-ebook
3. English
4. Zen

15 ../../exercises/reliability.rst:32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The delay between the two hosts is `s` seconds in both directions 65/10000 · 65
15 ../../glossary.rst:14
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The American Standard Code for Information Interchange (ASCII) is a character-encoding scheme that defines a binary representation for characters. The ASCII table contains both printable characters and control characters. ASCII characters were encoded in 7 bits and only contained the characters required to write text in English. Other character sets such as Unicode have been developed later to support all written languages. 427/10000 · 427
15 ../../exercises/transport.rst:132
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Practice 8/10000 · 8
15 ../../principles/sharing.rst:152
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the above network, the allocation of all flows would grow until `A1-A2` and `B1-B2` reach 5 Mbps. At this point, link `R1-R2` becomes congested and these two flows have reached their maximum. The allocation for flow `C1-C2` can increase until reaching 15 Mbps. At this point, link `R2-R3` is congested. To increase the bandwidth allocated to `C1-C2`, one would need to reduce the allocation to flow `B1-B2`. Similarly, the only way to increase the allocation to flow `B1-B2` would require a decrease of the allocation to `A1-A2`. 532/10000 · 532
15 ../../principles/transport.rst:58 • ../../principles/transport.rst:64
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bob : `What is the secret password ?` 37/10000 · 37
15 ../../protocols/dns.rst:53
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `RDLength` field is the length of the `RData` field that contains the information of the type specified in the `Type` field. 128/10000 · 128
15 ../../principles/security.rst:198
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In practice, there is a possibility of denial of service attacks as soon as there is a limited resource somewhere in the network. This resource can be the bandwidth of a link, but it could also be the computational power of a server, its memory or even the size of tables used by a given protocol implementation. Defending against real DoS attacks can be difficult, especially if the attacker controls a large number of sources that are used to launch the attacks. In terms of bandwidth, DoS attacks composed of a few Gbps to a few tens of Gbps of traffic are frequent on the Internet. In 2015, `github.com <http://www.github.com>`_ suffered from a distributed DoS that reached a top bandwidth of 400 Gbps according to some `reports <http://www.techworld.com/news/security/worlds-largest-ddos-attack-reached-400gbps-says-arbor-networks-3595715/>`_. 848/10000 · 848
15 ../../exercises/dns.rst:48
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When run without any parameter, `dig` queries one of the root DNS servers and retrieves the list of the names of all root DNS servers. For technical reasons, there are only 13 different root DNS servers. This information is also available as a text file from http://www.internic.net/zones/named.root. What are the IPv6 addresses of all these servers? 350/10000 · 350
15 ../../exercises/http.rst:50
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Footnotes 9/10000 · 9
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