Exit Zen
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
19
../../principles/referencemodels.rst:85
English
The Transport layer
0/190 · 19
19
../../principles/reliability.rst:54
English
1 Tbps
0/100 · 6
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/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
../../protocols/dns.rst:65
English
`CNAME` (or canonical names) are used to define aliases. For example `www.example.com` could be a `CNAME` for `pc12.example.com` that is the actual name of the server on which the web server for `www.example.com` runs.
0/2180 · 218
20
../../bibliography.rst:66
English
Fletcher, J., `An Arithmetic Checksum for Serial Transmissions <https://dx.doi.org/10.1109/TCOM.1982.1095369>`_, Communications, IEEE Transactions on, Jan. 1982, Vol. 30, N. 1, pp. 247-252
0/1880 · 188
20
../../glossary.rst:156
English
BGP
0/100 · 3