2. cnp3-ebook
3. English
4. Zen

60 ../../protocols/ipv6.rst:201
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To understand the `longest prefix match` forwarding, consider the IPv6 routing below. 85/10000 · 85
60 ../../protocols/ethernet.rst:179
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Optical fiber but also Category 6 UTP 37/10000 · 37
60 ../../protocols/tcp.rst:205
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The advantage of the `SYN cookies`_ is that by using them, the server does not need to create a :term:`TCB` upon reception of the `SYN` segment and can still check the returned `ACK` segment by recomputing the `SYN cookie`. The main disadvantage is that they are not fully compatible with the TCP options. This is why they are not enabled by default on a typical system. 370/10000 · 370
60 ../../protocols/tls.rst:322
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As other security protocols, TLS uses different keys to encrypt and authenticate records. These keys are derived from the MasterSecret that is either randomly generated by the client after the ``RSA`` key exchange or derived from the Diffie Hellman parameters after the ``DH_RSA`` key exchange. The exact algorithm used to derive the keys is defined in :rfc:`5246`. 365/10000 · 365
60 ../../principles/network.rst:353
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A drawback of the `flat addressing scheme` is that the forwarding tables linearly grow with the number of hosts and routers in the network. With this addressing scheme, each forwarding table must contain an entry that points to every address reachable inside the network. Since large networks can contain tens of millions of hosts or more, this is a major problem on routers that need to be able to quickly forward packets. As an illustration, it is interesting to consider the case of an interface running at 10 Gbps. Such interfaces are found on high-end servers and in various routers today. Assuming a packet size of 1000 bits, a pretty large and conservative number, such interface must forward ten million packets every second. This implies that a router that receives packets over such a link must forward one 1000 bits packet every 100 nanoseconds. This is the same order of magnitude as the memory access times of old DRAMs. 933/10000 · 933
60 ../../bibliography.rst:81
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Genilloud, G., `X.400 MHS: first steps towards an EDI communication standard <http://doi.acm.org/10.1145/378570.378712>`_. SIGCOMM Computer Communication Review 20, 2 (Apr. 1990), 72-86. 186/10000 · 186
61 ../../exercises/network.rst:375
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 3 via B 7/10000 · 7
61 ../../glossary.rst:167
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An iBGP session is a BGP between two routers belonging to the same Autonomous System. Also called an internal BGP session. 122/10000 · 122
61 ../../principles/reliability.rst:234
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 0111111001111101001111110 25/10000 · 25
61 ../../principles/sharing.rst:382
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We first discuss a simple deterministic MAC algorithm and then we describe several important optimistic algorithms, before coming back to a distributed and deterministic MAC algorithm. 184/10000 · 184
61 ../../principles/transport.rst:239
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `connectionless network layer service` may delay, reorder or even duplicate SDUs 84/10000 · 84
61 ../../principles/security.rst:705
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the above example, Alice sends her public key, (:math:`Alice_{pub}`), in her first message together with her identity. Mallory intercepts the message and replaces Alice's key with his own key, (:math:`Mallory_{pub}`). Bob replies with a nonce, `R`. Alice then signs the random nonce to prove that she knows :math:`Alice_{priv}`. Mallory discards the information and instead computes :math:`E_p(Mallory_{priv},R)`. Bob now thinks that he is discussing with Alice while Mallory sits in the middle. 498/10000 · 498
61 ../../exercises/ipv6.rst:592
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Then, you need to extend the build method that creates routers and hosts. 73/10000 · 73
61 ../../exercises/routing-protocols.rst:854
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We also add a ``post_build`` method to launch tcpdump_ and capture the BGP packets exchanged by the routers. A BGP session runs over a TCP connection. Let us examine a few of the BGP messages exchanged on the BGP session between ``AS1`` and ``AS2``. The traces collected on the three routers are available from :download:`/exercises/traces/bgp-as1-trace.pcap`, :download:`/exercises/traces/bgp-as2-trace.pcap` and :download:`/exercises/traces/bgp-as2-trace.pcap`. 463/10000 · 463
61 ../../exercises/tcp-2.rst:832
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Redraw the same figure assuming that the second segment that was delivered by the sender in the figure experienced congestion. In a network that uses Explicit Congestion Notification, this segment would be marked by routers and the receiver would return the congestion mark in the corresponding acknowledgment. 310/10000 · 310
61 ../../protocols/bgp.rst:263
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If the import filter accepts the BGP message, the pseudo-code distinguishes two cases. If this is an `Update message` for prefix `p`, this can be a new route for this prefix or a modification of the route's attributes. The router first retrieves from its `RIB` the best route towards prefix `p`. Then, the new route is inserted in the `RIB` and the `BGP decision process` is run to find whether the best route towards destination `p` changes. A BGP message only needs to be sent to the router's peers if the best route has changed. For each peer, the router applies the `export filter` to verify whether the route can be advertised. If yes, the filtered BGP message is sent. Otherwise, a `Withdraw message` is sent. When the router receives a `Withdraw message`, it also verifies whether the removal of the route from its `RIB` caused its best route towards this prefix to change. It should be noted that, depending on the content of the `RIB` and the `export filters`, a BGP router may need to send a `Withdraw message` to a peer after having received an `Update message` from another peer and conversely. 1107/10000 · 1107
61 ../../protocols/email.rst:234
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 18 2/10000 · 2
61 ../../protocols/ethernet.rst:287
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Security issues with Ethernet hubs and switches 47/10000 · 47
61 ../../protocols/http.rst:216
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — HTTP was initially designed to share text documents. For this reason, and to ease the implementation of clients and servers, the designers of HTTP chose to open a TCP connection for each HTTP request. This implies that a client must open one TCP connection for each URI that it wants to retrieve from a server as illustrated on the figure below, showing HTTP 1.0 and the underlying TCP connection. For a web page containing only text documents this was a reasonable design choice as the client usually remains idle while the (human) user is reading the retrieved document. 572/10000 · 572
61 ../../protocols/ipv6.rst:214
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — With the longest match rule, the route ``::/0`` plays a particular role. As this route has a prefix length of `0` bits, it matches all destination addresses. This route is often called the `default` route. 205/10000 · 205