2. cnp3-ebook
3. English
4. Zen

57 ../../protocols/tcp.rst:200
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To avoid the `SYN flood` attacks, recent TCP implementations no longer enter the `SYN Rcvd` state upon reception of a `SYN segment`. Instead, they reply directly with a `SYN+ACK` segment and wait until the reception of a valid `ACK`. This implementation trick is only possible if the TCP implementation is able to verify that the received `ACK` segment acknowledges the `SYN+ACK` segment sent earlier without storing the initial sequence number of this `SYN+ACK` segment in a TCB. The solution to solve this problem, which is known as `SYN cookies <http://cr.yp.to/syncookies.html>`_ is to compute the 32 bits of the `ISN` as follows : 635/10000 · 635
57 ../../protocols/tls.rst:299
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A TLS cipher suite is usually represented as an ASCII string that starts with TLS and contains the acronym of the key exchange algorithm, the encryption scheme with the key size and its mode of operation and the authentication algorithm. For example, ``TLS_DHE_RSA_WITH_AES_128_GCM_SHA256`` is a TLS cipher suite that uses the ``DHE_RSA`` key exchange algorithm with 128 bits AES in GCM mode for encryption and SHA-256 for authentication. The official list of TLS cipher suites is maintained by IANA [#fianaTLS]_. The NULL acronym indicates that no algorithm has been specified. For example, ``TLS_ECDH_RSA_WITH_NULL_SHA`` is a cipher suite that does not use any encryption but still uses the ``ECDH_RSA`` key exchange and ``SHA`` for authentication. 750/10000 · 750
57 ../../protocols/wifi.rst:160
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In fact, the [IEEE802.11]_ frame format contains a fourth optional address field. This fourth address is only used when an 802.11 wireless network is used to interconnect bridges attached to two classical LAN networks. 218/10000 · 218
58 ../../exercises/network.rst:374 • ../../exercises/network.rst:374
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1 via C 7/10000 · 7
58 ../../glossary.rst:129
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — IANA 4/10000 · 4
58 ../../principles/network.rst:347
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first organization, which is the one that we have implicitly assumed until now, is the `flat addressing` scheme. Under this scheme, each host and network node has a unique address. The unicity of the addresses is important for the operation of the network. If two hosts have the same address, it can become difficult for the network to forward packets towards this destination. `Flat addresses` are typically used in situations where network nodes and hosts need to be able to communicate immediately with unique addresses. These `flat addresses` are often embedded inside the network interface cards. The network card manufacturer creates one unique address for each interface and this address is stored in the read-only memory of the interface. An advantage of this addressing scheme is that it easily supports unstructured and mobile networks. When a host moves, it can attach to another network and remain confident that its address is unique and enables it to communicate inside the new network. 1004/10000 · 1004
58 ../../principles/sharing.rst:376
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — All Local Area Network technologies rely on a `Medium Access Control` algorithm to regulate the transmissions to either minimize or avoid collisions. There are two broad families of `Medium Access Control` algorithms : 218/10000 · 218
58 ../../principles/transport.rst:236
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `connectionless network layer service` can only transfer SDUs of *limited size* 83/10000 · 83
58 ../../principles/security.rst:634
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A drawback of this approach is that Bob is forced to perform two public key computations : one encryption to send the random nonce to Alice and one decryption to recover the nonce encrypted by Alice. If these computations are costly from a CPU viewpoint, this creates a risk of Denial of Service Attacks were attackers could try to access Bob's computer and force it to perform such costly computations. Bob is more at risk than Alice in this situation and he should not perform complex operations before being sure that he is talking with Alice. An alternative is shown in the time sequence diagram below. 606/10000 · 606
58 ../../exercises/ipv6.rst:533
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The syntax of IPMininet_ is relatively simple and can be learned by looking at a few examples. 94/10000 · 94
58 ../../exercises/routing-protocols.rst:841
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the eBGP session with ``fe80::c001:dcff:fe49:a512`` with an AS-Path of ``AS2`` (see last column) 96/10000 · 96
58 ../../exercises/tcp-2.rst:738
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assuming that there are no losses and that there is no congestion in the network. If the sender writes `x` bytes on a newly established TCP connection, derive a formula that computes the minimum time required to deliver all these `x` bytes to the receiver. For the derivation of this formula, assume that `x` is a multiple of the maximum segment size and that the receive window and the slow-start threshold are larger than `x`. 428/10000 · 428
58 ../../protocols/bgp.rst:237
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a BGP message is received, the router first applies the peer's `import filter` to verify whether the message is acceptable or not. If the message is not acceptable, the processing stops. The pseudo-code below shows a simple `import filter`. This `import filter` accepts all routes, except those that already contain the local AS in their AS-Path. If such a route was used, it would cause a routing loop. Another example of an `import filter` would be a filter used by an Internet Service Provider on a session with a customer to only accept routes towards the IP prefixes assigned to the customer by the provider. On real routers, `import filters` can be much more complex and some `import filters` modify the attributes of the received BGP `UPDATE` [WMS2004]_ . 767/10000 · 767
58 ../../protocols/email.rst:232
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — z 1/10000 · 1
58 ../../protocols/ethernet.rst:255
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Operation of Ethernet switches 30/10000 · 30
58 ../../protocols/http.rst:192
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In both HTTP requests and responses, the MIME document refers to a representation of the document with the MIME headers indicating the type of document and its size. 165/10000 · 165
58 ../../protocols/ipv6.rst:196
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Belnet network advertises prefix ``2001:6a8::/32`` that includes the prefixes from both UCLouvain and ULg. These two subnetworks can be easily reached from any internet connected host. After a few years, UCLouvain decides to increase the redundancy of its Internet connectivity and buys transit service from ISP1. A direct link between UCLouvain and the commercial ISP appears on the network and UCLouvain expects to receive packets from both Belnet and the commercial ISP. 477/10000 · 477
58 ../../protocols/ethernet.rst:178
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Two multi-mode or single mode optical fibers with lasers 56/10000 · 56
58 ../../protocols/routing.rst:178
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In some networks, there are several dozens of paths towards a given destination. Some routers, due to hardware limitations, cannot install more than 8 or 16 paths in their forwarding table. In this case, a subset of the computed paths is installed in the forwarding table. 272/10000 · 272
58 ../../protocols/tcp.rst:202
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the high order bits contain the low order bits of a counter that is incremented slowly 86/10000 · 86