2. cnp3-ebook
3. English
4. Zen

92 ../../principles/security.rst:970
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Unfortunately, the Diffie-Hellman key exchange alone cannot cope with man-in-the middle attacks. Consider Mallory who sits in the middle between Alice and Bob and can easily capture and modify their messages. The modulus and the base are public. They are thus known by Mallory as well. He could then operate as follows : 320/10000 · 320
92 ../../exercises/ipv6.rst:861
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the output of :manpage:`traceroute6(8)`, a ``!N`` indicates that host ``a`` received from ``2001:db8:1341:12::2``, i.e. router ``r2``, a Network unreachable ICMPv6 message. The forwarding table of ``r2`` confirms the root cause of this problem. 247/10000 · 247
92 ../../exercises/routing-protocols.rst:1364
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — What is the path that packets follow from a host attached to ``AS2`` to a host attached to ``AS7`` ? 100/10000 · 100
92 ../../protocols/bgp.rst:367
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — insert a high `local-pref` attribute in the routes learned from a customer 74/10000 · 74
92 ../../protocols/email.rst:242
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — n 1/10000 · 1
92 ../../protocols/ethernet.rst:364
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Spanning Tree Protocol` uses the ordering relationship to build the spanning tree. Each switch listens to `BPDUs` on its ports. When `BPDU = <R,c,T,p>` is received on port `q`, the switch computes the port's `root priority vector`: `V[q] = <R,c+cost[q],T,p,q>` , where `cost[q]` is the cost associated to the port over which the `BPDU` was received. The switch stores in a table the last `root priority vector` received on each port. The switch then compares its own `identifier` with the smallest `root identifier` stored in this table. If its own `identifier` is smaller, then the switch is the root of the spanning tree and is, by definition, at a distance `0` of the root. The `BPDU` of the switch is then `<R,0,R,p>`, where `R` is the switch `identifier` and `p` will be set to the port number over which the `BPDU` is sent. 834/10000 · 834
92 ../../protocols/ipv6.rst:346
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``UDP`` uses `Next Header` number ``17`` 40/10000 · 40
92 ../../protocols/tcp.rst:268
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `rcv.nxt` : the sequence number of the next byte that is expected to be received from the remote host 101/10000 · 101
92 ../../protocols/tls.rst:518
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A detailed explanation of the TLS 1.3 handshake may be found at https://tls13.ulfheim.net/ 90/10000 · 90
92 ../../protocols/ethernet.rst:339
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We will use the notation `<R,c,T,p>` to represent a `BPDU` whose `root identifier` is `R`, `cost` is `c` and that was sent from the port `p` of switch `T`. The construction of the spanning tree depends on an ordering relationship among the `BPDUs`. This ordering relationship could be implemented by the Python function below. 327/10000 · 327
92 ../../bibliography.rst:116
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Katz, D., Ward, D., `Bidirectional Forwarding Detection`, :rfc:`5880`, June 2010 81/10000 · 81
92 ../../principles/transport.rst:560
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the network layer may duplicate data. 37/10000 · 37
93 ../../bibliography.rst:117
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Khanna, A. and Zinky, J. 1989. `The revised ARPANET routing metric <http://doi.acm.org/10.1145/75247.75252>`_. SIGCOMM Computer Communication Review 19, 4 (Aug. 1989), 45-56. 174/10000 · 174
93 ../../glossary.rst:283
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An Internet Service Provider, i.e. a network that provides Internet access to its clients. 90/10000 · 90
93 ../../principles/network.rst:459
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 7 1/10000 · 1
93 ../../principles/sharing.rst:605
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The last innovation introduced by CSMA/CD is the computation of the retransmission timeout. As for ALOHA, this timeout cannot be fixed, otherwise hosts could become synchronized and always retransmit at the same time. Setting such a timeout is always a compromise between the network access delay and the amount of collisions. A short timeout would lead to a low network access delay but with a higher risk of collisions. On the other hand, a long timeout would cause a long network access delay but a lower risk of collisions. The `binary exponential back-off` algorithm was introduced in CSMA/CD networks to solve this problem. 629/10000 · 629
93 ../../principles/transport.rst:562
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To deal with these issues, the transport layer includes several mechanisms that depend on the service that it provides. It interacts with both the applications and the underlying network layer. 193/10000 · 193
93 ../../principles/security.rst:976
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Alice chooses a secret integer and sends :math:`A= g^{a} \mod p` to Mallory 75/10000 · 75
93 ../../exercises/ipv6.rst:873
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A second problem is when there is a forwarding loop inside the network, i.e. packets sent to a specific destination loop through several routers. With the static routes shown below, router ``r2`` forwards the packets towards ``2001:db8:1341:3::b`` via router ``r1``. The entire script is available from :download:`/exercises/ipmininet_scripts/static-1-loop.py`. 361/10000 · 361
93 ../../exercises/routing-protocols.rst:1375
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We now disable the interdomain link between ``AS3`` and ``AS4``. What are the hosts that ``AS1``, ``AS5`` and ``AS6`` are still able to ping ? 142/10000 · 142