Exit Zen
37
../../protocols/ssh.rst:290
English
The ``ssh`` protocol includes other features that are beyond the scope of this book. Additional details may be found in [BS2005]_.
0/1300 · 130
37
../../protocols/tcp.rst:119
English
the `sequence number` set to the current value of the 32 bits counter of the server host's TCP entity
0/1010 · 101
37
../../protocols/tls.rst:155
English
`Cipher suites` : this ordered list contains the set of cryptographic algorithms that are supported by the client, with the most preferred one listed first. In contrast with ``ssh`` that allows negotiating independent algorithms for encryption, key exchange and authentication, TLS relies on suites that combine these algorithms together. Many cryptographic suites have been defined for TLS. Various recommendations have been published on the security of some of these suites :rfc:`7525`.
0/4880 · 488
37
../../protocols/wifi.rst:56
English
An 802.11 access point is a relay that operates in the datalink layer like switches. The figure below represents the layers of the reference model that are involved when a WiFi host communicates with a host attached to an Ethernet network through an access point.
0/2630 · 263
38
../../bibliography.rst:120
English
Leboudec, J.-Y., `Rate Adaptation Congestion Control and Fairness : a tutorial <http://ica1www.epfl.ch/PS_files/LEB3132.pdf>`_, Dec. 2008
0/1370 · 137
38
../../glossary.rst:159
English
EIGRP
0/100 · 5
38
../../exercises/ex-sharing.rst:643
English
Slotted ALOHA improves the performance of ALOHA by dividing the time in slots. However, this basic idea raises two interested questions. First how would you enforce the duration of these slots ? Second, should a slot include the time to transmit a data frame or the time to transmit a data frame and the corresponding acknowledgment ?
0/3340 · 334
38
../../principles/network.rst:138
English
Another interesting point that is worth being discussed is when the forwarding tables are computed. A widely used solution is to compute the entries of the forwarding tables for all destinations on all routers. This ensures that each router has a valid route towards each destination. These entries can be updated when an event occurs and the network topology changes. A drawback of this approach is that the forwarding tables can become large in large networks since each router must always maintain one entry for each destination inside its forwarding table.
0/5600 · 560
38
../../principles/transport.rst:82
English
A simple BNF specification
0/260 · 26
38
../../principles/sharing.rst:167
English
If the buffer's occupancy continues to grow, it will overflow and packets will need to be discarded. Discarding packets during congestion is the second possible reaction of a network node to congestion. Before looking at how a node can discard packets, it is interesting to discuss qualitatively the impact of the buffer occupancy on the reliable delivery of data through a network. This is illustrated by the figure below, adapted from [Jain1990]_.
0/4490 · 449
38
../../principles/security.rst:393
English
Several public key encryption schemes have been proposed. Two of them have reached wide deployment :
0/1000 · 100
38
../../exercises/ipv6.rst:384
English
on router ``R5``
0/160 · 16
38
../../exercises/routing-protocols.rst:438
English
``AS3`` is assigned ``2001:cafe:3::/48``
0/400 · 40
38
../../exercises/tcp-2.rst:411
English
The examples above have demonstrated how TCP retransmits lost segments. However, they did not consider the interactions with the congestion control scheme since the use a large initial congestion window. We now set the initial congestion window to two MSS-sized segments and use the ``tcpi_snd_cwnd`` and ``tcpi_snd_ssthresh`` variables from ``TCP_INFO`` to explore the evolution of the TCP congestion control scheme. Our first script looks at the evolution of the congestion window during a slow-start when there are no losses. This script is available from :download:`/exercises/packetdrill_scripts/slow-start.pkt`.
0/6170 · 617
38
../../protocols/bgp.rst:125
English
`NOTIFICATION` : this message is used to terminate a BGP session, usually because an error has been detected by the BGP peer. A router that sends or receives a `NOTIFICATION` message immediately shutdowns the corresponding BGP session.
0/2350 · 235
38
../../protocols/congestion.rst:201
English
:math:`area=(\frac{W}{2})^2 + \frac{1}{2} \times (\frac{W}{2})^2 = \frac{3 \times W^2}{8}`
0/900 · 90
38
../../protocols/email.rst:186
English
The email message below, copied from :rfc:`2046` shows a MIME message containing two parts that are both in plain text and encoded using the ASCII character set. The string `simple boundary` is defined in the `Content-Type:` header as the marker for the boundary between two successive parts. Another example of MIME messages may be found in :rfc:`2046`.
0/3540 · 354
38
../../protocols/ethernet.rst:176
English
100Base-FX
0/100 · 10
38
../../protocols/http.rst:158
English
the `Content-Length:` header is the :term:`MIME` header that indicates the length of the MIME document in bytes.
0/1120 · 112
38
../../protocols/http2.rst:260
English
Finally, the client and the server need to confirm the utilization of HTTP/2.0. A client confirms this by sending the following Magic string `PRI * HTTP/2.0\r\n\r\nSM\r\n\r\n` or `0x505249202a20485454502f322e300d0a0d0a534d0d0a0d0a` in hex. This string is followed by a SETTINGS frame. The server must send a possibly empty SETTINGS frame.
0/3380 · 338