Exit Zen
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
../../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
53
../../principles/security.rst:545
English
To authenticate herself, Alice sends her user identifier to Bob. Bob replies with a random number as a challenge to verify that Alice knows the shared secret (i.e. her password). Alice replies with the result of the computation of a hash function (e.g. SHA-1) over a string that is the concatenation between the random number chosen by Bob and Alice's password. The random number chosen by Bob is often called a `nonce` since this is a number that should only be used once. Bob performs the same computation locally and can check the message returned by Alice. This type of authentication scheme has been used in various protocols. It prevents replay attacks. If Eve captures the messages exchanged by Alice and Bob, she cannot recover Alice's password from the messages exchanged since hash functions are non-invertible. Furthermore, she cannot replay the hashed value since Bob will always send a different nonce.
0/9150 · 915
53
../../exercises/ipv6.rst:486
English
When a network is designed, an important element of the design is the IP address allocation plan. A good allocation plan can provide flexibility and help to reduce the size of the forwarding tables.
0/1980 · 198
53
../../exercises/routing-protocols.rst:663
English
A useful command to start is `show bgp summary` which provides a summary of the state of the BGP daemon.
0/1040 · 104
53
../../exercises/tcp-2.rst:684
English
Can you explain why the sender only sends one segment first and then two successive segments (the delay between the two segments on the figure is due to graphical reasons) ?
0/1730 · 173
53
../../protocols/bgp.rst:163
English
the `Forwarding Information Base` (`FIB`) is used by the dataplane to forward packets towards their destination. The `FIB` contains, for each destination, the best route that has been selected by the `BGP decision process`. This decision process is an algorithm that selects, for each destination prefix, the best route according to the router's ranking algorithm that is part of its policy.
0/3910 · 391
53
../../protocols/congestion.rst:235
English
Footnotes
0/100 · 9
53
../../protocols/email.rst:232
English
17
0/100 · 2
53
../../protocols/ethernet.rst:201
English
These network interfaces compute the TCP checksum while a segment is transferred from the host memory to the network interface [SH2004]_.
0/1370 · 137
53
../../protocols/http.rst:185
English
The status line of the HTTP response begins with the version of HTTP used by the server (usually `HTTP/1.0` defined in :rfc:`1945` or `HTTP/1.1` defined in :rfc:`2616`) followed by a three digit status code and additional information in English. HTTP status codes have a similar structure as the reply codes used by SMTP:
0/3210 · 321
53
../../protocols/ipv6.rst:179
English
``/48`` for a single company
0/280 · 28
53
../../protocols/ethernet.rst:176
English
100Base-FX
0/100 · 10
53
../../protocols/routing.rst:164
English
In this formula, `N` is the number of outgoing interfaces on the equal cost paths towards the packet's destination. Various hash functions are possible, including CRC, checksum or MD5 :rfc:`2991`. Since the hash function is computed over the four-tuple, the same hash value will be computed for all packets belonging to the same flow. This prevents reordering due to load balancing inside the network. Most routers support this kind of load-balancing today [ACO+2006]_.
0/4700 · 470
53
../../protocols/tcp.rst:185
English
Simultaneous establishment of a TCP connection
0/460 · 46
53
../../protocols/tls.rst:279
English
All the information required for the key exchange has now been transmitted. There are two important messages that will be sent by the client and the server to conclude the handshake and start the data transfer phase.
0/2160 · 216
53
../../protocols/wifi.rst:152
English
IP over IEEE 802.11
0/190 · 19
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