Exit Zen
66
../../glossary.rst:42
English
IETF
0/100 · 4
66
../../principles/reliability.rst:240
English
`z` : `1111010` b
0/170 · 17
66
../../principles/transport.rst:224
English
the `connectionless service`
0/280 · 28
66
../../principles/sharing.rst:270
English
`Stochastic` or `optimistic` MAC algorithms. These algorithms assume that collisions are part of the normal operation of a Local Area Network. They aim to minimize the number of collisions, but they do not try to avoid all collisions. Stochastic algorithms are usually easier to implement than deterministic ones.
0/3130 · 313
66
../../principles/security.rst:799
English
In this exchange, Bob authenticates himself by signing the :math:`RA` nonce that was sent by Mallory. Now, to authenticate as Alice, Mallory needs to compute the signature of nonce :math:`RB` with Alice's private key. Mallory does not know Alice's key, but he could exploit the protocol to force Alice to perform the required computation. For this, Mallory can start an authentication to Alice as shown below.
0/4090 · 409
66
../../exercises/ipv6.rst:613
English
``2001:db8:1341:13::/64`` on the link between ``r1`` and ``r3``
0/630 · 63
66
../../exercises/routing-protocols.rst:900
English
We can now disable one of the BGP sessions on router `as2` as follows.
0/700 · 70
66
../../exercises/tcp-2.rst:883
English
packetdrill_ requires root privileges since it inject raw IP packets. The easiest way to install it is to use a virtualbox image with a Linux kernel 4.x or 5.x. You can clone its git repository from https://github.com/google/packetdrill and follow the instructions in https://github.com/google/packetdrill/tree/master/gtests/net/packetdrill. The packetdrill_ scripts used in this section are available from https://github.com/cnp3/ebook/tree/master/exercises/packetdrill_scripts
0/4780 · 478
66
../../protocols/bgp.rst:281
English
the advertised prefix
0/210 · 21
66
../../protocols/email.rst:236 • ../../protocols/email.rst:238
English
2
0/100 · 1
66
../../protocols/ethernet.rst:305
English
The `MAC address learning` algorithm allows switches to be plug-and-play. Unfortunately, the loops that arise when the network topology is not a tree are a severe problem. Forcing the switches to only be used in tree-shaped networks as hubs would be a severe limitation. To solve this problem, the inventors of Ethernet switches have developed the `Spanning Tree Protocol`. This protocol allows switches to automatically disable ports on Ethernet switches to ensure that the network does not contain any cycle that could cause frames to loop forever.
0/5500 · 550
66
../../protocols/http.rst:309
English
The `Keep-Alive:` header is used by the server to inform the client about how it agrees to use the persistent connection. A typical `Keep-Alive:` contains two parameters: the maximum number of requests that the server agrees to serve on the underlying TCP connection and the timeout (in seconds) after which the server will close an idle connection
0/3480 · 348
66
../../protocols/ipv6.rst:225
English
The longest prefix match can be implemented by using different data structures One possibility is to use a trie. Details on how to implement efficient packet forwarding algorithms may be found in [Varghese2005]_.
0/2120 · 212
66
../../protocols/ethernet.rst:199
English
The attentive reader may question the need for different `EtherTypes` for IPv4 and IPv6 while the IP header already contains a version field that can be used to distinguish between IPv4 and IPv6 packets. Theoretically, IPv4 and IPv6 could have used the same `EtherType`. Unfortunately, developers of the early IPv6 implementations found that some devices did not check the version field of the IPv4 packets that they received and parsed frames whose `EtherType` was set to `0x0800` as IPv4 packets. Sending IPv6 packets to such devices would have caused disruptions. To avoid this problem, the IETF decided to apply for a distinct `EtherType` value for IPv6. Such a choice is now mandated by :rfc:`6274` (section 3.1), although we can find a funny counter-example in :rfc:`6214`.
0/7790 · 779
66
../../protocols/tcp.rst:223
English
The TCP options are encoded by using a Type Length Value format where :
0/710 · 71
66
../../protocols/tls.rst:341
English
TLS supports several methods to encrypted records. The selected method depends on the cryptographic algorithms that have been negotiated for the TLS session. A detailed presentation of the different methods that can be used to produce the `TLSPlainText` from the user data is outside the scope of this book. As an example, we study one method: Stream Encryption. This method is used with cryptographic algorithms which can operate on a stream of bytes. The method starts with a sequence of bytes provided by the user application: the plain text. The first step is to compute the authentication code to verify the integrity of the data. For this, TLS computes :math:`MAC(SeqNum, Header, PlainText)` using HMAC where `SeqNum` is a sequence number which is incremented by one for each new TLS record transmitted. The `Header` is the header of the TLS record described above and `PlainText` is the information that needs to be encrypted. Note that the sequence number is maintained at the two endpoints of the TLS session, but it is not transmitted inside the TLS record. This sequence number is used to prevent replay attacks.
0/11230 · 1123
67
../../glossary.rst:44
English
The Internet Engineering Task Force is a non-profit organization that develops the standards for the protocols used in the Internet. The IETF mainly covers the transport and network layers. Several application layer protocols are also standardized within the IETF. The work in the IETF is organized in working groups. Most of the work is performed by exchanging emails and there are three IETF meetings every year. Participation is open to anyone. See https://www.ietf.org
0/4720 · 472
67
../../principles/network.rst:302
English
Dealing with heterogeneous datalink layers
0/420 · 42
67
../../principles/reliability.rst:241
English
`@` : `1000000` b
0/170 · 17
67
../../principles/transport.rst:225
English
the `connection oriented service`
0/330 · 33