Exit Zen
18
../../bibliography.rst:63
English
Dijkstra, E., `A Note on Two Problems in Connection with Graphs <https://dx.doi.org/10.1007/BF01386390>`_. Numerische Mathematik, 1:269- 271, 1959
0/1460 · 146
18
../../glossary.rst:226
English
ATM
0/100 · 3
18
../../exercises/ex-sharing.rst:382
English
To understand congestion control algorithms, it can also be useful to represent the exchange of packets by using a graphical representation. As a first example, let us consider a very simple network composed of two hosts interconnected through a switch.
0/2530 · 253
18
../../exercises/network.rst:152
English
Assuming that the network uses source routing, what are the possible paths from `R1` to `R4` ?
0/940 · 94
18
../../exercises/reliability.rst:40
English
when there are no losses
0/240 · 24
18
../../exercises/sockets.rst:144
English
The following program binds its socket to a given socket address and then waits for receiving new bytes, using the already created socket ``sock``.
0/1470 · 147
18
../../exercises/transport.rst:139
English
A reliable connection-oriented protocol can provide a message-mode service or a byte stream service. Which of the following usages of the sequence numbers is the best suited for each of these services ?
0/2020 · 202
18
../../principles/naming.rst:109
English
the address of any host residing directly inside domain `dom` (e.g. `h2.dom` in the figure above)
0/970 · 97
18
../../principles/network.rst:83
English
The datagram organization
0/250 · 25
18
../../principles/reliability.rst:53
English
:math:`10^9`
0/120 · 12
18
../../principles/transport.rst:45
English
Bob : `This is the correct password, you're welcome`
0/520 · 52
18
../../protocols/dns.rst:63
English
This answer contains several pieces of information. First, the name `www.ietf.org` is associated to IP address `2001:1890:123a::1:1e`. Second, the `ietf.org` domain is managed by six different nameservers. Five of these nameservers are reachable via IPv4 and IPv6.
0/2640 · 264
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
../../exercises/network.rst:176
English
The network operator uses would like to have the following paths in this network :
0/820 · 82
19
../../exercises/sockets.rst:173
English
Depending on the socket address family, the operating system might implicitly assign an address to an unbound socket upon a call to ``write``, ``send`` or ``sendto``. While this is a useful behavior, describing it precisely is out of the scope of this section.
0/2600 · 260
19
../../exercises/transport.rst:141
English
DATA segments contain a sequence number that is incremented for each byte transmitted
0/850 · 85
19
../../principles/naming.rst:110
English
the nameserver(s) that are responsible for any direct sub-domain of domain `dom` (i.e. `sdom1.dom` and `sdom2.dom` in the figure above, but not `z.sdom1.dom`)
0/1580 · 158
19
../../principles/network.rst:85
English
The first and most popular organization of the network layer is the datagram organization. This organization is inspired by the organization of the postal service. Each host is identified by a `network layer address`. To send information to a remote host, a host creates a packet that contains:
0/2940 · 294