2. cnp3-ebook
3. English
4. Zen

84 ../../protocols/ipv6.rst:334
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Traffic class` : this 8 bits field indicates the type of service expected by this packet and contains the ``CE`` and ``ECT`` flags that are used by `Explicit Congestion Notification` 183/10000 · 183
84 ../../protocols/ethernet.rst:324
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Spanning tree computed in a switched Ethernet network 53/10000 · 53
84 ../../protocols/tcp.rst:260
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the remote IP address 21/10000 · 21
84 ../../protocols/tls.rst:417
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The TLS 1.3 handshake differs from the TLS 1.2 handshake in several ways. First, the TLS 1.3 handshake requires a single round-trip-time when the client connects for the first time to a server. To achieve this, the TLS designers look at the TLS 1.2 handshake in details and found that the first round-trip-time is mainly used to select the set of cryptographic algorithms and the cryptographic exchange scheme that will be used over the TLS session. TLS 1.3 drastically simplifies this negotiation by requiring to use the Diffie Hellman exchange with a small set of possible parameters. This means that the client can guess the parameters used by the server (i.e. the modulus, p and the base g) and immediately start the Diffie Hellman exchange. A simplified version of the TLS 1.3 handshake is shown in the figure below. 821/10000 · 821
84 ../../principles/network.rst:448
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In a network using virtual circuits, all hosts are also identified with a network layer address. However, packet forwarding is not performed by looking at the destination address of each packet. With the `virtual circuit` organization, each data packet contains one label [#flabels]_. A label is an integer which is part of the packet header. Routers implement `label switching` to forward `labelled data packet`. Upon reception of a packet, a router consults its `label forwarding table` to find the outgoing interface for this packet. In contrast with the datagram mode, this lookup is very simple. The `label forwarding table` is an array stored in memory and the label of the incoming packet is the index to access this array. This implies that the lookup operation has an `O(1)` complexity in contrast with other packet forwarding techniques. To ensure that on each node the packet label is an index in the `label forwarding table`, each router that forwards a packet replaces the label of the forwarded packet with the label found in the `label forwarding table`. Each entry of the `label forwarding table` contains two pieces of information : 1150/10000 · 1150
84 ../../bibliography.rst:108
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Karn, P. and Partridge, C., `Improving round-trip time estimates in reliable transport protocols <http://doi.acm.org/10.1145/118544.118549>`_. ACM Transactions Computer Systems 9, 4 (Nov. 1991), 364-373. 203/10000 · 203
85 ../../bibliography.rst:109
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Karn, P., Price, H., Diersing, R., `Packet radio in amateur service <https://dx.doi.org/10.1109/JSAC.1985.1146214>`_, IEEE Journal on Selected Areas in Communications, 3, May, 1985 180/10000 · 180
85 ../../glossary.rst:143
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Intermediate System- Intermediate System. A link-state intradomain routing that was initially defined for the ISO CLNP protocol but was extended to support IP v4 and IP v6. IS-IS is often used in ISP networks. It is defined in [ISO10589]_ 238/10000 · 238
85 ../../principles/network.rst:450
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the outgoing interface for the packet 37/10000 · 37
85 ../../principles/sharing.rst:564
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Frame collision on a shared bus 31/10000 · 31
85 ../../principles/transport.rst:545
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Services and layers 19/10000 · 19
85 ../../principles/security.rst:940
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The security of this protocol relies on the difficulty of computing discrete logarithms, i.e. from the knowledge of :math:`A` (resp. :math:`B`), it is very difficult to extract :math:`\log(A)=\log(g^{a} \mod p)=a` (resp. :math:`\log(B)=\log(g^{b} \mod p)=b`). 259/10000 · 259
85 ../../exercises/ipv6.rst:794
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — There are three routes in this table. The first two correspond to the two prefixes that are used over the ``a-eth0`` interface. These routes are automatically created when an IPv6 address is configured on an interface. The last route is the default route (``::/0``) which points towards ``2001:db8:1341:1::1``, i.e. router ``r1``. 330/10000 · 330
85 ../../exercises/routing-protocols.rst:1265
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — What is the Loc-RIB of ``AS6`` for prefix `p1` ? Indicate which is the best route towards this prefix. 102/10000 · 102
85 ../../protocols/bgp.rst:335
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — With this import filter, all the BGP routes learned from `RB` over the high bandwidth links are preferred over the routes learned over the backup link. If the primary link fails, the corresponding routes are removed from `R1`'s RIB and `R1` uses the route learned from `RA`. `R1` reuses the routes via `RB` as soon as they are advertised by `RB` once the `R1-RB` link comes back. 379/10000 · 379
85 ../../protocols/email.rst:240
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — m 1/10000 · 1
85 ../../protocols/ethernet.rst:356
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 200000 6/10000 · 6
85 ../../protocols/ipv6.rst:335
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Flow Label` : this field was initially intended to be used to tag packets belonging to the same `flow`. A recent document, :rfc:`6437` describes some possible usages of this field, but it is too early to tell whether it will be really used. 241/10000 · 241
85 ../../protocols/ethernet.rst:327
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In this network, the STP will compute the following spanning tree. `Switch1` will be the root of the tree. All the interfaces of `Switch1`, `Switch2` and `Switch7` are part of the spanning tree. Only the interface connected to `LAN B` will be active on `Switch9`. `LAN H` will only be served by `Switch7` and the port of `Switch44` on `LAN G` will be disabled. A frame originating on `LAN B` and destined for `LAN A` will be forwarded by `Switch7` on `LAN C`, then by `Switch1` on `LAN E`, then by `Switch44` on `LAN F` and eventually by `Switch2` on `LAN A`. 559/10000 · 559
85 ../../protocols/tcp.rst:261
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the local TCP port number 25/10000 · 25