Exit Zen
33
../../protocols/ethernet.rst:173
English
Two pairs of category 3+ UTP
0/280 · 28
33
../../protocols/http.rst:144
English
Several types of method can be used in HTTP requests. The three most important ones are :
0/890 · 89
33
../../protocols/http2.rst:232
English
As the server can send multiple objects at the same time, there is a risk of overloading the client buffers. To cope with this potential problem, HTTP/2.0 includes its own flow control mechanism. When an HTTP/2.0 session starts, a receiver agrees to receive up to 65,535 bytes over this connection (unless it has indicated a different initial window in its `Settings` frame). This limits the amount of data that a sender can transmit over the HTTP/2.0 session. The receiver can advertise a large receive window by sending a `Window_Update` frame at any time. This flow control mechanism can be applied to the entire connection or to a specific stream. In practice, using a small `HTTP/2.0 window` could severely limit the throughput over an HTTP/2.0 session.
0/7580 · 758
33
../../protocols/ipv6.rst:121
English
``0:0:0:0:0:0:0:1`` is represented as ``::1``
0/450 · 45
33
../../protocols/ethernet.rst:99
English
The first property is a consequence of the utilization of CSMA/CD. The second property is a consequence of the physical organization of the Ethernet network as a shared bus. These two properties are important and all revisions to the Ethernet technology have preserved them.
0/2740 · 274
33
../../protocols/routing.rst:101
English
On the other hand, consider the prefixes `2001:db8:aaaa:0000::/64` and `2001:db8:aaaa:0001::/64` that are inside `area 1`. Router `RA` is the only area border router that is attached to this area. This router can create two different network summary advertisements :
0/2660 · 266
33
../../protocols/rpc.rst:118
English
`error`: if the method called does not exist or its execution causes an error, the `result` element will be replaced by an `error` element which contains the following members :
0/1770 · 177
33
../../protocols/ssh.rst:246
English
Authenticating messages with HMAC
0/330 · 33
33
../../protocols/tcp.rst:111
English
A TCP connection is established by using a three-way handshake. The connection establishment phase uses the `sequence number`, the `acknowledgment number` and the `SYN` flag. When a TCP connection is established, the two communicating hosts negotiate the initial sequence number to be used in both directions of the connection. For this, each TCP entity maintains a 32 bits counter, which is supposed to be incremented by one at least every 4 microseconds and after each connection establishment [#ftcpclock]_. When a client host wants to open a TCP connection with a server host, it creates a TCP segment with :
0/6120 · 612
33
../../protocols/tls.rst:130
English
In a nutshell, the client starts the TLS handshake by proposing a random nonce. The server replies with its random nonce and a certificate that binds its name to a public key. The client generates a MasterSecret that will be used later to derive the session keys and encrypts it with the public key of the server. It also generates a `Finished` message that contains a MAC of all the messages exchanged to allow the server to detect any modification of the messages sent by the client. The server also sends its own `Finished` message. At that point, the client and the server sent encrypted records thanks to the keys derived from the MasterSecret.
0/6490 · 649
33
../../protocols/wifi.rst:35
English
The architecture of WiFi networks is slightly different from the Local Area Networks that we have discussed until now. There are, in practice, two main types of WiFi networks : `independent` or `adhoc` networks and `infrastructure` networks [#fBSS]_. An `independent` or `adhoc` network is composed of a set of devices that communicate with each other. These devices play the same role and the `adhoc` network is usually not connected to the global Internet. `Adhoc` networks are used when for example a few laptops need to exchange information or to connect a computer with a WiFi printer.
0/5910 · 591
34
../../bibliography.rst:107
English
Kleinrock, L., Tobagi, F., `Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and their Throughput-Delay Characteristics <https://dx.doi.org/10.1109/TCOM.1975.1092768>`_, IEEE Transactions on Communications, Vol. COM-23, No. 12, pp. 1400-1416, December 1975.
0/2880 · 288
34
../../glossary.rst:171
English
eBGP
0/100 · 4
34
../../exercises/ex-sharing.rst:630
English
Hosts `A` and `B` use the simple congestion control scheme described in the book and router `R1` uses the DECBIT mechanism to mark packets as soon as its buffers contain one packet. Hosts `A` and `B` need to send five segments and start exactly at the same time. How long does each hosts needs to wait to receive the acknowledgment for its fifth segment ?
0/3550 · 355
34
../../exercises/reliability.rst:74
English
Discussion questions
23/200 · 20
34
../../exercises/network.rst:326
English
Host `A` uses a different flat address on each of its links
71/590 · 59
34
../../exercises/sockets.rst:288
English
An IPv6 address often identifies a computer and not a program running on the computer. In order to identify a specific program running on a specific computer, we use a *port number* in addition to the IPv6 address. A program using an IPv6 socket is this identified using :
311/2720 · 272
34
../../principles/naming.rst:144
English
This specification evolved later to support domain names written by using other character sets than us-ASCII :rfc:`5890`. This extension is important to support languages other than English, but a detailed discussion is outside the scope of this document.
306/2550 · 255
34
../../principles/network.rst:130
English
The simplest `control plane` for a network is to manually compute the forwarding tables of all routers inside the network. This simple control plane is sufficient when the network is (very) small, usually up to a few routers.
0/2250 · 225
34
../../principles/reliability.rst:152
English
the `Physical layer service` may change, e.g. due to electromagnetic interference, the value of a bit being transmitted
160/1190 · 119