2. cnp3-ebook
3. English
4. Zen

41 ../../glossary.rst:307
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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>`_. 323/10000 · 323
41 ../../principles/referencemodels.rst:239
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `Application layer` that contains the mechanisms that do not fit in neither the Presentation nor the Session layer. The OSI Application layer was itself further divided in several generic service elements. 209/10000 · 209
41 ../../principles/network.rst:238
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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. 748/10000 · 748
41 ../../principles/reliability.rst:197
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The datalink layer 18/10000 · 18
41 ../../principles/transport.rst:104
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — send the least significant byte followed by the most significant byte 69/10000 · 69
41 ../../principles/security.rst:401
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another interesting property of public key cryptography is its ability to compute `signatures` that can be used to authenticate a message. This capability comes from the utilization of two different keys that are linked together. If Alice wants to sign a message `M`, she can compute :math:`SM=E_p(A_{priv},M)`. Anyone who receives this signed messaged can extract its content as :math:`D_p(A_{pub},SM)=D_p(A_{pub},E_p(A_{priv},M))=M`. Everyone can use :math:`A_{pub}` to check that the message was signed by using Alice's private key (:math:`A_{priv}`). Since this key is only known by Alice, the ability to decrypt `SM` is a proof that the message was signed by Alice herself. 678/10000 · 678
41 ../../exercises/ipv6.rst:433
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — What do you think about the proposed configuration? 51/10000 · 51
41 ../../exercises/routing-protocols.rst:510
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The script ends by launching the full topology. The entire script is available from :download:`/exercises/ipmininet_scripts/ebgp-simple.py`. 140/10000 · 140
41 ../../exercises/tcp-2.rst:546
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another interesting scenario is when the loss happens early in the data transfer. This is shown in the script below where the second segment is lost. We observe that by triggering transmissions of unacknowledged data, the :rfc:`3042` rule speeds up the recovery since a fast retransmit happens. This script is available from :download:`/exercises/packetdrill_scripts/slow-start-frr2.pkt`. 388/10000 · 388
41 ../../protocols/bgp.rst:129
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As explained earlier, BGP relies on incremental updates. This implies that when a BGP session starts, each router first sends BGP `UPDATE` messages to advertise to the other peer all the exportable routes that it knows. Once all these routes have been advertised, the BGP router only sends BGP `UPDATE` messages about a prefix if the route is new, one of its attributes has changed or the route became unreachable and must be withdrawn. The BGP `UPDATE` message allows BGP routers to efficiently exchange such information while minimizing the number of bytes exchanged. Each `UPDATE` message contains : 602/10000 · 602
41 ../../protocols/congestion.rst:209
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — More detailed models and the analysis of simulations have shown that a first order model of the TCP throughput when losses occur was :math:`Throughput \approx \frac{k \times MSS}{rtt \times \sqrt{p}}`. This is an important result which shows that : 248/10000 · 248
41 ../../protocols/email.rst:213
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `image`. The message part contains a binary representation of an image. The subtype indicates the format of the image such as `gif <http://en.wikipedia.org/wiki/Graphics_Interchange_Format>`_, `jpg <http://en.wikipedia.org/wiki/Jpeg>`_ or `png <http://en.wikipedia.org/wiki/Portable_Network_Graphics>`_. 303/10000 · 303
41 ../../protocols/ethernet.rst:177
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Two pairs shielded twisted pair, 25m maximum 44/10000 · 44
41 ../../protocols/http.rst:162
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :rfc:`1945` and :rfc:`2616` define headers that are specific to HTTP responses. These server headers include: 109/10000 · 109
41 ../../protocols/ipv6.rst:155
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A `global routing prefix` that is assigned to the Internet Service Provider that owns this block of addresses 109/10000 · 109
41 ../../protocols/ethernet.rst:169 • ../../protocols/wifi.rst:19
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Standard 8/10000 · 8
41 ../../protocols/routing.rst:135
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To better represent LANs and reduce the number of OSPF packets that are exchanged, OSPF handles LAN differently. When OSPF routers boot on a LAN, they elect [#felection]_ one of them as the `Designated Router (DR)` :rfc:`2328`. The `DR` router `represents` the local area network, and advertises the LAN's subnet. Furthermore, LAN routers only exchange HELLO packets with the `DR`. Thanks to the utilization of a `DR`, the topology of the LAN appears as a set of point-to-point links connected to the `DR` router. 513/10000 · 513
41 ../../protocols/rpc.rst:151
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Footnotes 9/10000 · 9
41 ../../protocols/ssh.rst:305
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The exact algorithms used for the computation of these keys are defined in :rfc:`4253` 86/10000 · 86
41 ../../protocols/tcp.rst:127
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `acknowledgment number` set to the `sequence number` of the received `SYN+ACK` segment incremented by 1 :math:`\pmod{2^{32}}` 129/10000 · 129