Exit Zen
31
../../protocols/rpc.rst:116
English
`id`: the same identifier as the identifier chosen by the caller
0/640 · 64
31
../../protocols/ssh.rst:228
English
``padding`` : random bytes added in each message (at least four) to ensure that the message length is a multiple of the block size used by the negotiated encryption algorithm
0/1740 · 174
31
../../protocols/tcp.rst:99
English
The rest of this section is organized as follows. We first explain the establishment and the release of a TCP connection, then we discuss the mechanisms that are used by TCP to provide a reliable bytestream service. We end the section with a discussion of network congestion and explain the mechanisms that TCP uses to avoid congestion collapse.
0/3450 · 345
31
../../protocols/tls.rst:101
English
Securely agree on the keys that will be used to encrypt and authenticate the messages exchanged over the TLS session
0/1160 · 116
31
../../protocols/wifi.rst:26
English
70/250
0/100 · 6
31
../../exercises/routing-protocols.rst:370
English
Later, router ``r2`` will regularly transmit its distance vector inside an unsolicited response message that is sent towards the IPv6 multicast address ``ff02::9``.
0/1640 · 164
32
../../bibliography.rst:103
English
Karn, P., Price, H., Diersing, R., `Packet radio in amateur service <https://dx.doi.org/10.1109/JSAC.1985.1146214>`_, IEEE Journal on Selected Areas in Communications, 3, May, 1985
0/1800 · 180
32
../../exercises/ex-sharing.rst:610
English
If host `A` uses a window of two segments and needs to transmit five segments of data. How long does the entire transfer lasts ?
0/1280 · 128
32
../../exercises/reliability.rst:67
English
Implement a small software that computes the CRC-32 for a text file. Then, modify the contents of the file to change an even number of bits or an odd number of bits inside the file. When modifying the file, remember that an ASCII file is composed of 8 bits characters that are encoded by using the ASCII table that you can find at : http://en.wikipedia.org/wiki/ASCII . You can also write a small program that produces binary files that are a small variation of each other.
0/4730 · 473
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