2. cnp3-ebook
3. English
4. Zen

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
91 ../../protocols/tls.rst:516
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — See http://www.iana.org/assignments/tls-parameters/tls-parameters.xhtml#tls-parameters-4 88/10000 · 88
91 ../../principles/transport.rst:559
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the network layer has an upper bound on maximum length of the data; 67/10000 · 67
92 ../../glossary.rst:281
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ISP 3/10000 · 3
92 ../../principles/network.rst:459
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — South 5/10000 · 5
92 ../../principles/reliability.rst:321
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the interactions between the datalink layer entity and the framing sub-layer are represented by using `send` instead of `DATA.req` and `recvd` instead of `DATA.ind` 164/10000 · 164
92 ../../principles/sharing.rst:599
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To solve this problem, networks using CSMA/CD require hosts to transmit for at least :math:`2\times\tau` seconds. Since the network transmission speed is fixed for a given network technology, this implies that a technology that uses CSMA/CD enforces a minimum frame size. In the most popular CSMA/CD technology, Ethernet, :math:`2\times\tau` is called the `slot time` [#fslottime]_. 382/10000 · 382
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