2. cnp3-ebook
3. English
4. Zen

51 ../../bibliography.rst:71
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Francois, P., Filsfils, C., Evans, J., and Bonaventure, O., `Achieving sub-second IGP convergence in large IP networks <http://doi.acm.org/10.1145/1070873.1070877>`_. SIGCOMM Computer Communication Review 35, 3 (Jul. 2005), 35-44. 230/10000 · 230
51 ../../exercises/network.rst:372 • ../../exercises/network.rst:376
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 3 via C 7/10000 · 7
51 ../../glossary.rst:301
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The original file containing the list of all Internet hosts. This file has been deprecated, but Unix variants still maintain a local ``/etc/hosts`` containing mappings between names and IP addresses. See http://man7.org/linux/man-pages/man5/hosts.5.html for a description of the format of this file on Linux. 308/10000 · 308
51 ../../principles/reliability.rst:226
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Bit stuffing` reserves the `01111110` bit string as the frame boundary marker and ensures that there will never be six consecutive `1` symbols transmitted by the physical layer inside a frame. With bit stuffing, a frame is sent as follows. First, the sender transmits the marker, i.e. `01111110`. Then, it sends all the bits of the frame and inserts an additional bit set to `0` after each sequence of five consecutive `1` bits. This ensures that the sent frame never contains a sequence of six consecutive bits set to `1`. As a consequence, the marker pattern cannot appear inside the frame sent. The marker is also sent to mark the end of the frame. The receiver performs the opposite to decode a received frame. It first detects the beginning of the frame thanks to the `01111110` marker. Then, it processes the received bits and counts the number of consecutive bits set to `1`. If a `0` follows five consecutive bits set to `1`, this bit is removed since it was inserted by the sender. If a `1` follows five consecutive bits sets to `1`, it indicates a marker if it is followed by a bit set to `0`. The table below illustrates the application of bit stuffing to some frames. 1180/10000 · 1180
51 ../../principles/sharing.rst:348
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In datagram networks, this technique cannot be easily used since the basic assumption of such a network is that a host can send any packet towards any destination at any time. A host does not need to request the authorization of the network to send packets towards a particular destination. 290/10000 · 290
51 ../../principles/transport.rst:160
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The figure below provides a representation of the connectionless service as a `time-sequence diagram`. The user on the left, having address `S`, issues a `Data.request` primitive containing Service Data Unit (SDU) `M` that must be delivered by the service provider to destination `D`. The dashed line between the two primitives indicates that the `Data.indication` primitive that is delivered to the user on the right corresponds to the `Data.request` primitive sent by the user on the left. 491/10000 · 491
51 ../../principles/security.rst:509
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Since the hash function cannot be inverted, an eavesdropper cannot extract Alice's password by simply observing the data exchanged. However, Alice's real password is not the objective of an attacker. The main objective for Mallory is to be authenticated as Alice. If Mallory can capture `Hash(passwd)`, he can simply replay this data, without being able to invert the hash function. This is called a `replay attack`. 416/10000 · 416
51 ../../exercises/ipv6.rst:482
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The packets sent by ``A1`` or ``A2`` towards ``B1`` are always forwarded via ``R2`` while the packets towards ``B2`` are always forwarded via ``R4``. 149/10000 · 149
51 ../../exercises/routing-protocols.rst:619
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The password for the BGP daemon is `zebra`. The `noecho` command indicates that mininet_ does not need to echo the characters that you type. You then enter the Quagga VTY that enables you to type commands. The `help` commands gives you some information about the available commands as well as `?`. 297/10000 · 297
51 ../../exercises/tcp-2.rst:647
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — TCP always acknowledges each received segment 45/10000 · 45
51 ../../protocols/bgp.rst:161
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `Adj-RIB-In` contains the BGP routes that have been received from each BGP peer. The routes in the `Adj-RIB-In` are filtered by the `import filter` before being placed in the `BGP-Loc-RIB`. There is one `import filter` per BGP peer. 236/10000 · 236
51 ../../protocols/congestion.rst:226
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `BBR`, which is being developed by Google researchers and is included in recent Linux kernels [CCG+2016]_. BBR periodically estimates the available bandwidth and the round-trip-times. To adapt to changes in network conditions, BBR regularly tries to send at 1.25 times the current bandwidth. This enables BBR senders to probe the network, but can also cause large amount of losses. Recent scientific articles indicate that BBR is unfair to other congestion control schemes in specific conditions [WMSS2019]_. 508/10000 · 508
51 ../../protocols/email.rst:232 • ../../protocols/email.rst:234
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 0 1/10000 · 1
51 ../../protocols/ethernet.rst:197
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The official list of all assigned Ethernet type values is available from http://standards.ieee.org/regauth/ethertype/eth.txt 124/10000 · 124
51 ../../protocols/http.rst:177
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first version of HTTP did not include the `Host:` header line. This was a severe limitation for web hosting companies. For example consider a web hosting company that wants to serve both `web.example.com` and `www.example.net` on the same physical server. Both web sites contain a `/index.html` document. When a client sends a request for either `http://web.example.com/index.html` or `http://www.example.net/index.html`, the HTTP 1.0 request contains the following line : 476/10000 · 476
51 ../../protocols/ipv6.rst:176
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When considering the allocation of IPv6 addresses, two types of address allocations are often distinguished. The RIRs allocate `provider-independent (PI)` addresses. PI addresses are usually allocated to Internet Service Providers and large companies that are connected to at least two different ISPs [CSP2009]_. Once a PI address block has been allocated to a company, this company can use its address block with the provider of its choice and change its provider at will. Internet Service Providers allocate `provider-aggregatable (PA)` address blocks from their own PI address block to their customers. A company that is connected to only one ISP should only use PA addresses. The drawback of PA addresses is that when a company using a PA address block changes its provider, it needs to change all the addresses that it uses. This can be a nightmare from an operational perspective and many companies are lobbying to obtain `PI` address blocks even if they are small and connected to a single provider. The typical size of the IPv6 address blocks are : 1056/10000 · 1056
51 ../../protocols/ethernet.rst:175
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 100Base-Tx 10/10000 · 10
51 ../../protocols/routing.rst:160
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fortunately, it is possible to perform `per-flow` load balancing without maintaining any state on the router. Most routers today use hash functions for this purpose :rfc:`2991`. When a packet arrives, the router extracts the Next Header information and the four-tuple from the packet and computes : 298/10000 · 298
51 ../../protocols/tcp.rst:177
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A client host starts in the `Init` state. It then sends a `SYN` segment and enters the `SYN Sent` state where it waits for a `SYN+ACK` segment. Then, it replies with an `ACK` segment and enters the `Established` state where data can be exchanged. On the other hand, a server host starts in the `Init` state. When a server process starts to listen to a destination port, the underlying TCP entity creates a TCP control block and a queue to process incoming `SYN` segments. Upon reception of a `SYN` segment, the server's TCP entity replies with a `SYN+ACK` and enters the `SYN RCVD` state. It remains in this state until it receives an `ACK` segment that acknowledges its `SYN+ACK` segment, with this it then enters the `Established` state. 739/10000 · 739
51 ../../protocols/tls.rst:266
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Perfect Forward Secrecy 23/10000 · 23