Exit Zen
32
../../principles/network.rst:122
English
The `forwarding tables` and the precise format of the packets that are exchanged inside the network are part of the `data plane` of the network. This `data plane` contains all the protocols and algorithms that are used by hosts and routers to create and process the packets that contain user data. On high-end routers, the data plane is often implemented in hardware for performance reasons.
0/3910 · 391
32
../../principles/transport.rst:68
English
In addition, the :term:`ASCII` table also defines several non-printable or control characters. These characters were designed to allow an application to control a printer or a terminal. These control characters include `CR` and `LF`, that are used to terminate a line, and the `Bell` character which causes the terminal to emit a sound.
0/3360 · 336
32
../../principles/sharing.rst:151
English
the node's lookup performance measured in packets per second
0/600 · 60
32
../../principles/security.rst:368
English
a private key (:math:`K_{priv}`) that he needs to store in a secure manner and never reveal to anyone
0/1010 · 101
32
../../exercises/dns.rst:101
English
When a client requests the mapping of a domain name into an IP address to its local resolver, the resolver may need to query a large number of nameservers starting from the root nameserver. The three exercises below show packet traces collected while the resolver was resolving the following names: `www.example.com`, `www.google.com` and `www.computer-networking.info`. If you understand how the DNS operates, you should be able to correctly reorder those packet traces.
0/4710 · 471
32
../../exercises/ipv6.rst:296
English
``p:24/64`` for the link between ``R2`` and ``R4``. On this subnet, ``R2`` uses address ``p:24::2`` while router ``R4`` uses address ``p:24::4``
0/1440 · 144
32
../../exercises/routing-protocols.rst:374
English
The packet traces collected on the three routers of this example are available from :download:`/exercises/traces/ripng-r1-trace.pcap`, :download:`/exercises/traces/ripng-r2-trace.pcap` and :download:`/exercises/traces/ripng-r3-trace.pcap`.
0/2390 · 239
32
../../exercises/tcp-2.rst:234
English
A third scenario for the termination of a TCP connection is that the remote hosts sends its ``FIN`` first. This script is available from :download:`/exercises/packetdrill_scripts/remote-close.pkt`.
0/1970 · 197
32
../../protocols/bgp.rst:106
English
Simple exchange of BGP routes
0/290 · 29
32
../../protocols/congestion.rst:182
English
If the router uses several queues served by a scheduler, the situation is different. If a large and a small flow are competing for bandwidth, the scheduler will already favor the small flow that is not using its fair share of the bandwidth. The queue for the small flow will be almost empty while the queue for the large flow will build up. On routers using such schedulers, a good way of marking the packets is to set a threshold on the occupancy of each queue and mark the packets that arrive in a particular queue as soon as its occupancy is above the configured threshold.
0/5760 · 576
32
../../protocols/email.rst:175
English
The `Content-Type:` header line indicates the type of data that is carried inside the message (see below).
0/1060 · 106
32
../../protocols/ethernet.rst:173
English
10BaseT
0/100 · 7
32
../../protocols/http.rst:124
English
a MIME document
0/150 · 15
32
../../protocols/http2.rst:230
English
Another feature of HTTP/2.0 is that it is possible to assign different priorities to different streams. A high priority stream should carry more `Data` frames than a lower priority ones. The HTTP/2.0 specification defines `Priority` frames which can be used for this purpose.
0/2750 · 275
32
../../protocols/ipv6.rst:120
English
``ff01:0:0:0:0:0:0:101`` is represented as ``ff01::101``
0/580 · 58
32
../../protocols/ethernet.rst:97
English
does not reorder the transmitted frames
0/390 · 39
32
../../protocols/routing.rst:99
English
These summary advertisements are flooded through the backbone area attached to routers `RB` and `RC`. In its routing table, router `RA` selects the summary advertised by `RB` to reach `2001:db8:1234::/48` and the summary advertised by `RC` to reach `2001:db8:5678::/48`. Inside `area 1`, router `RA` advertises a summary indicating that `2001:db8:1234::/48` and `2001:db8:5678::/48` are both at a distance of `3` from itself.
0/4250 · 425
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