2. cnp3-ebook
3. English
4. Zen

65 ../../protocols/ipv6.rst:219
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a packet with destination ``2001:6a8:3880:40::2`` matches two routes : ``2001:6a8::/32`` and ``::/0``. The packet is forwarded via ``fe80::aaaa:bbbb`` 150/10000 · 150
65 ../../protocols/ethernet.rst:197
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The official list of all assigned Ethernet type values is available from http://standards.ieee.org/regauth/ethertype/eth.txt 124/10000 · 124
65 ../../protocols/tcp.rst:221
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another utilization of TCP options during connection establishment is to enable TCP extensions. For example, consider :rfc:`1323` (which is discussed in :ref:`TCPReliable`). :rfc:`1323` defines TCP extensions to support timestamps and larger windows. If the client supports :rfc:`1323`, it adds a :rfc:`1323` option to its `SYN` segment. If the server understands this :rfc:`1323` option and wishes to use it, it replies with a :rfc:`1323` option in the `SYN+ACK` segment and the extension defined in :rfc:`1323` is used throughout the TCP connection. Otherwise, if the server's `SYN+ACK` does not contain the :rfc:`1323` option, the client is not allowed to use this extension and the corresponding TCP header options throughout the TCP connection. TCP's option mechanism is flexible and it allows the extension of TCP while maintaining compatibility with older implementations. 879/10000 · 879
65 ../../protocols/tls.rst:339
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a `TLSPlainText` that contains the encrypted data 49/10000 · 49
65 ../../principles/network.rst:387
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Despite their popularity, `hierarchical addresses` have some drawbacks. Their first drawback is that a lookup in the forwarding table is more complex than when using `flat addresses`. For example, on the Internet, network nodes have to perform a longest-match to forward each packet. This is partially compensated by the reduction in the size of the forwarding tables, but the additional complexity of the lookup operation has been a difficulty to implement hardware support for packet forwarding. A second drawback of the utilization of hierarchical addresses is that when a host connects for the first time to a network, it must contact one router to determine its own address. This requires some packet exchanges between the host and some routers. Furthermore, if a host moves and is attached to another routers, its network address will change. This can be an issue with some mobile hosts. 893/10000 · 893
65 ../../bibliography.rst:86
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Griffin, T. G., Shepherd, F. B., and Wilfong, G., `The stable paths problem and interdomain routing <https://dx.doi.org/10.1109/90.993304>`_. IEEE/ACM Transactions Networking 10, 2 (Apr. 2002), 232-243 201/10000 · 201
66 ../../exercises/network.rst:379
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Distance vector protocols can operate in two different modes : `periodic updates` and `triggered updates`. `Periodic updates` is the default mode for a distance vector protocol. For example, each router could advertise its distance vector every thirty seconds. With the `triggered updates` a router sends its distance vector when its routing table changes (and periodically when there are no changes). 401/10000 · 401
66 ../../glossary.rst:144
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — IGP 3/10000 · 3
66 ../../principles/network.rst:390
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Dealing with heterogeneous datalink layers 42/10000 · 42
66 ../../principles/reliability.rst:249
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `0` : `0110000` b 17/10000 · 17
66 ../../principles/sharing.rst:402
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Time Division Multiplexing` (TDM) is a static bandwidth allocation method that was initially defined for the telephone network. In the fixed telephone network, a voice conversation is usually transmitted as a 64 Kbps signal. Thus, a telephone conservation generates 8 KBytes per second or one byte every 125 microseconds. Telephone conversations often need to be multiplexed together on a single line. For example, in Europe, thirty 64 Kbps voice signals are multiplexed over a single 2 Mbps (E1) line. This is done by using `Time Division Multiplexing` (TDM). TDM divides the transmission opportunities into slots. In the telephone network, a slot corresponds to 125 microseconds. A position inside each slot is reserved for each voice signal. The figure below illustrates TDM on a link that is used to carry four voice conversations. The vertical lines represent the slot boundaries and the letters the different voice conversations. One byte from each voice conversation is sent during each 125 microseconds slot. The byte corresponding to a given conversation is always sent at the same position in each slot. 1115/10000 · 1115
66 ../../principles/transport.rst:251
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `connection oriented service` 33/10000 · 33
66 ../../principles/security.rst:799
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In this exchange, Bob authenticates himself by signing the :math:`RA` nonce that was sent by Mallory. Now, to authenticate as Alice, Mallory needs to compute the signature of nonce :math:`RB` with Alice's private key. Mallory does not know Alice's key, but he could exploit the protocol to force Alice to perform the required computation. For this, Mallory can start an authentication to Alice as shown below. 409/10000 · 409
66 ../../exercises/ipv6.rst:613
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``2001:db8:1341:13::/64`` on the link between ``r1`` and ``r3`` 63/10000 · 63
66 ../../exercises/routing-protocols.rst:900
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We can now disable one of the BGP sessions on router `as2` as follows. 70/10000 · 70
66 ../../exercises/tcp-2.rst:883
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — packetdrill_ requires root privileges since it inject raw IP packets. The easiest way to install it is to use a virtualbox image with a Linux kernel 4.x or 5.x. You can clone its git repository from https://github.com/google/packetdrill and follow the instructions in https://github.com/google/packetdrill/tree/master/gtests/net/packetdrill. The packetdrill_ scripts used in this section are available from https://github.com/cnp3/ebook/tree/master/exercises/packetdrill_scripts 478/10000 · 478
66 ../../protocols/bgp.rst:281
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the advertised prefix 21/10000 · 21
66 ../../protocols/email.rst:236 • ../../protocols/email.rst:238
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 2 1/10000 · 1
66 ../../protocols/ethernet.rst:305
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `MAC address learning` algorithm allows switches to be plug-and-play. Unfortunately, the loops that arise when the network topology is not a tree are a severe problem. Forcing the switches to only be used in tree-shaped networks as hubs would be a severe limitation. To solve this problem, the inventors of Ethernet switches have developed the `Spanning Tree Protocol`. This protocol allows switches to automatically disable ports on Ethernet switches to ensure that the network does not contain any cycle that could cause frames to loop forever. 550/10000 · 550
66 ../../protocols/http.rst:309
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Keep-Alive:` header is used by the server to inform the client about how it agrees to use the persistent connection. A typical `Keep-Alive:` contains two parameters: the maximum number of requests that the server agrees to serve on the underlying TCP connection and the timeout (in seconds) after which the server will close an idle connection 348/10000 · 348