2. cnp3-ebook
3. English
4. Zen

83 ../../protocols/ethernet.rst:316
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Spanning Tree Protocol` (STP), proposed in [Perlman1985]_, is a distributed protocol that is used by switches to reduce the network topology to a spanning tree, so that there are no cycles in the topology. For example, consider the network shown in the figure below. In this figure, each bold line corresponds to an Ethernet to which two Ethernet switches are attached. This network contains several cycles that must be broken to allow Ethernet switches, using the MAC address learning algorithm, to exchange frames. 521/10000 · 521
83 ../../protocols/tcp.rst:259
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the local IP address 20/10000 · 20
83 ../../protocols/tls.rst:415
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — By supporting only cipher suites that provide Perfect Forward Secrecy in TLS 1.3, the IETF aims at protecting the privacy of users against a wide range of attacks. However, this choice has resulted in intense debates in some enterprises. Some enterprises, notably in financial organizations, have deployed TLS, but wish to be able to decrypt TLS traffic for various security-related activities. These enterprises tried to lobby within the IETF to maintain RSA-based cipher suites that do not provide Perfect Forward Secrecy. Their arguments did not convince the IETF. Eventually, these enterprises moved to ETSI, another standardization body, and convinced them to adopt `entreprise TLS`, a variant of TLS 1.3 that does not provide Perfect Forward Secrecy [eTLS2018]_. 768/10000 · 768
83 ../../principles/network.rst:444
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The second organization of the network layer, called `virtual circuits`, has been inspired by the organization of telephone networks. Telephone networks have been designed to carry phone calls that usually last a few minutes. Each phone is identified by a telephone number and is attached to a telephone switch. To initiate a phone call, a telephone first needs to send the destination's phone number to its local switch. The switch cooperates with the other switches in the network to create a bi-directional channel between the two telephones through the network. This channel will be used by the two telephones during the lifetime of the call and will be released at the end of the call. Until the 1960s, most of these channels were created manually, by telephone operators, upon request of the caller. Today's telephone networks use automated switches and allow several channels to be carried over the same physical link, but the principles roughly remain the same. 969/10000 · 969
83 ../../bibliography.rst:107
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Kühlewind, M., Neuner, S., Trammell, B., `On the state of ECN and TCP Options on the Internet <http://link.springer.com/chapter/10.1007%2F978-3-642-36516-4_14>`_. Proceedings of the 14th Passive and Active Measurement conference (PAM 2013), Hong Kong, March 2013 262/10000 · 262
84 ../../glossary.rst:141
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — IS-IS 5/10000 · 5
84 ../../principles/reliability.rst:272
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `DLE STX` **DLE** `DLE` **STX** **DLE** `DLE` ETX** `DLE ETX` 61/10000 · 61
84 ../../principles/sharing.rst:557
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Now that we have looked at how a frame is actually transmitted as an electrical signal on a shared bus, it is interesting to look in more detail at what happens when two hosts transmit a frame at almost the same time. This is illustrated in the figure below, where hosts A and B start their transmission at the same time (point `(1)`). At this time, if host C senses the channel, it will consider it to be free. This will not last a long time and at point `(2)` the electrical signals from both host A and host B reach host C. The combined electrical signal (shown graphically as the superposition of the two curves in the figure) cannot be decoded by host C. Host C detects a collision, as it receives a signal that it cannot decode. Since host C cannot decode the frames, it cannot determine which hosts are sending the colliding frames. Note that host A (and host B) will detect the collision after host C (point `(3)` in the figure below). 943/10000 · 943
84 ../../principles/transport.rst:526
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `request-response service` allows to efficiently exchange small amounts of information in a request and associate it with the corresponding response. This service can be depicted by using the time-sequence diagram below. 224/10000 · 224
84 ../../principles/security.rst:937
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — From is knowledge of :math:`b` and :math:`A`, Bob can compute :math:`Secret=A^{b} \mod p=(g^{a} \mod p) ^{b} \mod p=g^{a \times b} \mod p` 138/10000 · 138
84 ../../exercises/ipv6.rst:784
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — On its ``a-eth0`` interface, host ``a`` uses IPv6 address ``2001:db8:1341:1::a/64``. The link local address (``fe80::c44e:26ff:fed9:de6d/64``) will be described in another chapter. Finally, we can check the forwarding table of host ``a``. 238/10000 · 238
84 ../../exercises/routing-protocols.rst:1232
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The network below contains nine ASes with one host per AS. Assuming that ``AS1`` announces prefix `p1` and that ``AS2`` announces prefix `p2`. 142/10000 · 142
84 ../../protocols/bgp.rst:327
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As BGP routers always prefer the routes with the highest `local-pref` attribute, this policy can be implemented using the following import filter on `R1` 153/10000 · 153
84 ../../protocols/email.rst:240
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 38 2/10000 · 2
84 ../../protocols/ethernet.rst:356
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 100 Mbps 8/10000 · 8
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