2. cnp3-ebook
3. English
4. Zen

59 ../../protocols/email.rst:234 • ../../protocols/email.rst:236
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1 1/10000 · 1
59 ../../protocols/ethernet.rst:261
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — One of the selling points of Ethernet networks is that, thanks to the utilization of 48 bits MAC addresses, an Ethernet LAN is plug and play at the datalink layer. When two hosts are attached to the same Ethernet segment or hub, they can immediately exchange Ethernet frames without requiring any configuration. It is important to retain this plug and play capability for Ethernet switches as well. This implies that Ethernet switches must be able to build their MAC address table automatically without requiring any manual configuration. This automatic configuration is performed by the `MAC address learning` algorithm that runs on each Ethernet switch. This algorithm extracts the source address of the received frames and remembers the port over which a frame from each source Ethernet address has been received. This information is inserted into the MAC address table that the switch uses to forward frames. This allows the switch to automatically learn the ports that it can use to reach each destination address, provided that this host has previously sent at least one frame. This is not a problem since most upper layer protocols use acknowledgments at some layer and thus even an Ethernet printer sends Ethernet frames as well. 1237/10000 · 1237
59 ../../protocols/http.rst:194
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As an illustration of HTTP/1.0, the transcript below shows a HTTP request for `http://www.ietf.org <http://www.ietf.org>`_ and the corresponding HTTP response. The HTTP request was sent using the curl_ command line tool. The `User-Agent:` header line contains more information about this client software. There is no MIME document attached to this HTTP request, and it ends with a blank line. 392/10000 · 392
59 ../../protocols/ipv6.rst:199
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Now, consider how a router inside ``alpha.com`` would reach a host in the ``UCLouvain`` network. This router has two routes towards ``2001:6a8:3080::1``. The first one, for prefix ``2001:6a8:3080::/48`` is via the direct link between the commercial ISP and UCLouvain. The second one, for prefix ``2001:6a8::/32`` is via the Internet and Belnet. Since :rfc:`1519` when a router knows several routes towards the same destination address, it must forward packets along the route having the longest prefix length. In the case of ``2001:6a8:3080::1``, this is the route ``2001:6a8:3080::/48`` that is used to forward the packet. This forwarding rule is called the `longest prefix match` or the `more specific match`. All IP routers implement this forwarding rule. 758/10000 · 758
59 ../../protocols/ethernet.rst:179 • ../../protocols/ethernet.rst:358
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 10 Gbps 7/10000 · 7
59 ../../protocols/tcp.rst:203
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the low order bits contain a hash value computed over the local and remote IP addresses and ports and a random secret only known to the server 142/10000 · 142
59 ../../protocols/tls.rst:315
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The handshake is now finished. The client and the server will exchange authenticated and encrypted records. TLS defines different formats for the records depending on the cryptographic algorithms that have been negotiated for the session. A detailed discussion of these different types of records is outside the scope of this introduction. For illustration, we briefly describe one record format. 396/10000 · 396
59 ../../principles/network.rst:349
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — With `flat addressing` the lookup operation in the forwarding table can be implemented as an exact match. The `forwarding table` contains the (sorted) list of all known destination addresses. When a packet arrives, a network node only needs to check whether this address is included in the forwarding table or not. In software, this is an `O(log(n))` operation if the list is sorted. In hardware, Content Addressable Memories can efficiently perform this lookup operation, but their size is usually limited. 507/10000 · 507
59 ../../bibliography.rst:80
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Grier, D., Campbell, M., `A social history of Bitnet and Listserv <http://www.computer.org/portal/web/csdl/doi/10.1109/85.841135>`_, 1985-1991, Annals of the History of Computing, IEEE, Volume 22, Issue 2, Apr-Jun 2000, pp. 32 - 41 231/10000 · 231
59 ../../principles/reliability.rst:233
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 011111100111110001111110 24/10000 · 24
60 ../../exercises/network.rst:375
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — D 1/10000 · 1
60 ../../glossary.rst:165
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — iBGP 4/10000 · 4
60 ../../principles/reliability.rst:234
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 01111110 8/10000 · 8
60 ../../principles/sharing.rst:379
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Stochastic` or `optimistic` MAC algorithms. These algorithms assume that collisions are part of the normal operation of a Local Area Network. They aim to minimize the number of collisions, but they do not try to avoid all collisions. Stochastic algorithms are usually easier to implement than deterministic ones. 313/10000 · 313
60 ../../principles/transport.rst:238
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `connectionless network layer service` may corrupt SDUs 59/10000 · 59
60 ../../principles/security.rst:671
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The solution described above works provided that Bob and Alice know their respective public keys before communicating. Otherwise, the protocol is not secure against man-in-the-middle attackers. Consider Mallory sitting in the middle between Alice and Bob and assume that neither Alice nor Bob knows the other's public key. 322/10000 · 322
60 ../../exercises/ipv6.rst:580
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — IPMininet_ simplifies the creation of the network topology by providing a simple API. For this, you simply need to declare a class that extends the ``IPTopo`` class. 165/10000 · 165
60 ../../exercises/routing-protocols.rst:845
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — IPMininet_ also allows to explore the dynamics of BGP by looking at the packets that the routers exchange. For this, we slightly modify the example above and add delays to the interdomain links as follows. 205/10000 · 205
60 ../../exercises/tcp-2.rst:775
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Let us now explore the impact of congestion on the slow-start and congestion avoidance mechanisms. Consider the scenario below. For graphical reasons, it is not possible anymore to show information about the segments on the graph, but you can easily infer them. 261/10000 · 261
60 ../../protocols/bgp.rst:258
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another example of frequently used `import filters` are the filters that Internet Service Providers use to ignore bogon routes. In the ISP community, a bogon route is a route that should not be advertised on the global Internet. Typical examples include the documentation IPv6 prefix (`2001:db8::/32` used for most examples in this book), the loopback address (`::1/128`) or the IPv6 prefixes that have not yet been allocated by IANA. A well managed BGP router should ensure that it never advertises bogons on the global Internet. Detailed information about these bogons may be found in [IMHM2013]_. 599/10000 · 599