Exit Zen
51
../../glossary.rst:200
English
The File Transfer Protocol is defined in :rfc:`959`
0/510 · 51
51
../../exercises/network.rst:364
English
1 via B
0/100 · 7
51
../../exercises/sockets.rst:365
English
For example, the ``htonl(3)`` (resp. ``ntohl(3)``) function the standard C library converts a 32-bits unsigned integer from the byte order used by the CPU to the network byte order (resp. from the network byte order to the CPU byte order). Similar functions exist in other programming languages.
0/2950 · 295
51
../../principles/network.rst:217
English
the `control packets`
0/210 · 21
51
../../principles/reliability.rst:215
English
Given that multi-symbol encodings cannot be used by all physical layers, a generic solution which can be used with any physical layer that is able to transmit and receive only bits `0` and `1` is required. This generic solution is called `stuffing` and two variants exist : `bit stuffing` and `character stuffing`. To enable a receiver to easily delineate the frame boundaries, these two techniques reserve special bit strings as frame boundary markers and encode the frames so that these special bit strings do not appear inside the frames.
0/5410 · 541
51
../../principles/sharing.rst:203
English
Dropping and marking packets is not the only possible reaction of a router that becomes congested. A router could also selectively delay packets belonging to some flows. There are different algorithms that can be used by a router to delay packets. If the objective of the router is to fairly distribute to bandwidth of an output link among competing flows, one possibility is to organize the buffers of the router as a set of queues. For simplicity, let us assume that the router is capable of supporting a fixed number of concurrent flows, say `N`. One of the queues of the router is associated to each flow and when a packet arrives, it is placed at the tail of the corresponding queue. All the queues are controlled by a `scheduler`. A `scheduler` is an algorithm that is run each time there is an opportunity to transmit a packet on the outgoing link. Various schedulers have been proposed in the scientific literature and some are used in real routers.
0/9570 · 957
51
../../principles/transport.rst:125
English
Most networks use a datagram organization and provide a simple service which is called the `connectionless service`.
0/1160 · 116
52
../../bibliography.rst:319
English
Stone, J., Greenwald, M., Partridge, C., and Hughes, J., `Performance of checksums and CRC's over real data <https://dx.doi.org/10.1109/90.731187>`_. IEEE/ACM Transactions Networking 6, 5 (Oct. 1998), 529-543.
0/2090 · 209
52
../../glossary.rst:313
English
hosts.txt
0/100 · 9
52
../../exercises/network.rst:364 • ../../exercises/network.rst:366
English
2 via C
0/100 · 7
52
../../principles/reliability.rst:217
English
`Bit stuffing` reserves the `01111110` bit string as the frame boundary marker and ensures that there will never be six consecutive `1` symbols transmitted by the physical layer inside a frame. With bit stuffing, a frame is sent as follows. First, the sender transmits the marker, i.e. `01111110`. Then, it sends all the bits of the frame and inserts an additional bit set to `0` after each sequence of five consecutive `1` bits. This ensures that the sent frame never contains a sequence of six consecutive bits set to `1`. As a consequence, the marker pattern cannot appear inside the frame sent. The marker is also sent to mark the end of the frame. The receiver performs the opposite to decode a received frame. It first detects the beginning of the frame thanks to the `01111110` marker. Then, it processes the received bits and counts the number of consecutive bits set to `1`. If a `0` follows five consecutive bits set to `1`, this bit is removed since it was inserted by the sender. If a `1` follows five consecutive bits sets to `1`, it indicates a marker if it is followed by a bit set to `0`. The table below illustrates the application of bit stuffing to some frames.
0/11800 · 1180
52
../../principles/transport.rst:127
English
The figure below provides a representation of the connectionless service as a `time-sequence diagram`. The user on the left, having address `S`, issues a `Data.request` primitive containing Service Data Unit (SDU) `M` that must be delivered by the service provider to destination `D`. The dashed line between the two primitives indicates that the `Data.indication` primitive that is delivered to the user on the right corresponds to the `Data.request` primitive sent by the user on the left.
0/4910 · 491
53
../../bibliography.rst:323
English
Semke, J., Mahdavi, J., and Mathis, M., `Automatic TCP buffer tuning <http://doi.acm.org/10.1145/285243.285292>`_. SIGCOMM Computer Communication Review 28, 4 (Oct. 1998), 315-323.
0/1800 · 180
53
../../glossary.rst:315
English
The original file containing the list of all Internet hosts. This file has been deprecated, but Unix variants still maintain a local ``/etc/hosts`` containing mappings between names and IP addresses. See http://man7.org/linux/man-pages/man5/hosts.5.html for a description of the format of this file on Linux.
0/3080 · 308
53
../../exercises/network.rst:364
English
3 via D
0/100 · 7
53
../../principles/reliability.rst:220 • ../../principles/reliability.rst:258
English
Original frame
0/140 · 14
53
../../principles/transport.rst:146
English
There are several possible implementations of the connectionless service. Before studying these realizations, it is useful to discuss the possible characteristics of the connectionless service. A `reliable connectionless service` is a service where the service provider guarantees that all SDUs submitted in `Data.requests` by a user will eventually be delivered to their destination. Such a service would be very useful for users, but guaranteeing perfect delivery is difficult in practice. For this reason, network layers usually support an `unreliable connectionless service`.
0/5790 · 579
54
../../bibliography.rst:329
English
Stevens R. and Fenner, and Rudoff, A., `UNIX Network Programming: The sockets networking API <http://books.google.com/books?id=ptSC4LpwGA0C>`_, Addison Wesley, 2004
0/1640 · 164
54
../../glossary.rst:262
English
HTML
0/100 · 4
54
../../exercises/network.rst:365
English
C
0/100 · 1