Exit Zen
17
../../exercises/ex-sharing.rst:345
English
Consider the network below. Compute the max-min fair allocation for the hosts in this network assuming that nodes `Sx` always send traffic towards node `Dx`. Furthermore, link `R1-R2` has a bandwidth of 10 Mbps while link `R2-R3` has a bandwidth of 20 Mbps.
0/2570 · 257
17
../../exercises/network.rst:132 • ../../exercises/network.rst:154 • ../../exercises/network.rst:184 • ../../exercises/network.rst:216
English
Consider the network shown in the figure below.
0/470 · 47
17
../../exercises/transport.rst:137
English
In the transport layer, the receive window advertised by a receiver can vary during the lifetime of the connection. What are the causes for these variations ?
0/1580 · 158
17
../../principles/naming.rst:107
English
A :term:`nameserver` that is responsible for domain `dom` can directly answer the following queries :
0/1010 · 101
17
../../principles/network.rst:79
English
`virtual circuits`
0/180 · 18
17
../../principles/referencemodels.rst:73
English
The `Datalink layer` allows directly connected hosts to exchange information, but it is often necessary to exchange information between hosts that are not attached to the same physical medium. This is the task of the `network layer`. The `network layer` is built above the `datalink layer`. Network layer entities exchange `packets`. A `packet` is a finite sequence of bytes that is transported by the datalink layer inside one or more frames. A packet usually contains information about its origin and its destination, and usually passes through several intermediate devices called routers on its way from its origin to its destination.
0/6370 · 637
17
../../principles/reliability.rst:53
English
1 Gbps
0/100 · 6
17
../../principles/sharing.rst:66
English
Fairness in computer networks
0/290 · 29
17
../../principles/transport.rst:44
English
Trudy : `1234`
0/140 · 14
17
../../protocols/dns.rst:61
English
Query for the `AAAA` record of `www.ietf.org`
0/450 · 45
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