Exit Zen
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
../../exercises/reliability.rst:40
English
when there are no losses
37/240 · 24
18
../../exercises/network.rst:152
English
Assuming that the network uses source routing, what are the possible paths from `R1` to `R4` ?
104/940 · 94
18
../../exercises/sockets.rst:144
English
The following program binds its socket to a given socket address and then waits for receiving new bytes, using the already created socket ``sock``.
159/1470 · 147
18
../../exercises/transport.rst:139
English
A reliable connection-oriented protocol can provide a message-mode service or a byte stream service. Which of the following usages of the sequence numbers is the best suited for each of these services ?
181/2020 · 202
18
../../principles/naming.rst:109
English
the address of any host residing directly inside domain `dom` (e.g. `h2.dom` in the figure above)
113/970 · 97
18
../../principles/network.rst:83
English
The datagram organization
25/250 · 25