Exit Zen
18
../../protocols/rpc.rst:65
English
XDR also supports the definition of unions, structures, ... Additional details are provided in :rfc:`1832`.
0/1070 · 107
18
../../protocols/ssh.rst:148
English
the client can recompute :math:`K=A^{b} \mod p` and verify the signature provided by the server
0/950 · 95
18
../../protocols/tcp.rst:44
English
the `sequence number` (32 bits), `acknowledgment number` (32 bits) and `window` (16 bits) fields are used to provide a reliable data transfer, using a window-based protocol. In a TCP bytestream, each byte of the stream consumes one sequence number. Their usage is described in more detail in section :ref:`TCPReliable`
0/3180 · 318
18
../../protocols/tls.rst:46
English
HTTP
0/100 · 4
18
../../protocols/transport-service.rst:56
English
IPv6 addresses often contain a long sequence of bits set to `0`. In this case, a compact notation has been defined. With this notation, `::` is used to indicate one or more groups of 16 bits blocks containing only bits set to `0`. For example,
0/2430 · 243
18
../../protocols/udp.rst:62
English
the registered port numbers (officially 1024 <= port < 49152)
0/610 · 61
18
../../protocols/wifi.rst:23
English
23 Mbps
0/100 · 7
19
../../bibliography.rst:64
English
Wikipedia, `Dijkstra's algorithm <https://en.wikipedia.org/wiki/Dijkstra's_algorithm>`_
0/870 · 87
19
../../glossary.rst:228
English
Asynchronous Transfer Mode
0/260 · 26
19
../../exercises/ex-sharing.rst:399
English
Suppose now that host A uses a window of three segments and sends these three segments immediately. The segments will be queued in the router before being transmitted on the output link and delivered to their destination. The destination will reply with a short acknowledgment segment. A possible visualization of this exchange of packets is represented in the figure below. We assume for this figure that the router marks the packets to indicate congestion as soon as its buffer is non-empty when its receives a packet on its input link. In the figure, a `(c)` sign is added to each packet to indicate that it has been explicitly marked.
0/6380 · 638
19
../../principles/transport.rst:47
English
If Alice wants to enter the meeting room but does not know the password, her conversation could be as follows :
0/1110 · 111
19
../../principles/sharing.rst:101
English
In large networks, fairness is always a compromise. The most widely used definition of fairness is the `max-min fairness`. A bandwidth allocation in a network is said to be `max-min fair` if it is such that it is impossible to allocate more bandwidth to one of the flows without reducing the bandwidth of a flow that already has a smaller allocation than the flow that we want to increase. If the network is completely known, it is possible to derive a `max-min fair` allocation as follows. Initially, all flows have a null bandwidth and they are placed in the candidate set. The bandwidth allocation of all flows in the candidate set is increased until one link becomes congested. At this point, the flows that use the congested link have reached their maximum allocation. They are removed from the candidate set and the process continues until the candidate set becomes empty.
0/8780 · 878
19
../../principles/security.rst:261
English
The security of the Caesar cipher depends on the confidentiality of the algorithm, but experience has shown that it is impossible to assume that an algorithm will remain secret, even for military applications. Instead, cryptographic techniques must be designed by assuming that the algorithm will be public and known to anyone. However, its behavior must be controlled by a small parameter, known as the key, that will only be known by the users who need to communicate secretly. This principle is attributed to Auguste Kerckhoff, a French cryptographer who first documented it :
0/5790 · 579
19
../../exercises/dns.rst:54
English
Continue until you find the server responsible for `www.root-servers.org`
0/730 · 73
19
../../exercises/http.rst:57
English
There are probably very few websites that only support IPv6 and not IPv4. If you find one, let us know by submitting a pull-request to change this exercise.
0/1560 · 156
19
../../exercises/ipv6.rst:150 • ../../exercises/ipv6.rst:228
English
router ``R2`` uses address ``2001:db8:1341:12::2`` on its West interface, and address ``2001:db8:1341:24::2`` on its South interface
0/1320 · 132
19
../../exercises/lan.rst:193
English
The ``addSwitch`` method creates an Ethernet switch. It assigns a random MAC address to each switch and we can configure it with a priority that is used in the high order bits of the switch identifier. We add one IP address to each switch so that we can connect to them on mininet_. In practice, IPMininet_ configures the :manpage:`brtcl(8)` software that implements the Spanning Tree protocol on Linux. We can then create the links, configure their cost if required and launch tcpdump_ to capture the Ethernet frames that contain the messages of the Spanning Tree protocol.
0/5740 · 574
19
../../exercises/routing-policies.rst:165
English
On recent routers, a lookup in the forwarding table for a destination address returns a set of outgoing interfaces. How would you design an algorithm that selects the outgoing interface used for each packet, knowing that to avoid reordering, all segments of a given TCP connection should follow the same path ?
0/3100 · 310
19
../../exercises/routing-protocols.rst:257
English
Router ``r2`` reacts to this updated Database description packet by requesting the link state information that it does not already know. For this, it sends a `LS Request` packet.
0/1780 · 178
19
../../exercises/tcp-2.rst:105
English
The :manpage:`accept` system call returns a new file descriptor, in this case value ``4``. At this point, packetdrill_ can write data on the socket or inject packets.
0/1660 · 166