Exit Zen
68
../../protocols/tcp.rst:226
English
the second byte indicates the total length of the option (including the first two bytes) in bytes
0/970 · 97
68
../../protocols/tls.rst:363
English
When secure protocols use Message Authentication and Encryption, they need to specify how these two algorithms are combined. A first solution, which is used by the current version of TLS, is to compute the authentication code and then encrypt both the data and the authentication code. A drawback of this approach is that the receiver of an encrypted TLS record must first attempt to decrypt data that has potentially been modified by an attacker before being able to verify the authenticity of the record. A better approach is for the sender to first encrypt the data and then compute the authentication code over the encrypted data. This is the encrypt-then-MAC approach proposed in :rfc:`7366`. With encrypt-then-MAC, the receiver first checks the authentication code before attempting to decrypt the record.
0/8110 · 811
69
../../glossary.rst:149
English
Interior Gateway Protocol. Synonym of intradomain routing protocol
0/660 · 66
69
../../principles/network.rst:323
English
Consider in the network above that host `A` wants to send a 900 bytes packet (870 bytes of payload and 30 bytes of header) to host `B` via router `R1`. Host `A` encapsulates this packet inside a single frame. The frame is received by router `R1` which extracts the packet. Router `R1` has three possible options to process this packet.
0/3350 · 335
69
../../principles/reliability.rst:244
English
In addition, the :term:`ASCII` table also defines several non-printable or control characters. These characters were designed to allow an application to control a printer or a terminal. These control characters include `CR` and `LF`, that are used to terminate a line, and the `BEL` character which causes the terminal to emit a sound.
0/3350 · 335
69
../../principles/transport.rst:229
English
The connectionless service
0/260 · 26
69
../../principles/sharing.rst:279
English
A first solution to share the available resources among all the devices attached to one Local Area Network is to define, `a priori`, the distribution of the transmission resources among the different devices. If `N` devices need to share the transmission capacities of a LAN operating at `b` Mbps, each device could be allocated a bandwidth of :math:`\frac{b}{N}` Mbps.
0/3690 · 369
69
../../principles/security.rst:849
English
his/her identity
0/160 · 16
69
../../exercises/ipv6.rst:617
English
We can then manually configure the IPv6 addresses of each host/router on each link. Let us start with the links attached to the two hosts.
0/1380 · 138
69
../../exercises/routing-protocols.rst:941
English
We can fix them by enabling again the BGP session with the `no neighbor 2001:cafe:2:23::3 shutdown` command.
0/1080 · 108
69
../../exercises/tcp-2.rst:889
English
The variables that are included in TCP_INFO are defined in https://github.com/torvalds/linux/blob/master/include/uapi/linux/tcp.h
0/1290 · 129
69
../../protocols/bgp.rst:285
English
We use the notation `U(prefix, nexthop, attributes)` to represent such a `BGP Update` message in this section. Similarly, `W(prefix)` represents a `BGP withdraw` for the specified prefix. Once the `R1-R2` session has been established, `R1` sends `U(2001:db8:1234::/48,2001:db8::5,AS10)` to `R2` and `R2` sends `U(2001:db8:5678:/48,2001:db8::6,AS20)`. At this point, `R1` can reach `2001:db8:5678::/48` via `2001:db8::6` and `R2` can reach `2001:db8:1234::/48` via `2001:db8::5`.
0/4780 · 478
69
../../protocols/email.rst:236
English
T
0/100 · 1
69
../../protocols/ethernet.rst:316
English
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.
0/5210 · 521
69
../../protocols/http.rst:336
English
The client sends a second request for the style sheet of the retrieved web page.
0/800 · 80
69
../../protocols/ipv6.rst:236
English
``0:0:0:0:0:0:0:1`` (``::1`` in compact form) is the IPv6 loopback address. This is the address of a logical interface that is always up and running on IPv6 enabled hosts.
0/1710 · 171
69
../../protocols/ethernet.rst:207
English
Ethernet Switches
0/170 · 17
69
../../protocols/tcp.rst:227
English
the last bytes are specific for each type of option
0/510 · 51
69
../../protocols/tls.rst:379
English
Improving TLS
0/130 · 13
70
../../glossary.rst:162
English
IGRP
0/100 · 4