2. cnp3-ebook
3. English
4. Zen

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
68 ../../principles/sharing.rst:442
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — TDM and FDM are widely used in telephone networks to support fixed bandwidth conversations. Using them in Local Area Networks that support computers would probably be inefficient. Computers usually do not send information at a fixed rate. Instead, they often have an on-off behavior. During the on period, the computer tries to send at the highest possible rate, e.g. to transfer a file. During the off period, which is often much longer than the on period, the computer does not transmit any packet. Using a static allocation scheme for computers attached to a LAN would lead to huge inefficiencies, as they would only be able to transmit at :math:`\frac{1}{N}` of the total bandwidth during their on period, despite the fact that the other computers are in their off period and thus do not need to transmit any information. The dynamic MAC algorithms discussed in the remainder of this chapter aim to solve this problem. 922/10000 · 922
69 ../../exercises/network.rst:385
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consider again the network shown above. After some time, link state routing converges and all routers compute the same routing tables as above. 143/10000 · 143
69 ../../glossary.rst:161
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Interior Gateway Routing Protocol (IGRP) is a proprietary intradomain routing protocol that uses distance vector. IGRP supports multiple metrics for each route but has been replaced by :term:`EIGRP` 202/10000 · 202
69 ../../principles/network.rst:413
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The packet is too large and router `R1` cannot forward it to router `R2`. It rejects the packet and sends a control packet back to the source (host `A`) to indicate that it cannot forward packets longer than 500 bytes (minus the packet header). The source could react to this control packet by retransmitting the information in smaller packets. 344/10000 · 344
69 ../../principles/reliability.rst:252
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `space` : `0100000` b 21/10000 · 21
69 ../../principles/sharing.rst:446
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ALOHA 5/10000 · 5
69 ../../principles/transport.rst:257
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `connectionless service` that we have described earlier is frequently used by users who need to exchange small SDUs. It can be easily built on top of the connectionless network layer service that we have described earlier. Users needing to either send or receive several different and potentially large SDUs, or who need structured exchanges often prefer the `connection-oriented service`. 393/10000 · 393
69 ../../principles/security.rst:849
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — his/her identity 16/10000 · 16
69 ../../exercises/ipv6.rst:617
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We can then manually configure the IPv6 addresses of each host/router on each link. Let us start with the links attached to the two hosts. 138/10000 · 138
69 ../../exercises/routing-protocols.rst:941
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We can fix them by enabling again the BGP session with the `no neighbor 2001:cafe:2:23::3 shutdown` command. 108/10000 · 108
69 ../../exercises/tcp-2.rst:889
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The variables that are included in TCP_INFO are defined in https://github.com/torvalds/linux/blob/master/include/uapi/linux/tcp.h 129/10000 · 129
69 ../../protocols/bgp.rst:285
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We use the notation `U(prefix, nexthop, attributes)` to represent such a `BGP Update` message in this section. Similarly, `W(prefix)` represents a `BGP withdraw` for the specified prefix. Once the `R1-R2` session has been established, `R1` sends `U(2001:db8:1234::/48,2001:db8::5,AS10)` to `R2` and `R2` sends `U(2001:db8:5678:/48,2001:db8::6,AS20)`. At this point, `R1` can reach `2001:db8:5678::/48` via `2001:db8::6` and `R2` can reach `2001:db8:1234::/48` via `2001:db8::5`. 478/10000 · 478
69 ../../protocols/email.rst:236
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — T 1/10000 · 1
69 ../../protocols/ethernet.rst:316
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Spanning Tree Protocol` (STP), proposed in [Perlman1985]_, is a distributed protocol that is used by switches to reduce the network topology to a spanning tree, so that there are no cycles in the topology. For example, consider the network shown in the figure below. In this figure, each bold line corresponds to an Ethernet to which two Ethernet switches are attached. This network contains several cycles that must be broken to allow Ethernet switches, using the MAC address learning algorithm, to exchange frames. 521/10000 · 521