Exit Zen
17
../../protocols/dnssec.rst:173
English
the `NSEC` record is used when non-existent domain names are queried. Its usage will be explained later
0/1030 · 103
17
../../protocols/email.rst:103
English
Other header lines appear in most email messages. The `Subject:` header line allows the sender to indicate the topic discussed in the email. Three types of header lines can be used to specify the recipients of a message :
0/2210 · 221
17
../../protocols/ethernet.rst:97
English
does not reorder the transmitted frames
0/390 · 39
17
../../protocols/http.rst:80
English
The third part of the URI is the path to the document. This path is structured as filenames on a Unix host (but it does not imply that the files are indeed stored this way on the server). If the path is not specified, the server will return a default document. The last two optional parts of the URI are used to provide a query parameter and indicate a specific part (e.g. a section in an article) of the requested document. Sample URIs are shown below.
0/4530 · 453
17
../../protocols/http2.rst:109
English
With `pipelining`, the client sends the five requests immediately and receives the five responses after 200 msec. The figure below illustrates the benefits of `pipelining`.
0/1720 · 172
17
../../protocols/ipv6.rst:95
English
IPv6 addresses are encoded as a 128 bits field
0/460 · 46
17
../../protocols/ethernet.rst:12
English
Ethernet was designed in the 1970s at the Palo Alto Research Center [Metcalfe1976]_. The first prototype [#fethernethistory]_ used a coaxial cable as the shared medium and 3 Mbps of bandwidth. Ethernet was improved during the late 1970s and in the 1980s, Digital Equipment, Intel and Xerox published the first official Ethernet specification [DIX]_. This specification defines several important parameters for Ethernet networks. The first decision was to standardize the commercial Ethernet at 10 Mbps. The second decision was the duration of the `slot time`. In Ethernet, a long `slot time` enables networks to span a long distance but forces the host to use a larger minimum frame size. The compromise was a `slot time` of 51.2 microseconds, which corresponds to a minimum frame size of 64 bytes.
0/7980 · 798
17
../../protocols/routing.rst:58
English
A note on timers
0/160 · 16
17
../../protocols/rpc.rst:58
English
In some situations, it is necessary to encode fixed or variable length arrays. XDR :rfc:`1832` supports such arrays. For example, the encoding below corresponds to a variable length array containing n elements. The encoded representation starts with an integer that contains the number of elements and follows with all elements in sequence. It is also possible to encode a fixed-length array. In this case, the first integer (the `n` field) is missing.
0/4520 · 452
17
../../protocols/ssh.rst:140
English
the server generates the random number :math:`b`. It then computes :math:`B=g^{b} \mod p`, :math:`K=B^{a} \mod p` and signs with its private key :math:`hash(V_{Client} || V_{Server} || KEX\_INIT_{Client} || KEX\_INIT_{Server} || Server_{pub} || A || B || K )` where :math:`V_{Server}` (resp. :math:`V_{Client}`) is the initial messages sent by the client (resp. server), :math:`KEX\_INIT_{Client}` (resp. :math:`KEX\_INIT_{Server}`) is the key exchange message sent by the client (resp. server) and :math:`A`, :math:`B` and :math:`K` are the messages of the Diffie Hellman key exchange
0/5860 · 586
17
../../protocols/tcp.rst:42
English
the port chosen by the server
0/290 · 29
17
../../protocols/tls.rst:45
English
563
0/100 · 3
17
../../protocols/transport-service.rst:53
English
`fe80:0:0:0:219:e3ff:fed7:1204`
0/310 · 31
17
../../protocols/udp.rst:61
English
the ephemeral port numbers ( officially [#fephemeral]_ 49152 <= port <= 65535 )
0/790 · 79
17
../../protocols/wifi.rst:23
English
5 GHz
0/100 · 5
18
../../bibliography.rst:63
English
Dijkstra, E., `A Note on Two Problems in Connection with Graphs <https://dx.doi.org/10.1007/BF01386390>`_. Numerische Mathematik, 1:269- 271, 1959
0/1460 · 146
18
../../glossary.rst:226
English
ATM
0/100 · 3
18
../../exercises/ex-sharing.rst:382
English
To understand congestion control algorithms, it can also be useful to represent the exchange of packets by using a graphical representation. As a first example, let us consider a very simple network composed of two hosts interconnected through a switch.
0/2530 · 253
18
../../principles/transport.rst:45
English
Bob : `This is the correct password, you're welcome`
0/520 · 52
18
../../principles/security.rst:247
English
Cryptography techniques have initially been defined and used by spies and armies to exchange secret information in manner that ensures that adversaries cannot decode the information even if they capture the message or the person carrying the message. A wide range of techniques have been defined. The first techniques relied on their secrecy to operate. One of the first encryption schemes is attributed to Julius Caesar. When he sent confidential information to his generals, he would encode each message by replacing each letter with another letter that is :math:`n` positions after this letter in the alphabet. For example, the message `SECRET` becomes `VHFUHW` when encoded using Caesar's cipher. This technique could have puzzled some soldiers during Caesar's wars, but today even young kids can recover the original message from the ciphered one.
0/8520 · 852