2. cnp3-ebook
3. English
4. Zen

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
61 ../../protocols/ethernet.rst:180
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 40-100 Gbps 11/10000 · 11
61 ../../protocols/tcp.rst:None
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Retransmitting the first `SYN` segment 38/10000 · 38
61 ../../protocols/tls.rst:329
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A TLS record is always composed of four different fields : 58/10000 · 58
61 ../../principles/network.rst:355
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A widely used alternative to the `flat addressing scheme` is the `hierarchical addressing scheme`. This addressing scheme builds upon the fact that networks usually contain much more hosts than routers. In this case, a first solution to reduce the size of the forwarding tables is to create a hierarchy of addresses. This is the solution chosen by the post office since postal addresses contain a country, sometimes a state or province, a city, a street and finally a street number. When an envelope is forwarded by a post office in a remote country, it only looks at the destination country, while a post office in the same province will look at the city information. Only the post office responsible for a given city will look at the street name and only the postman will use the street number. `Hierarchical addresses` provide a similar solution for network addresses. For example, the address of an Internet host attached to a campus network could contain in the high-order bits an identification of the Internet Service Provider (ISP) that serves the campus network. Then, a subsequent block of bits identifies the campus network which is one of the customers of the ISP. Finally, the low order bits of the address identify the host in the campus network. 1260/10000 · 1260
61 ../../bibliography.rst:82
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Greenwald, `No Place to Hide: Edward Snowden, the NSA, and the U.S. Surveillance State <https://books.google.be/books?isbn=1627790748>`_, Metropolitan books, 2014 162/10000 · 162
62 ../../exercises/network.rst:375 • ../../exercises/network.rst:375
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1 via D 7/10000 · 7
62 ../../glossary.rst:229
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ICANN 5/10000 · 5
62 ../../principles/network.rst:357
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This hierarchical allocation of addresses can be applied in any type of network. In practice, the allocation of the addresses must follow the network topology. Usually, this is achieved by dividing the addressing space in consecutive blocks and then allocating these blocks to different parts of the network. In a small network, the simplest solution is to allocate one block of addresses to each network node and assign the host addresses from the attached node. 463/10000 · 463
62 ../../principles/reliability.rst:238
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — For example, consider the transmission of `0110111111111111111110010`. The sender will first send the `01111110` marker followed by `011011111`. After these five consecutive bits set to `1`, it inserts a bit set to `0` followed by `11111`. A new `0` is inserted, followed by `11111`. A new `0` is inserted followed by the end of the frame `110010` and the `01111110` marker. 374/10000 · 374
62 ../../principles/sharing.rst:386
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Static allocation methods 25/10000 · 25
62 ../../principles/security.rst:714
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — There are situations where symmetric authentication is required. In this case, each user must perform some computation with his/her private key. A possible exchange is the following. Alice sends her certificate to Bob. Bob replies with a nonce, :math:`R1`, and provides his certificate. Alice encrypts :math:`R1` with her private key and generates a nonce, :math:`R2`. Bob verifies Alice's computation and encrypts :math:`R2` with his private key. Alice verifies the computation and both have been authenticated. 512/10000 · 512
62 ../../exercises/ipv6.rst:607
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Although IPMininet_ can assign prefixes and addresses automatically, we use manually assigned addresses in this example. 120/10000 · 120
62 ../../exercises/routing-protocols.rst:856
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The BGP session starts with a TCP three-way handshake. Once the session has been established, both BGP daemons send an ``OPEN`` message describing their capabilities and the BGP extensions that it supports. The details of these extensions go beyond the scope of this book. However, it is important to note that the ``OPEN`` message contains the ``AS`` number of the router that sends the message and its identifier as a 32 bits IPv4 address. This router identifier uniquely identifies the router. The last mandatory parameter of the ``OPEN`` message is the `Hold Time`, i.e. the maximum delay between two successive messages over this BGP session. A BGP router should send ``KEEPALIVE`` messages every one third of the `Hold Time` to keep the session up. 754/10000 · 754
62 ../../exercises/tcp-2.rst:834
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Same question, but assume now that the fourth segment delivered by the sender experienced congestion (but was not discarded). 125/10000 · 125
62 ../../protocols/bgp.rst:265
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Let us now discuss in more detail the operation of BGP in an IPv6 network. For this, let us consider the simple network composed of three routers located in three different ASes and shown in the figure below. 208/10000 · 208