Exit Zen
67
../../principles/reliability.rst:241
English
`@` : `1000000` b
0/170 · 17
67
../../principles/transport.rst:225
English
the `connection oriented service`
0/330 · 33
67
../../principles/sharing.rst:273
English
We first discuss a simple deterministic MAC algorithm and then we describe several important optimistic algorithms, before coming back to a distributed and deterministic MAC algorithm.
0/1840 · 184
67
../../principles/security.rst:822
English
In this example, Mallory has forced Alice to compute :math:`E_p(Alice_{priv},RB)` which is the information required to finalize the first exchange and be authenticated as Alice. This illustrates a common problem with authentication schemes when the same information can be used for different purposes. The problem comes from the fact that Alice agrees to compute her signature on a nonce chosen by Bob (and relayed by Mallory). This problem occurs if the nonce is a simple integer without any structure. If the nonce includes some structure such as some information about Alice and Bob's identities or even a single bit indicating whether the nonce was chosen by a user acting as a client (i.e. starting the authentication) or as a server, then the protocol is not vulnerable anymore.
0/7840 · 784
67
../../exercises/ipv6.rst:614
English
``2001:db8:1341:23::/64`` on the link between ``r2`` and ``r3``
0/630 · 63
67
../../exercises/routing-protocols.rst:911
English
We start indicate that we will use the terminal to change the router configuration with `configure terminal`. We then enter the BGP part of the configuration with `router bgp 2` (`2` is the AS number of `as2`). Then we use the `neighbor 2001:cafe:2:23::3 shutdown` that takes as parameter the IP address of the peer of the session that we want to stop. We then leave the BGP part of the configuration (first `exit`) and the configuration menu (second `exit` command). At this point, the BGP session between ``AS2`` and ``AS3`` is down.
0/5350 · 535
67
../../exercises/tcp-2.rst:885
English
By default, packetdrill_ uses port 8080 when creating TCP segments. You can thus capture the packets injected by packetdrill_ and the responses from the stack by using ``tcpdump -i any -n port 8080``
0/1990 · 199
67
../../protocols/bgp.rst:282
English
the `BGP nexthop`
0/170 · 17
67
../../protocols/email.rst:236
English
C
0/100 · 1
67
../../protocols/ethernet.rst:309
English
The first Ethernet relays that operated in the datalink layers were called `bridges`. In practice, the main difference between switches and bridges is that bridges were usually implemented in software while switches are hardware-based devices. Throughout this text, we always use `switch` when referring to a relay in the datalink layer, but you might still see the word `bridge`.
0/3800 · 380
67
../../protocols/http.rst:311
English
The example below shows the operation of HTTP/1.1 over a persistent TCP connection to retrieve three URIs stored on the same server. Once the connection has been established, the client sends its first request with the `Connection: Keep-Alive` header to request a persistent connection.
0/2860 · 286
67
../../protocols/ipv6.rst:230
English
For the companies that want to use IPv6 without being connected to the IPv6 Internet, :rfc:`4193` defines the `Unique Local Unicast (ULA)` addresses (``fc00::/7``). These ULA addresses play a similar role as the private IPv4 addresses defined in :rfc:`1918`. However, the size of the ``fc00::/7`` address block allows ULA to be much more flexible than private IPv4 addresses.
0/3750 · 375
67
../../protocols/ethernet.rst:201
English
These network interfaces compute the TCP checksum while a segment is transferred from the host memory to the network interface [SH2004]_.
0/1370 · 137
67
../../protocols/tcp.rst:225
English
the first byte indicates the `type` of the option.
0/500 · 50
67
../../protocols/tls.rst:361
English
MAC-then-encrypt or Encrypt-then-MAC
0/360 · 36
68
../../glossary.rst:147
English
IGP
0/100 · 3
68
../../principles/network.rst:304
English
Sometimes, the network layer needs to deal with heterogeneous datalink layers. For example, two hosts connected to different datalink layers exchange packets via routers that are using other types of datalink layers. Thanks to the network layer, this exchange of packets is possible provided that each packet can be placed inside a datalink layer frame before being transmitted. If all datalink layers support the same frame size, this is simple. When a node receives a frame, it decapsulates the packet that it contains, checks the header and forwards it, encapsulated inside another frame, to the outgoing interface. Unfortunately, the encapsulation operation is not always possible. Each datalink layer is characterized by the maximum frame size that it supports. Datalink layers typically support frames containing up to a few hundreds or a few thousands of bytes. The maximum frame size that a given datalink layer supports depends on its underlying technology. Unfortunately, most datalink layers support a different maximum frame size. This implies that when a host sends a large packet inside a frame to its nexthop router, there is a risk that this packet will have to traverse a link that is not capable of forwarding the packet inside a single frame. In principle, there are three possibilities to solve this problem. To discuss them, we consider a simple scenario with two hosts connected to a router as shown in the figure below.
0/14420 · 1442
68
../../principles/reliability.rst:242
English
`space` : `0100000` b
0/210 · 21
68
../../principles/transport.rst:226
English
the `request-response service`
0/300 · 30
68
../../principles/sharing.rst:277
English
Static allocation methods
0/250 · 25