2. cnp3-ebook
3. English
4. Zen

89 ../../protocols/tls.rst:512
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — There are many more differences between TLS 1.2 and TLS 1.3. Additional details may be found in their respective specifications, :rfc:`5246` and :rfc:`8446`. 157/10000 · 157
89 ../../bibliography.rst:113
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Krishnamurthy, B. and Rexford, J., `Web Protocols and Practice: HTTP/1.1, Networking Protocols, Caching, and Traffic Measurement <https://books.google.be/books?id=g_1SAAAAMAAJ&q=Web+Protocols+and+Practice:+HTTP/1.1,+Networking+Protocols,+Caching,+and+Traffic+Measurement&dq=Web+Protocols+and+Practice:+HTTP/1.1,+Networking+Protocols,+Caching,+and+Traffic+Measurement&hl=en&sa=X&ved=0ahUKEwi4r4O4p73lAhU3SBUIHSOWBwkQ6AEIKTAA>`_, Addison Wesley, 2001 448/10000 · 448
89 ../../principles/transport.rst:557
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the network layer may loose data; 33/10000 · 33
90 ../../glossary.rst:274
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ISO-3166 8/10000 · 8
90 ../../principles/network.rst:457 • ../../principles/network.rst:499 • ../../principles/network.rst:511 • ../../principles/network.rst:523 • ../../principles/network.rst:535
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — label 5/10000 · 5
90 ../../principles/reliability.rst:318
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The datalink layer is designed to send and receive frames on behalf of a user. We model these interactions by using the `DATA.req` and `DATA.ind` primitives. However, to simplify the presentation and to avoid confusion between a `DATA.req` primitive issued by the user of the datalink layer entity, and a `DATA.req` issued by the datalink layer entity itself, we will use the following terminology : 399/10000 · 399
90 ../../principles/sharing.rst:586
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Removing acknowledgments is an interesting optimization as it reduces the number of frames that are exchanged on the network and the number of frames that need to be processed by the hosts. However, to use this optimization, we must ensure that all hosts will be able to detect all the collisions that affect their frames. The problem is important for short frames. Let us consider two hosts, A and B, that are sending a small frame to host C as illustrated in the figure below. If the frames sent by A and B are very short, the situation illustrated below may occur. Hosts A and B send their frame and stop transmitting (point `(1)`). When the two short frames arrive at the location of host C, they collide and host C cannot decode them (point `(2)`). The two frames are absorbed by the ends of the wire. Neither host A nor host B have detected the collision. They both consider their frame to have been received correctly by its destination. 944/10000 · 944
90 ../../principles/security.rst:956
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bob computes :math:`S_{B}=A^{b} \mod p= 16^{13} \mod 23=3` 58/10000 · 58
90 ../../exercises/ipv6.rst:841
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We first check with ``pingall`` whether the network works correctly. 68/10000 · 68
90 ../../exercises/routing-protocols.rst:1339
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — What is the path that packets follow from a host attached to ``AS8`` to a host attached to ``AS1`` ? 100/10000 · 100
90 ../../protocols/bgp.rst:363
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — However, this import filter does not influence how `AS3` , for example, prefers some routes over others. If the link between `AS3` and `AS2` is less expensive than the link between `AS3` and `AS4`, `AS3` could send all its packets via `AS2` and `AS1` would receive packets over its expensive link. An important point to remember about `local-pref` is that it can be used to prefer some routes over others to send packets, but it has no influence on the routes followed by received packets. 489/10000 · 489
90 ../../protocols/email.rst:242
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — W 1/10000 · 1
90 ../../protocols/ethernet.rst:359
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 200 3/10000 · 3
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