Exit Zen
23
../../protocols/dns.rst:80
English
Footnotes
0/100 · 9
24
../../bibliography.rst:74
English
Feldmeier, D. C., `Fast software implementation of error detection codes <https://dx.doi.org/10.1109/90.477710>`_. IEEE/ACM Transactions Networking 3, 6 (Dec. 1995), 640-651.
0/1740 · 174
24
../../glossary.rst:24
English
broadcast
0/100 · 9
24
../../exercises/ex-sharing.rst:559
English
How is the maximum round-trip-time influenced if the buffers of router `R1` store 10 packets ?
0/940 · 94
24
../../exercises/network.rst:210
English
`R1->R2->R4` and `R3->R2->R5->R4`
0/330 · 33
24
../../exercises/reliability.rst:54
English
Reliable protocols rely on different types of checksums to verify whether frames have been affected by transmission errors. The most frequently used checksums are :
0/1640 · 164
24
../../exercises/sockets.rst:224
English
This system call will assign the socket ``sockfd`` to the ``addr`` remote socket address. The process can then use the ``send`` and ``write`` system calls that do not to specify the destination socket address. Furthermore, the calls to ``recv`` and ``read`` will only deliver messages sent by this remote address. This is useful when we only care about the other peer messages.
0/3770 · 377
24
../../exercises/transport.rst:155
English
Footnotes
0/100 · 9
24
../../principles/naming.rst:123
English
Benefits of names
0/170 · 17
24
../../principles/referencemodels.rst:103
English
The upper layer of our architecture is the `Application layer`. This layer includes all the mechanisms and data structures that are necessary for the applications. We will use Application Data Unit (ADU) or the generic Service Data Unit (SDU) term to indicate the data exchanged between two entities of the Application layer.
0/3250 · 325
24
../../principles/reliability.rst:63
English
set the voltage on the electrical wire at ``-5V`` during one millisecond to transmit a bit set to `0`
0/1010 · 101
24
../../principles/sharing.rst:133
English
Besides the link bandwidth, the buffers on the network nodes are the second type of resource that needs to be shared inside the network. The node buffers play an important role in the operation of the network because that can be used to absorb transient traffic peaks. Consider again the example above. Assume that on average host `A` and host `B` send a group of three packets every ten seconds. Their combined transmission rate (0.6 packets per second) is, on average, lower than the network capacity (1 packet per second). However, if they both start to transmit at the same time, node `R1` will have to absorb a burst of packets. This burst of packets is a small `network congestion`. We will say that a network is congested, when the sum of the traffic demand from the hosts is larger than the network capacity :math:`\sum{demand}>capacity`. This `network congestion` problem is one of the most difficult resource sharing problem in computer networks. `Congestion` occurs in almost all networks. Minimizing the amount of congestion is a key objective for many network operators. In most cases, they will have to accept transient congestion, i.e. congestion lasting a few seconds or perhaps minutes, but will want to prevent congestion that lasts days or months. For this, they can rely on a wide range of solutions. We briefly present some of these in the paragraphs below.
0/13780 · 1378
24
../../protocols/dns.rst:81
English
Some DNS resolvers allow any host to send queries. Google operates a `public DNS resolver <https://developers.google.com/speed/public-dns/docs/using>`_ at addresses `2001:4860:4860::8888` and `2001:4860:4860::8844`. Other companies provide similar services.
0/2570 · 257
25
../../bibliography.rst:80
English
Gettys, J., Nichols, K., `Bufferbloat: dark buffers in the internet <http://queue.acm.org/detail.cfm?id=2063196>`_. Communications of the ACM 55, no. 1 (2012): 57-65.
0/1660 · 166
25
../../glossary.rst:26
English
a transmission mode where is same information is sent to all nodes in the network
0/810 · 81
25
../../exercises/ex-sharing.rst:560
English
If hosts `A` and `B` send to `D` 1000 bits segments and use a sending window of four segments, what is the maximum throughput that they can achieve ?
0/1490 · 149
25
../../exercises/reliability.rst:56
English
the Internet checksum used by UDP, TCP and other Internet protocols which is defined in :rfc:`1071` and implemented in various libraries.
0/1370 · 137
25
../../exercises/sockets.rst:227
English
The following program connects a socket to a remote address, sends a message and waits for a reply.
0/990 · 99
25
../../principles/network.rst:102
English
With the datagram organization, routers use `hop-by-hop forwarding`. This means that when a router receives a packet that is not destined to itself, it looks up the destination address of the packet in its `forwarding table`. A `forwarding table` is a data structure that maps each destination address (or set of destination addresses) to the outgoing interface over which a packet destined to this address must be forwarded to reach its final destination. The router consults its forwarding table to forward each packet that it handles.
0/5370 · 537
25
../../principles/referencemodels.rst:114
English
In the remaining chapters of this text, we will often refer to the information exchanged between entities located in different layers. To avoid any confusion, we will stick to the terminology defined earlier, i.e. :
0/2150 · 215