Exit Zen
32
../../protocols/rpc.rst:117
English
`result`: if the request succeeded, this member contains the result of the request (in our example, value `4`).
0/1110 · 111
32
../../protocols/ssh.rst:231
English
``MAC`` : this field is present if a Message Authentication Code has been negotiated for the session (in practice, using ``ssh`` without authentication is risky and this field should always be present). Note that to compute the MAC, an ``ssh`` implementation must maintain a message counter. This counter is incremented by one every time a message is sent and the MAC is computed with the negotiated authentication algorithm using the MAC key over the concatenation of the message counter and the cleartext message. The message counter is not transmitted, but the recipient can easily recover its value. The ``MAC`` is computed as :math:`mac = MAC(key, sequence\_number || unencrypted\_message)` where the key is the negotiated authentication key.
0/7470 · 747
32
../../protocols/tcp.rst:107
English
TCP connection establishment
0/280 · 28
32
../../protocols/tls.rst:105
English
The TLS handshake is a four-way handshake illustrated in the figure below.
0/740 · 74
32
../../protocols/wifi.rst:29
English
When developing its family of standards, the `IEEE 802.11 working group <http://www.ieee802.org/11/>`_ took a similar approach as the `IEEE 802.3 working group <http://www.ieee802.org/3/>`_ that developed various types of physical layers for Ethernet networks. 802.11 networks use the CSMA/CA Medium Access Control technique described earlier and they all assume the same architecture and use the same frame format.
0/4150 · 415
33
../../bibliography.rst:106
English
Kung, N.T. Morris, R., `Credit-based flow control for ATM networks <https://dx.doi.org/10.1109/65.372658>`_, IEEE Network, Mar/Apr 1995, Volume: 9, Issue: 2, pages: 40-48
0/1730 · 173
33
../../exercises/ex-sharing.rst:611
English
Same question as above, but now host `A` uses the simple DECBIT congestion control mechanism and a maximum window size of four segments.
0/1360 · 136
33
../../exercises/network.rst:325
English
Host `A` uses the same flat address for both links.
61/510 · 51
33
../../exercises/sockets.rst:284
English
The ``2001:6a8:308f:9:0:82ff:fe68:e520`` IPv6 address identifies the computer serving the ``https://beta.computer-networking.info`` website.
137/1400 · 140
33
../../principles/naming.rst:142
English
See http://www.donelan.com/dnstimeline.html for a time line of DNS related developments.
97/880 · 88
33
../../principles/referencemodels.rst:132
English
The TCP/IP reference model
29/260 · 26
33
../../principles/network.rst:128
English
Besides the `data plane`, a network is also characterized by its `control plane`. The control plane includes all the protocols and algorithms (often distributed) that compute the forwarding tables that are installed on all routers inside the network. While there is only one possible `data plane` for a given networking technology, different networks using the same technology may use different control planes.
0/4100 · 410
33
../../principles/transport.rst:70
English
`carriage return` (`CR`) : `0001101b`
0/370 · 37
33
../../principles/sharing.rst:153
English
The node's capacity in bits per second mainly depends on the physical interfaces that it uses and also on the capacity of the internal interconnection (bus, crossbar switch, ...) between the different interfaces inside the node. Many vendors, in particular for low-end devices will use the sum of the bandwidth of the nodes' interfaces as the node capacity in bits per second. Measurements do not always match this maximum theoretical capacity. A well designed network node will usually have a capacity in bits per second larger than the sum of its link capacities. Such nodes will usually reach this maximum capacity when forwarding large packets.
0/6480 · 648
33
../../principles/security.rst:371
English
These two keys are generated together and they are linked by a complex mathematical relationship that is such that it is computationally difficult to compute :math:`K_{priv}` from :math:`K_{pub}`.
0/1960 · 196
33
../../exercises/dns.rst:112
English
Footnotes
21/100 · 9
33
../../exercises/ipv6.rst:297
English
...
0/100 · 3
33
../../exercises/routing-protocols.rst:378
English
Exploring BGP
0/130 · 13
33
../../exercises/tcp-2.rst:259
English
Another very interesting utilization of packetdrill_ is to explore how a TCP stack reacts to acknowledgments that would correspond to lost or reordered segments. For this analysis, we configure a very large initial congestion window to ensure that the connection does not start with a slow-start.
0/2960 · 296
33
../../protocols/bgp.rst:110
English
BGP routers exchange routes over BGP sessions. A BGP session is established between two routers belonging to two different domains that are directly connected. As explained earlier, the physical connection between the two routers can be implemented as a private peering link or over an Internet eXchange Point. A BGP session between two adjacent routers runs above a TCP connection (the default BGP port is 179). In contrast with intradomain routing protocols that exchange IP packets or UDP segments, BGP runs above TCP because TCP ensures a reliable delivery of the BGP messages sent by each router without forcing the routers to implement acknowledgments, checksums, etc. Furthermore, the two routers consider the peering link to be up as long as the BGP session and the underlying TCP connection remain up [#flifetimebgp]_. The two endpoints of a BGP session are called `BGP peers`.
0/8860 · 886