2. cnp3-ebook
3. English
4. Zen

14 ../../protocols/bgp.rst:55
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To understand the `customer->provider` relationship, let us consider the simple internetwork shown in the figure above. In this internetwork, `AS7` is a stub domain that is connected to one provider : `AS4`. The contract between `AS4` and `AS7` allows a host inside `AS7` to exchange packets with any host in the internetwork. To enable this exchange of packets, `AS7` must know a route towards any domain and all the domains of the internetwork must know a route via `AS4` that allows them to reach hosts inside `AS7`. From a routing perspective, the commercial contract between `AS7` and `AS4` leads to the following routes being exchanged : 643/10000 · 643
14 ../../protocols/congestion.rst:89
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Furthermore when a TCP connection has been idle for more than its current retransmission timer, it should reset its congestion window to the congestion window size that it uses when the connection begins, as it no longer knows the current congestion state of the network. 271/10000 · 271
14 ../../protocols/dnssec.rst:161
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `DNSKEY` record allows storing the public key associated with a zone. This record is encoded as a TLV and includes a `Base64` representation of the key and the identification of the public key algorithm. This allows the `DNSKEY` record to support different public key algorithms. 283/10000 · 283
14 ../../protocols/email.rst:98
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The email header contains several lines that all begin with a keyword followed by a colon and additional information. The format of email messages and the different types of header lines are defined in :rfc:`5322`. Two of these header lines are mandatory and must appear in all email messages : 294/10000 · 294
14 ../../protocols/ethernet.rst:92
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — What is the Ethernet service ? 30/10000 · 30
14 ../../protocols/http.rst:58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first components of the `world wide web` are the Uniform Resource Identifiers (URI), defined in :rfc:`3986`. A URI is a character string that unambiguously identifies a resource on the world wide web. Here is a subset of the BNF for URIs :: 244/10000 · 244
14 ../../protocols/ipv6.rst:90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — PIP proposed in :rfc:`1621` 27/10000 · 27
14 ../../protocols/ppp.rst:35
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `LAPB <http://en.wikipedia.org/wiki/LAPB>`_ and `HDLC <http://en.wikipedia.org/wiki/HDLC>`_ were widely used datalink layer protocols. 134/10000 · 134
14 ../../protocols/routing.rst:46
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The RIP message format 22/10000 · 22
14 ../../protocols/rpc.rst:36
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — For basic data types, :rfc:`1832` simply maps their representation into a sequence of bytes. For example a 32 bits integer is transmitted as follows (with the most significant byte first, which corresponds to big-endian encoding). 230/10000 · 230
14 ../../protocols/ssh.rst:121
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This negotiation of the cryptographic algorithms allows the implementations to evolve when new algorithms are proposed. If a client is upgraded, it can announce a new algorithm as its preferred one even if the server is not yet upgraded. 237/10000 · 237
14 ../../protocols/tcp.rst:39
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the address of the client 25/10000 · 25
14 ../../protocols/tls.rst:44
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 993 3/10000 · 3
14 ../../protocols/transport-service.rst:49
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — It is sometimes necessary to write IPv6 addresses in text format, e.g. when manually configuring addresses or for documentation purposes. The preferred format for writing IPv6 addresses is `x:x:x:x:x:x:x:x`, where the `x` 's are hexadecimal digits representing the eight 16-bit parts of the address. Here are a few examples of IPv6 addresses : 343/10000 · 343
14 ../../protocols/udp.rst:56
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a 16 bits checksum 18/10000 · 18
14 ../../protocols/wifi.rst:22
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 2 Mbps 6/10000 · 6
14 ../../protocols/http2.rst:72
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Two directions have been explored to improve the delivery of these web pages. The first direction is to tune the HTTP protocol. The second approach is to change the entire network stack. We will discuss this approach after having covered the entire stack. 255/10000 · 255
14 ../../bibliography.rst:20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Arlitt, M. and Williamson, C. 2005. `An analysis of TCP reset behaviour on the internet <http://doi.acm.org/10.1145/1052812.1052823>`_. SIGCOMM Computer Communication Review 35, 1 (Jan. 2005), 37-44. 199/10000 · 199
14 ../../glossary.rst:12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ASCII 5/10000 · 5
15 ../../exercises/ex-sharing.rst:316
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An important part of the CSMA/CD algorithm is the exponential backoff. To illustrate the operation of this algorithm, let us consider a cable that has a length of one kilometer. The bandwidth of the network is set to 10 Mbps. Assume that when a collision occurs, host A always selects the highest possible random delay according to the exponential backoff algorithm while host B always selects the shortest one. In this network, the slot time is equal to the time required to transmit 100 bits. We further assume that a host can detect collision immediately (i.e. as soon as the other frame arrives). 600/10000 · 600