2. cnp3-ebook
3. English
4. Zen

45 ../../principles/reliability.rst:211
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Framing 7/10000 · 7
45 ../../principles/transport.rst:116
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The message mentioned above will be transmitted starting from the upper 32-bits word in network byte order. The first field is encoded in 16 bits. It is followed by eight one bit flags (`A-H`), a 24 bits field whose high order byte is shown in the first line and the two low order bytes appear in the second line followed by two one byte fields. This ASCII representation is frequently used when defining binary protocols. We will use it for all the binary protocols that are discussed in this book. 499/10000 · 499
45 ../../principles/security.rst:450
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — SHA-1 is a cryptographic hash function that was standardized by the NIST in 1995. It outputs 160 bits results. It is now used in a variety of network protocols. 160/10000 · 160
45 ../../exercises/ipv6.rst:474
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``p:0001::/64`` used on the link ``A2-R3``. ``A2`` uses address ``p:0001::A2/64`` 81/10000 · 81
45 ../../exercises/routing-protocols.rst:540
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We can also use :manpage:`traceroute6(8)` to check the path followed by the packets. Before doing that, think about the configuration of the BGP routing policies and try to predict the output of :manpage:`traceroute6(8)`. This is a good exercise to check your understanding of BGP. 281/10000 · 281
45 ../../exercises/tcp-2.rst:641
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the sender/receiver performs a single :manpage:`send(3)` of `x` bytes 69/10000 · 69
45 ../../protocols/bgp.rst:135
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the remainder of this chapter, and although all routing information is exchanged using BGP `UPDATE` messages, we assume for simplicity that a BGP message contains only information about one prefix and we use the words : 222/10000 · 222
45 ../../protocols/congestion.rst:216
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :math:`Throughput<\min(\frac{window}{rtt},\frac{k \times MSS}{rtt \times \sqrt{p}})` 84/10000 · 84
45 ../../protocols/email.rst:218
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — From ASCII to Unicode 21/10000 · 21
45 ../../protocols/ethernet.rst:179
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Optical fiber but also Category 6 UTP 37/10000 · 37
45 ../../protocols/http.rst:168
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Similarly, the following header lines can only appear inside HTTP requests sent by a client: 92/10000 · 92
45 ../../protocols/ipv6.rst:161
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the bottom half is used for the large campus 44/10000 · 44
45 ../../protocols/ethernet.rst:172
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 10Base2 7/10000 · 7
45 ../../protocols/routing.rst:144
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the routers that have detected the failure flood their updated link state packets in the network 96/10000 · 96
45 ../../protocols/tcp.rst:141
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Computing TCP's initial sequence number 39/10000 · 39
45 ../../protocols/tls.rst:212
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the ``ServerKeyExchange`` message is used by the server to transmit the information that is required to perform the key exchange. The content of this message is function of the selected key exchange algorithm. 209/10000 · 209
45 ../../protocols/wifi.rst:120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 802.11 RTS/CTS frames are used to reserve the transmission channel, in order to transmit one data frame and its acknowledgment. The RTS frames contain a `Duration` and the transmitter and receiver addresses. The `Duration` field of the RTS frame indicates the duration of the entire reservation (i.e. the time required to transmit the CTS, the data frame, the acknowledgments and the required SIFS delays). The CTS frame has the same format as the acknowledgment frame. 469/10000 · 469
45 ../../exercises/sockets.rst:335
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first possibility was named `big-endian` in a note written by Cohen [Cohen1980]_ while the second was named `little-endian`. Vendors of CPUs that used `big-endian` in memory insisted on using `big-endian` encoding in networked applications while vendors of CPUs that used `little-endian` recommended the opposite. Several studies were written on the relative merits of each type of encoding, but the discussion became almost a religious issue [Cohen1980]_. Eventually, the Internet chose the `big-endian` encoding, i.e. multi-byte fields are always transmitted by sending the most significant byte first, :rfc:`791` refers to this encoding as the :term:`network-byte order`. Most libraries [#fhtonl]_ used to write networked applications contain functions to convert multi-byte fields from memory to the network byte order and the reverse. 844/10000 · 844
45 ../../bibliography.rst:63
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Daemen, J., Rijmen, V., `The Design of Rijndael: AES – The Advanced Encryption Standard <http://www.springer.com/us/book/9783540425809>`_ Springer, 2002. ISBN 3-540-42580-2. 173/10000 · 173
45 ../../glossary.rst:219
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A wide area networking technology using virtual circuits that is deployed by telecom operators. 95/10000 · 95