Exit Zen
28
../../exercises/ex-sharing.rst:582
English
Compute the max-min fair bandwidth allocation in the network below.
0/670 · 67
28
../../exercises/network.rst:250
English
The network below uses port forwarding tables. It has been running for several hours and all hosts have exchanged packets. What is the content of the port forwarding tables ?
0/1740 · 174
28
../../exercises/sockets.rst:264
English
A program can use the ``socket`` system call to create a new socket.
0/680 · 68
28
../../principles/network.rst:108
English
In a network, a path can be defined as the list of all intermediate routers for a given source destination pair. For a given source/destination pair, the path can be derived by first consulting the forwarding table of the router attached to the source to determine the next router on the path towards the chosen destination. Then, the forwarding table of this router is queried for the same destination... The queries continue until the destination is reached. In a network that has valid forwarding tables, all the paths between all source/destination pairs contain a finite number of intermediate routers. However, if forwarding tables have not been correctly computed, two types of invalid paths can occur.
0/7090 · 709
28
../../principles/referencemodels.rst:118
English
network layer entities exchange *packets*
0/410 · 41
28
../../principles/transport.rst:63
English
`0` : `0110000b`
0/160 · 16
29
../../bibliography.rst:95
English
Jain, R., `Congestion control in computer networks : Issues and trends <https://dx.doi.org/10.1109/65.56532>`_, IEEE Network Magazine, May 1990, pp. 24-30
0/1540 · 154
29
../../glossary.rst:285
English
A synonym for a regular telephone line, i.e. a line that can be used to dial any telephone number.
0/980 · 98
29
../../exercises/ex-sharing.rst:588
English
Simple network topology
0/230 · 23
29
../../exercises/network.rst:273
English
At this point, a new link is added between `R1` and `R3`. What happens for the forwarding of packets ?
0/1020 · 102
29
../../exercises/reliability.rst:62
English
The Cyclic Redundancy Checks (CRCs) are efficient error detection codes that are able to detect :
0/970 · 97
29
../../exercises/sockets.rst:270
English
The ``domain`` parameter specifies the address family that we will use to concretely perform the communication. For an IPv6 socket, the ``domain`` parameter will be set to the value ``AF_INET6``, telling the operating system that we plan to communicate using IPv6 addresses. The ``type`` parameter specifies the communication guarantees that we need. For now, we will use the type ``SOCK_DGRAM`` which allows us to send *unreliable messages*. This means that each data that we send at each call of ``sendto`` will either be completely received or not received at all. The last parameter will be set to ``0``. The following line creates a socket, telling the operating system that we want to communicate using IPv6 addresses and that we want to send unreliable messages.
0/7690 · 769
29
../../principles/network.rst:112
English
A path may lead to a `black hole`. In a network, a black hole is a router that receives packets for at least one given source/destination pair but does not have an entry inside its forwarding table for this destination. Since it does not know how to reach the destination, the router cannot forward the received packets and must discard them. Any centralized or distributed algorithm that computes forwarding tables must ensure that there are not black holes inside the network.
0/4780 · 478
29
../../principles/referencemodels.rst:119
English
transport layer entities exchange *segments*
0/440 · 44
29
../../principles/sharing.rst:145
English
Packets per second versus bits per second
0/410 · 41
29
../../principles/transport.rst:64
English
`z` : `1111010b`
0/160 · 16
30
../../bibliography.rst:97
English
Jung, J., Sit, E., Balakrishnan, H., and Morris, R. 2002. `DNS performance and the effectiveness of caching <https://dx.doi.org/10.1109/TNET.2002.803905>`_. IEEE/ACM Transactions Networking 10, 5 (Oct. 2002), 589-603.
0/2170 · 217
30
../../glossary.rst:54 • ../../glossary.rst:211 • ../../glossary.rst:232
English
DNS
0/100 · 3
30
../../exercises/ex-sharing.rst:591
English
Consider the simple network depicted in the figure below.
0/570 · 57
30
../../exercises/network.rst:276
English
The network below uses port forwarding tables. What happens if host `A` moves by removing its link with `R1` and replacing it with a link with `R3`? How should networks using port forwarding deal with such mobile hosts ?
0/2200 · 220