Exit Zen
43
../../bibliography.rst:133
English
Mills, D.L., `Computer Network Time Synchronization: the Network Time Protocol <http://books.google.com/books?id=pdTcJBfnbq8C>`_. CRC Press, March 2006, 304 pp.
0/1600 · 160
43
../../glossary.rst:321
English
A service that enables a user to send or receive a file from a distant server over the network. The File Transfer Protocol :term:`FTP` was a popular service. It has now been replaced by HTTP/HTTPs or more secure protocols such as the `SSH File Transfer Protocol <https://en.wikipedia.org/wiki/SSH_File_Transfer_Protocol>`_.
0/3230 · 323
43
../../principles/network.rst:151
English
In a tree-shaped network, it is relatively simple for each node to automatically compute its forwarding table by inspecting the packets that it receives. For this, each node uses the source and destination addresses present inside each packet. Thanks to the source address, a node can learn the location of the different sources inside the network. Each source has a unique address. When a node receives a packet over a given interface, it learns that the source (address) of this packet is reachable via this interface. The node maintains a data structure that maps each known source address to an incoming interface. This data structure is often called the `port-address table` since it indicates the interface (or port) to reach a given address.
0/7480 · 748
43
../../principles/transport.rst:91
English
The first possibility was named `big-endian` in a note written by Cohen [Cohen1980]_ while the second was named `little-endian`. Vendors of CPUs that used `big-endian` in memory insisted on using `big-endian` encoding in networked applications while vendors of CPUs that used `little-endian` recommended the opposite. Several studies were written on the relative merits of each type of encoding, but the discussion became almost a religious issue [Cohen1980]_. Eventually, the Internet chose the `big-endian` encoding, i.e. multi-byte fields are always transmitted by sending the most significant byte first, :rfc:`791` refers to this encoding as the :term:`network-byte order`. Most libraries [#fhtonl]_ used to write networked applications contain functions to convert multi-byte fields from memory to the network byte order and the reverse.
0/8440 · 844
43
../../principles/sharing.rst:185
English
By combining different answers to these questions, network researchers have developed different packet discard mechanisms.
0/1220 · 122
43
../../principles/security.rst:433
English
To efficiently sign messages, Alice needs to be able to compute a summary of her message in a way that makes prohibits an attacker from generating a different message that has the same summary. `Cryptographic hash functions` were designed to solve this problem. The ideal hash function is a function that returns a different number for every possible input. In practice, it is impossible to find such a function. Cryptographic hash functions are an approximation of this perfect summarization function. They compute a summary of a given message in 128, 160, 256 bits or more. They also exhibit the `avalanche effect`. This effect indicates that a small change in the message causes a large change in the hash value. Finally hash functions are very difficult to invert. Knowing a hash value, it is computationally very difficult to find the corresponding input message. Several hash functions have been proposed by cryptographers. The most popular ones are :
0/9570 · 957
43
../../exercises/ipv6.rst:471
English
In this network, we will focus on four IPv6 prefixes :
0/540 · 54
43
../../exercises/routing-protocols.rst:518
English
If you launch the script and immediately type ``ping6all`` to check the connectivity, you might obtained the following result.
0/1260 · 126
43
../../exercises/tcp-2.rst:637
English
Open questions
0/140 · 14
43
../../protocols/bgp.rst:132
English
a list of IP prefixes that are (re-)advertised
0/460 · 46
43
../../protocols/congestion.rst:212
English
TCP connections that use a large MSS can achieve a higher throughput that the TCP connections that use a shorter MSS. This creates another source of unfairness between TCP connections. However, it should be noted that today most hosts are using almost the same MSS, roughly 1460 bytes.
0/2850 · 285
43
../../protocols/email.rst:215
English
`video`. The message part contains a video clip. The subtype indicates the format of the video clip like `avi <http://en.wikipedia.org/wiki/Audio_Video_Interleave>`_ or `mp4 <http://en.wikipedia.org/wiki/Mp4>`_.
0/2110 · 211
43
../../protocols/ethernet.rst:178
English
Two multi-mode or single mode optical fibers with lasers
0/560 · 56
43
../../protocols/http.rst:165
English
the `Date:` header indicates when the HTTP response has been produced by the server.
0/840 · 84
43
../../protocols/ipv6.rst:157
English
An `interface identifier` that identifies a particular interface on a host
0/740 · 74
43
../../protocols/ethernet.rst:171
English
10Base5
0/100 · 7
43
../../protocols/routing.rst:141
English
Network operators expect an OSPF network to be able to quickly recover from link or router failures [VPD2004]_. In an OSPF network, the recovery after a failure is performed in three steps [FFEB2005]_ :
0/2020 · 202
43
../../protocols/tcp.rst:135
English
Establishment of a TCP connection
0/330 · 33
43
../../protocols/tls.rst:192
English
the ``ServerHello`` message that contains the protocol version chosen by the server (assumed to be the same as the client version in this chapter), the 32 random bytes chosen by the server, the `Cipher Suite` selected by the server from the list advertised by the client and a `Session Id`. This `Session Id` is an identifier which is chosen by the server. It identifies the TLS session and the security parameters (algorithms and keys) negotiated for this session. It is used to support session resumption.
0/5070 · 507
43
../../protocols/wifi.rst:109
English
802.11 control frames are simpler than data frames. They contain a `Frame Control`, a `Duration` field and one or two addresses. The acknowledgment frames are very small. They only contain the address of the destination of the acknowledgment. There is no source address and no `Sequence Control` field in the acknowledgment frames. This is because the acknowledgment frame can easily be associated to the previous frame that it acknowledges. Indeed, each unicast data frame contains a `Duration` field that is used to reserve the transmission channel to ensure that no collision will affect the acknowledgment frame. The `Sequence Control` field is mainly used by the receiver to remove duplicate frames. Duplicate frames are detected as follows. Each data frame contains a 12 bits sequence number in the `Sequence Control` field and the `Frame Control` field contains the `Retry` bit flag that is set when a frame is transmitted. Each 802.11 receiver stores the most recent sequence number received from each source address in frames whose `Retry` bit is reset. Upon reception of a frame with the `Retry` bit set, the receiver verifies its sequence number to determine whether it is a duplicated frame or not.
0/12110 · 1211