Exit Zen
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
25
../../principles/reliability.rst:66
English
On the receiver side :
0/220 · 22
25
../../principles/transport.rst:58
English
Let us first discuss the syntactical rules. We will later explain how the information flow can be organized by analyzing real networked applications.
0/1490 · 149
26
../../bibliography.rst:85
English
Garcia-Lunes-Aceves, J., `Loop-Free Routing Using Diffusing Computations <https://dx.doi.org/10.1109/90.222913>`_, IEEE/ACM Transactions on Networking, Vol. 1, No, 1, Feb. 1993
0/1760 · 176
26
../../glossary.rst:129
English
CIDR
0/100 · 4
26
../../exercises/ex-sharing.rst:561
English
Assume now that `R1` is using round-robin scheduling instead of a FIFO buffer. One queue is used to store the packets sent by `A` and another for the packets sent by `B`. `A` sends one 1000 bits packet every second while `B` sends packets at 10 Mbps. What is the round-trip-time measured by each of these two hosts if each of the two queues of `R1` can store 5 packets ?
0/3700 · 370
26
../../exercises/network.rst:240
English
`R1->R5->R4` and `R3->R2->R4`
0/290 · 29
26
../../exercises/reliability.rst:57
English
the 16 bits or the 32 bits Cyclical Redundancy Checks (CRC) that are often used on disks, in zip archives and in datalink layer protocols. See http://rosettacode.org/wiki/CRC-32 for CRC-32 implementations in various languages.
0/2260 · 226
26
../../exercises/sockets.rst:259
English
Creating a new socket to communicate through a network
0/540 · 54
26
../../principles/naming.rst:127
English
if the server process moves to another physical server, all clients must be informed about the new server address
0/1130 · 113
26
../../principles/network.rst:104
English
The figure illustrates some possible forwarding tables in this network. By inspecting the forwarding tables of the different routers, one can find the path followed by packets sent from a source to a particular destination. In the example above, host `A` sends its packet to router `R1`. `R1` consults its forwarding table and forwards the packet towards `R2`. Based on its own table, `R2` decides to forward the packet to `R5` that can deliver it to its destination. Thus, the path from `A` to `J` is `A -> R1 -> R2 -> R5 -> J`.
0/5290 · 529
26
../../principles/referencemodels.rst:116
English
physical layer entities exchange bits
0/370 · 37
26
../../principles/reliability.rst:66
English
every millisecond, record the voltage applied on the electrical wire. If the voltage is set to ``+5V``, record the reception of bit `1`. Otherwise, record the reception of bit `0`
0/1790 · 179
26
../../principles/sharing.rst:139
English
Congestion collapse on the Internet
0/350 · 35
26
../../principles/transport.rst:60
English
Application-layer protocols exchange two types of messages. Some protocols such as those used to support electronic mail exchange messages expressed as strings or lines of characters. As the transport layer allows hosts to exchange bytes, they need to agree on a common representation of the characters. The first and simplest method to encode characters is to use the :term:`ASCII` table. :rfc:`20` provides the ASCII table that is used by many protocols on the Internet. For example, the table defines the following binary representations :
0/5420 · 542
27
../../bibliography.rst:93
English
ISO, `Intermediate System to Intermediate System intra-domain routeing information exchange protocol for use in conjunction with the protocol for providing the connectionless-mode network service (ISO 8473) <http://standards.iso.org/ittf/PubliclyAvailableStandards/c030932_ISO_IEC_10589_2002(E).zip>`_ , 2002
0/3080 · 308
27
../../glossary.rst:131
English
Classless Inter Domain Routing is the current address allocation architecture for IP version 4. It was defined in :rfc:`1518` and :rfc:`4632`.
0/1420 · 142