Exit Zen
13
../../exercises/reliability.rst:33
English
Each acknowledgment contains `c` bytes of control information
67/610 · 61
13
../../exercises/network.rst:101
English
Is it possible to configure the link weights so that the packets sent by the router located in `Los Angeles` to router located in `New York` follow one path while the packets sent by the router located in `New York` to the router located in `Los Angeles` follow a completely different path ?
317/2920 · 292
13
../../exercises/sockets.rst:120
English
The first argument is the file descriptor of the socket that we use to perform the communication. ``buf`` is a buffer of length ``len`` containing the bytes to send to the peer. The usage of ``flags`` argument is out of the scope of this section and can be set to 0. ``dest_addr`` is the socket address of the destination to which we want to send the bytes, its length is passed using the ``addrlen`` argument.
458/4100 · 410
13
../../exercises/transport.rst:122
English
A network layer service guarantees that a packet will never live during more than 100 seconds inside the network. Consider a reliable connection-oriented transport protocol that places a 32 bits sequence number inside each segment. What is the maximum rate (in segments per second) at which is should sent data segments to prevent having two segments with the same sequence number inside the network ?
439/4010 · 401
13
../../principles/naming.rst:75
English
Some visually similar characters have different character codes
87/630 · 63
13
../../principles/referencemodels.rst:54 • ../../principles/referencemodels.rst:65
English
The Datalink layer
18/180 · 18
13
../../principles/reliability.rst:51
English
1 Kbps
6/100 · 6
13
../../principles/transport.rst:33
English
Alice : `Thank you`
15/190 · 19
13
../../principles/sharing.rst:53
English
A fifth physical organization of a network is the tree. Such networks are typically used when a large number of customers must be connected in a very cost-effective manner. Cable TV networks are often organized as trees.
0/2200 · 220
13
../../principles/security.rst:179
English
As Mallory receives all the packets sent by both Bob and Alice, he can modify them at will. For example, he could modify the commands sent by Alice to the server managed by Bob and change the responses sent by the server. This type of attack is very powerful and sometimes difficult to counter without relying on advanced cryptographic techniques.
0/3470 · 347
13
../../exercises/dns.rst:43
English
What are the nameservers that are responsible for the `info` top-level domain ? Is it possible to use IPv6 to query them ?
0/1220 · 122
13
../../exercises/http.rst:35
English
curl_ supports a huge number of options and parameters that are described in its `man page <https://curl.haxx.se/docs/manpage.html>`_ Some of them allow you to force the utilization of a specific version of HTTP. These include `--http0.9`, `--http1.0`, `--http1.1` and `--http2`. Using the latter, verify whether your favorite website supports HTTP/2.0.
0/3530 · 353
13
../../exercises/ipv6.rst:42
English
router ``R3`` uses address ``2001:db8:1341:34::3`` on its East interface, address ``2001:db8:1341:23::3`` on its North-East interface and address ``2001:db8:1341:13::3`` on its North interface
0/1920 · 192
13
../../exercises/lan.rst:85
English
Consider the network depicted in Fig. 5. Both of the hosts `H0` and `H1` have two interfaces: one connected to the switch `S0` and the other one to the switch `S1`. Will the link between `S0` and `S1` ever be used? If so, under which assumptions? Provide a comprehensive answer.
0/2780 · 278
13
../../exercises/routing-policies.rst:143
English
Consider that the AS stub (`AS456`) shown in the figure below decides to advertise two ``/48`` prefixes instead of its allocated ``/47`` prefix.
0/1440 · 144
13
../../exercises/routing-protocols.rst:186
English
In its output, we see that ``r1`` is attached to two different routers. Finally, the ``show ipv6 ospf6 database`` returns the full OSPFv3 database with all the link state information that was distributed by OSPFv3.
0/2140 · 214
13
../../exercises/tcp-2.rst:65
English
For this first example, we program packetdrill_ to inject the segments that a client would send. The first step is thus to prepare a :manpage:`socket` that can be used to accept this connection. This socket can be created by using the four system calls below.
0/2590 · 259
13
../../exercises/trace.rst:82
English
wireshark_ is more recent than tcpdump_. It evolved from the ethereal packet trace analysis software. It can be used as a text tool like tcpdump_. For a TCP connection, wireshark_ can provide almost the same output as tcpdump_. The main advantage of wireshark_ is that it also includes a graphical user interface that allows performing various types of analysis on a packet trace.
0/3800 · 380
13
../../protocols/bgp.rst:53
English
A simple Internet with peering relationships
0/440 · 44
13
../../protocols/congestion.rst:46
English
Most TCP implementations update the congestion window when they receive an acknowledgment. If we assume that the receiver acknowledges each received segment and the sender only sends MSS sized segments, the TCP congestion control scheme can be implemented using the simplified pseudo-code [#fwrap]_ below. This pseudocode includes the optimization proposed in :rfc:`3042` that allows a sender to send new unsent data upon reception of the first or second duplicate acknowledgment. The reception of each of these acknowledgment indicates that one segment has left the network and thus additional data can be sent without causing more congestion. Note that the congestion window is *not* increased upon reception of these first duplicate acknowledgments.
0/7520 · 752