Exit Zen
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
38
../../protocols/ipv6.rst:128
English
``2001:0db8:0:cd30::`` / ``60``
0/310 · 31
38
../../protocols/ethernet.rst:156
English
A hierarchical Ethernet network composed of hubs
0/480 · 48
38
../../protocols/routing.rst:130
English
A first solution to support such a LAN with a link-state routing protocol would be to consider that a LAN is equivalent to a full-mesh of point-to-point links as if each router can directly reach any other router on the LAN. However, this approach has two important drawbacks :
0/2770 · 277
38
../../protocols/rpc.rst:131
English
If the `sum` method is not implemented on the server, it would reply with the following response.
0/970 · 97
38
../../protocols/ssh.rst:295
English
Footnotes
0/100 · 9
38
../../protocols/tcp.rst:120 • ../../protocols/tcp.rst:126
English
the `ACK` flag set
0/180 · 18
38
../../protocols/tls.rst:162
English
`Compression algorithm` : the client may propose the utilization of a specific compression algorithm (e.g. zlib). In theory, compressing the data before encrypting it is an intelligent way to reduce the amount of data exchanged. Unfortunately, its implementation in TLS has caused several security problems [PHG2013]_. For this reason, compression is usually disabled in TLS :rfc:`7525`.
0/3870 · 387
38
../../protocols/wifi.rst:93
English
802.11 devices exchange variable length frames, which have a slightly different structure than the simple frame format used in Ethernet LANs. We review the key parts of the 802.11 frames. Additional details may be found in [IEEE802.11]_ and [Gast2002]_ . An 802.11 frame contains a fixed length header, a variable length payload that may contain up 2324 bytes of user data and a 32 bits CRC. Although the payload can contain up to 2324 bytes, most 802.11 deployments use a maximum payload size of 1500 bytes as they are used in `infrastructure` networks attached to Ethernet LANs. An 802.11 data frame is shown below.
0/6170 · 617
39
../../bibliography.rst:121
English
McKeown N, Anderson T, Balakrishnan H, Parulkar G, Peterson L, Rexford J, Shenker S, Turner J., `OpenFlow: enabling innovation in campus networks <https://doi.org/10.1145/1355734.1355746>`_. ACM SIGCOMM Computer Communication Review. 2008 Mar 31;38(2):69-74.
0/2580 · 258