2. cnp3-ebook
3. English
4. Zen

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
93 ../../protocols/bgp.rst:368
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — insert a medium `local-pref` attribute in the routes learned over a shared-cost peering 87/10000 · 87
93 ../../protocols/email.rst:242
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 56 2/10000 · 2
93 ../../protocols/ethernet.rst:366
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Otherwise, the switch chooses the best priority vector from its table, `bv = <R,c+cost[q'],T,p,q'>`. The port `q'`, over which this best root priority vector was learned, is the switch port that is closest to the `root` switch. This port becomes the `Root` port of the switch. There is only one `Root` port per switch (except for the `Root` switches whose ports are all `Designated`). The switch can then compute its own `BPDU` as `BPDU = <R,c',S,p>` , where `R` is the `root identifier`, `c'` the cost of the best root priority vector, `S` the identifier of the switch and `p` will be replaced by the number of the port over which the `BPDU` will be sent. 656/10000 · 656
93 ../../protocols/ipv6.rst:347
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``SCTP`` uses `Next Header` number ``132`` 42/10000 · 42
93 ../../protocols/ethernet.rst:350
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In addition to the `identifier` discussed above, the network administrator can also configure a `cost` to be associated to each switch port. Usually, the `cost` of a port depends on its bandwidth and the [IEEE802.1d]_ standard recommends the values below. Of course, the network administrator may choose other values. We will use the notation `cost[p]` to indicate the cost associated to port `p` in this section. 413/10000 · 413
93 ../../protocols/tcp.rst:269
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `rcv.wnd` : the current size of the receive window advertised by the remote host 80/10000 · 80
93 ../../protocols/tls.rst:519
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — See https://letsencrypt.org/stats/ for a graph and https://docs.telemetry.mozilla.org/datasets/other/ssl/reference.html for additional information on the dataset 161/10000 · 161
93 ../../principles/reliability.rst:323
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When running on top of a perfect framing sub-layer, a datalink entity can simply issue a `send(SDU)` upon arrival of a `DATA.req(SDU)` [#fsdu]_. Similarly, the receiver issues a `DATA.ind(SDU)` upon receipt of a `recvd(SDU)`. Such a simple protocol is sufficient when a single SDU is sent. This is illustrated in the figure below. 330/10000 · 330
94 ../../glossary.rst:39
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ITU 3/10000 · 3
94 ../../principles/network.rst:461 • ../../principles/network.rst:501 • ../../principles/network.rst:503 • ../../principles/network.rst:515 • ../../principles/network.rst:515 • ../../principles/network.rst:527 • ../../principles/network.rst:527 • ../../principles/network.rst:539 • ../../principles/network.rst:539
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1 1/10000 · 1
94 ../../principles/sharing.rst:607
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To understand `binary exponential back-off`, let us consider a collision caused by exactly two hosts. Once it has detected the collision, a host can either retransmit its frame immediately or defer its transmission for some time. If each colliding host flips a coin to decide whether to retransmit immediately or to defer its retransmission, four cases are possible : 367/10000 · 367
94 ../../principles/transport.rst:568
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Interactions between the transport layer, its user, and its network layer provider 82/10000 · 82
94 ../../principles/security.rst:977
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Mallory generates a secret integer, :math:`m` and sends :math:`M=g^{m} \mod p` to Bob 85/10000 · 85