2. cnp3-ebook
3. English
4. Zen

90 ../../protocols/ipv6.rst:343
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a host receives an IPv6 packet, it needs to determine which transport protocol (UDP, TCP, SCTP, ...) needs to handle the payload of the packet. This is the first role of the `Next header` field. The IANA_ which manages the allocation of Internet resources and protocol parameters, maintains an official list of transport protocols [#fianaprotocol]_. The following protocol numbers are reserved : 400/10000 · 400
90 ../../protocols/ethernet.rst:336
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `identifier` of the switch that sent the `BPDU` (`T`) 57/10000 · 57
90 ../../protocols/tcp.rst:266
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `snd.una` : the earliest sequence number that has been sent but has not yet been acknowledged 93/10000 · 93
90 ../../protocols/tls.rst:515
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Footnotes 9/10000 · 9
90 ../../bibliography.rst:114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Kotzias, P., Razaghpanah, A., Amann, J., Paterson, K.G., Vallina-Rodriguez, N. and Caballero, J., 2018, October. `Coming of age: A longitudinal study of TLS deployment <https://doi.org/10.1145/3278532.3278568>`_. In Proceedings of the Internet Measurement Conference 2018 (pp. 415-428). ACM. 291/10000 · 291
90 ../../principles/transport.rst:558
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the network layer may not deliver data in-order; 48/10000 · 48
91 ../../bibliography.rst:115
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Kleinrock, L., Tobagi, F., `Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and their Throughput-Delay Characteristics <https://dx.doi.org/10.1109/TCOM.1975.1092768>`_, IEEE Transactions on Communications, Vol. COM-23, No. 12, pp. 1400-1416, December 1975. 288/10000 · 288
91 ../../glossary.rst:276
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An :term:`ISO` standard that defines codes to represent countries and their subdivisions. See http://www.iso.org/iso/country_codes.htm 134/10000 · 134
91 ../../principles/network.rst:459 • ../../principles/network.rst:501 • ../../principles/network.rst:503 • ../../principles/network.rst:513 • ../../principles/network.rst:525 • ../../principles/network.rst:525 • ../../principles/network.rst:537 • ../../principles/network.rst:537
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 0 1/10000 · 1
91 ../../principles/reliability.rst:320
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the interactions between the user and the datalink layer entity are represented by using the classical `DATA.req` and the `DATA.ind` primitives 143/10000 · 143
91 ../../principles/sharing.rst:593
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The short-frame collision problem 33/10000 · 33
91 ../../principles/security.rst:958
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Alice and Bob have agreed on the secret information :math:`3` without having sent it explicitly through the network. If the integers used are large enough and have good properties, then even Eve who can capture all the messages sent by Alice and Bob cannot recover the secret key that they have exchanged. There is no formal proof of the security of the algorithm, but mathematicians have tried to solve similar problems with integers during centuries without finding an efficient algorithm. As long as the integers that are used are random and large enough, the only possible attack for Eve is to test all possible integers that could have been chosen by Alice and Bob. This is computationally very expensive. This algorithm is widely used in security protocols to agree on a secret key. 788/10000 · 788
91 ../../exercises/ipv6.rst:851
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The problem can be detected by using :manpage:`traceroute6(8)`. 63/10000 · 63
91 ../../exercises/routing-protocols.rst:1351
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — What is the path that packets follow from a host attached to ``AS8`` to a host attached to ``AS2`` ? 100/10000 · 100
91 ../../protocols/bgp.rst:365
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another important utilization of the `local-pref` attribute is to support the `customer->provider` and `shared-cost` peering relationships. From an economic point of view, there is an important difference between these three types of peering relationships. A domain usually earns money when it sends packets over a `provider->customer` relationship. On the other hand, it must pay its provider when it sends packets over a `customer->provider` relationship. Using a `shared-cost` peering to send packets is usually neutral from an economic perspective. To take into account these economic issues, domains usually configure the import filters on their routers as follows : 671/10000 · 671
91 ../../protocols/email.rst:242
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 39 2/10000 · 2
91 ../../protocols/ethernet.rst:362
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Spanning Tree Protocol` uses its own terminology that we illustrate in the figure above. A switch port can be in three different states : `Root`, `Designated` and `Blocked`. All the ports of the `root` switch are in the `Designated` state. The state of the ports on the other switches is determined based on the `BPDU` received on each port. 346/10000 · 346
91 ../../protocols/ipv6.rst:345
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``TCP`` uses `Next Header` number ``6`` 39/10000 · 39
91 ../../protocols/ethernet.rst:337
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the number of the switch port over which the `BPDU` was sent (`p`) 66/10000 · 66
91 ../../protocols/tcp.rst:267
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `snd.wnd` : the current size of the sending window (in bytes) 61/10000 · 61