Exit Zen
22
../../protocols/ipv6.rst:102
English
When the work on IPng started, it was clear that 32 bits was too small to encode an IPng address and all proposals used longer addresses. However, there were many discussions about the most suitable address length. A first approach, proposed by SIPP in :rfc:`1710`, was to use 64 bit addresses. A 64 bits address space was 4 billion times larger than the IPv4 address space and, furthermore, from an implementation perspective, 64 bit CPUs were being considered and 64 bit addresses would naturally fit inside their registers. Another approach was to use an existing address format. This was the TUBA proposal (:rfc:`1347`) that reuses the ISO CLNP 20 bytes addresses. The 20 bytes addresses provided room for growth, but using ISO CLNP was not favored by the IETF partially due to political reasons, despite the fact that mature CLNP implementations were already available. 128 bits appeared to be a reasonable compromise at that time.
0/9360 · 936
22
../../protocols/ethernet.rst:56
English
Impact of the frame length on the maximum channel utilisation [SH1980]_
0/710 · 71
22
../../protocols/routing.rst:73
English
OSPF imposes restrictions on how a network can be divided into areas. An area is a set of routers and links that are grouped together. Usually, the topology of an area is chosen so that a packet sent by one router inside the area can reach any other router in the area without leaving the area [#fvirtual]_ . An OSPF area contains two types of routers :rfc:`2328`:
0/3640 · 364
22
../../protocols/rpc.rst:98
English
Reaching the callee
0/190 · 19
22
../../protocols/ssh.rst:195
English
Thanks to the Diffie Hellman key exchange, the client and the servers share key :math:`K`. A naive implementation would probably directly use this key for all the cryptographic algorithms that have been negotiated for this session. Like most security protocols, ``ssh`` does not directly use key :math:`K`. Instead, it uses the negotiated hash function with different parameters [#fsshkeys]_ to allow the client and the servers to compute six keys from :math:`K` :
0/4640 · 464
22
../../protocols/tcp.rst:49
English
the `FIN` flag is used during connection release
0/480 · 48
22
../../protocols/tls.rst:47
English
21
0/100 · 2
22
../../protocols/transport-service.rst:61
English
`0:0:0:0:0:0:0:0` is represented as `\:\:`
0/420 · 42
22
../../protocols/udp.rst:73
English
a pseudo header :rfc:`2460` containing the source address, the destination address, the packet length encoded as a 32 bits number and a 32 bits bit field containing the three most significant bytes set to 0 and the low order byte set to 17
0/2390 · 239
22
../../protocols/wifi.rst:24
English
4.3 Mbps
0/100 · 8
23
../../bibliography.rst:72
English
Fortz, B. Rexford, J. ,Thorup, M., `Traffic engineering with traditional IP routing protocols <https://dx.doi.org/10.1109/MCOM.2002.1039866>`_, IEEE Communication Magazine, October 2002
0/1850 · 185
23
../../glossary.rst:237
English
A Backus-Naur Form (BNF) is a formal way to describe a language by using syntactic and lexical rules. BNFs are frequently used to define programming languages, but also to define the messages exchanged between networked applications. :rfc:`5234` explains how a BNF must be written to specify an Internet protocol.
0/3130 · 313
23
../../exercises/ex-sharing.rst:558
English
In this network, compute the minimum round-trip-time between `A` (resp. `B`) and `D`. Perform the computation if the hosts send segments containing 1000 bits.
0/1580 · 158
23
../../exercises/reliability.rst:52
English
Reliable protocols depend on error detection algorithms to detect transmission errors. The following questions will reinforce your understanding of these algorithms.
186/1650 · 165
23
../../exercises/network.rst:208 • ../../exercises/network.rst:238
English
The network operator would like to use the following paths :
59/600 · 60
23
../../exercises/transport.rst:148
English
What is piggybacking and what are the benefits of this technique ?
78/660 · 66
23
../../principles/naming.rst:119
English
DNS resolvers have several advantages over letting each Internet host query directly nameservers. Firstly, regular Internet hosts do not need to maintain the up-to-date list of the addresses of the root servers. Secondly, regular Internet hosts do not need to send queries to nameservers all over the Internet. Furthermore, as a DNS resolver serves a large number of hosts, it can cache the received answers. This allows the resolver to quickly return answers for popular DNS queries and reduces the load on all DNS servers [JSBM2002]_.
643/5360 · 536
23
../../principles/referencemodels.rst:99 • ../../principles/referencemodels.rst:109
English
The Application layer
21/210 · 21
23
../../principles/network.rst:91
English
To understand the datagram organization, let us consider the figure below. A network layer address, represented by a letter, has been assigned to each host and router. To send some information to host `J`, host `A` creates a packet containing its own address, the destination address and the information to be exchanged.
334/3200 · 320
23
../../principles/reliability.rst:62
English
set the voltage on the electrical wire at ``+5V`` during one millisecond to transmit a bit set to `1`
108/1010 · 101