Exit Zen
24
../../protocols/rpc.rst:102
English
`jsonrpc`: a string indicating the version of the protocol used. This is important to allow the protocol to evolve in the future.
0/1290 · 129
24
../../protocols/ssh.rst:206
English
a key used by the client (resp. server) to authenticate the data that it sends
0/780 · 78
24
../../protocols/tcp.rst:51
English
when the `ACK` flag is set, it indicates that the `acknowledgment` field contains a valid number. Otherwise, the content of the `acknowledgment` field must be ignored by the receiver
0/1820 · 182
24
../../protocols/tls.rst:51
English
A second approach to initiate a TLS session is to use the standard TCP port number for the application layer protocol and define a special message in this protocol to trigger the start of the TLS session. This is the solution used for SMTP with the ``STARTTLS`` message. This extension to SMTP :rfc:`3207` defines the new STARTTLS command. The client can issue this command to indicate to the server that it wants to start a TLS session as shown in the example below captured during a session on port 25.
0/5040 · 504
24
../../protocols/udp.rst:83
English
Several types of applications rely on UDP. As a rule of thumb, UDP is used for applications where delay must be minimized or losses can be recovered by the application itself. A first class of the UDP-based applications are applications where the client sends a short request and expects a quick and short answer. The :term:`DNS` is an example of a UDP application that is often used in the wide area. However, in local area networks, many distributed systems rely on Remote Procedure Call (:term:`RPC`) that is often used on top of UDP. In Unix environments, the Network File System (:term:`NFS`) is built on top of RPC and runs frequently on top of UDP. A second class of UDP-based applications are the interactive computer games that need to frequently exchange small messages, such as the player's location or their recent actions. Many of these games use UDP to minimize the delay and can recover from losses. A third class of applications are multimedia applications such as interactive Voice over IP or interactive Video over IP. These interactive applications expect a delay shorter than about 200 milliseconds between the sender and the receiver and can recover from losses directly inside the application.
0/12150 · 1215
24
../../protocols/wifi.rst:24 • ../../protocols/wifi.rst:25
English
38/140
0/100 · 6
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.
104/990 · 99
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. :
258/2150 · 215
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.
553/5370 · 537
25
../../principles/reliability.rst:66
English
On the receiver side :
22/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
25
../../principles/security.rst:316
English
Various secret key cryptographic functions have been proposed, implemented and deployed. The most popular ones are :
0/1160 · 116
25
../../exercises/dns.rst:75
English
Imagine an attacker who is able to send forged DNS replies to, for example, associate `www.bigbank.com` to his own IP address. How could he attack a DNS implementation that
0/1720 · 172
25
../../exercises/ipv6.rst:227
English
router ``R1`` uses address ``2001:db8:1341:1::1`` on its West interface, address ``2001:db8:1341:12::1`` on its East interface, address ``2001:db8:1341:14::1`` on its South-East interface and address ``2001:db8:1341:13::1`` on its South interface
0/2460 · 246
25
../../exercises/lan.rst:293
English
:manpage:`brctl(8)` also maintains a MAC address table that contains the Ethernet addresses that have been learned on each switch port.
0/1350 · 135
25
../../exercises/routing-policies.rst:213
English
An ICMPv6 error message includes in its message body the beginning of the IPv6 packet that triggered this error. How many bytes of the original packet must be returned to allow the host to recover the original source and destination addresses and source and destination ports of the packet that caused the error ?
0/3130 · 313