2. cnp3-ebook
3. English
4. Zen

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
85 ../../protocols/tls.rst:447
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — There are several important differences with the TLS 1.2 handshake. First, the Diffie Hellman key exchange is required in TLS 1.3 and this exchange is initiated by the client (before having validated the server identity). To initiate the Diffie Hellman key exchange, the client needs to guess the modulus and the base that can be accepted by the server. Either the client uses standard parameters that most server supports or the client remembers the last modulus/base that it used with this particular server. If the client guessed incorrectly, the server replies with the parameters that it expects and one round-trip-time is lost. When the server sends its `ServerHello`, it already knows the session key. This implies that the server can encrypt all subsequent messages. After one round-trip-time, all data exchanged over the TLS 1.3 session is encrypted and authenticated. In TLS 1.3, the server certificate is encrypted with the session key, as well as the `Finished` message. The server signs the handshake to confirm that it owns the public key of its certificate. If the server wants to send application data, it can already encrypt it and send it to the client. Upon reception of the server Certificate, the client verifies it and checks the signature of the handshake and the `Finished` message. The client confirms the end of the handshake by sending its own `Finished` message. At that time, the client can send encrypted data. This means that the client only had to wait one round-trip-time before sending encrypted data. This is much faster than with TLS 1.2. 1574/10000 · 1574
85 ../../principles/reliability.rst:275
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Character stuffing`, like bit stuffing, increases the length of the transmitted frames. For `character stuffing`, the worst frame is a frame containing many `DLE` characters. When transmission errors occur, the receiver may incorrectly decode one or two frames (e.g. if the errors occur in the markers). However, it will be able to resynchronize itself with the next correctly received markers. 395/10000 · 395
86 ../../glossary.rst:102
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ISN 3/10000 · 3
86 ../../principles/network.rst:451
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the label for the outgoing packet 33/10000 · 33
86 ../../principles/sharing.rst:570
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As shown above, hosts detect collisions when they receive an electrical signal that they cannot decode. In a wired network, a host is able to detect such a collision both while it is listening (e.g. like host C in the figure above) and also while it is sending its own frame. When a host transmits a frame, it can compare the electrical signal that it transmits with the electrical signal that it senses on the wire. At points `(1)` and `(2)` in the figure above, host A senses only its own signal. At point `(3)`, it senses an electrical signal that differs from its own signal and can thus detects the collision. At this point, its frame is corrupted and it can stop its transmission. The ability to detect collisions while transmitting is the starting point for the `Carrier Sense Multiple Access with Collision Detection (CSMA/CD)` Medium Access Control algorithm, which is used in Ethernet networks [Metcalfe1976]_ [IEEE802.3]_ . When an Ethernet host detects a collision while it is transmitting, it immediately stops its transmission. Compared with pure CSMA, CSMA/CD is an important improvement since when collisions occur, they only last until colliding hosts have detected it and stopped their transmission. In practice, when a host detects a collision, it sends a special jamming signal on the cable to ensure that all hosts have detected the collision. 1364/10000 · 1364
86 ../../principles/transport.rst:547
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the previous sections, we have described services that are provided by the transport layer. However, it is important to note that the notion of service is more general than in the transport layer. As explained earlier, the network layer also provides a service, which in most networks is an unreliable connectionless service. There are network layers that provide a connection-oriented service. Similarly, the datalink layer also provides services. Some datalink layers will provide a connectionless service. This will be the case in Local Area Networks for examples. Other datalink layers, e.g. in public networks, provide a connection oriented service. 657/10000 · 657
86 ../../principles/security.rst:945
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An example of the utilization of the Diffie-Hellman key exchange is shown below. Before starting the exchange, Alice and Bob agree on a modulus (:math:`p=23`) and a base (:math:`g=5`). These two numbers are public. They are typically part of the standard that defines the protocol that uses the key exchange. 308/10000 · 308
86 ../../exercises/ipv6.rst:796
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another useful command is ``xterm`` 'node' that allows to launch a terminal on the specified node. This gives you a interactive shell on any node. You can use it to capture packets with tcpdump_. As an example, let us use :manpage:`traceroute6(8)` to trace the path followed by packets from host ``a`` towards the IPv6 address of host ``b`` i.e. ``2001:db8:1341:3::b``. The output of this command shows that the path passes through routers ``r1``, ``r2`` and ``r3``. 466/10000 · 466
86 ../../exercises/routing-protocols.rst:1267
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — What is the Loc-RIB of ``AS8`` for prefix `p2` ? Indicate which is the best route towards this prefix. 102/10000 · 102
86 ../../protocols/bgp.rst:337
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The import filter above modifies the selection of the BGP routes inside `AS1`. Thus, it influences the route followed by the packets forwarded by `AS1`. In addition to using the primary link to send packets, `AS1` would like to receive its packets via the high bandwidth link. For this, `AS2` also needs to set the `local-pref` attribute in its import filter. 359/10000 · 359
86 ../../protocols/email.rst:240
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 55 2/10000 · 2
86 ../../protocols/ethernet.rst:357
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1 Gbps 6/10000 · 6