2. cnp3-ebook
3. English
4. Zen

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
60 ../../protocols/email.rst:234
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — B 1/10000 · 1
60 ../../protocols/ethernet.rst:263
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The pseudo-code below details how an Ethernet switch forwards Ethernet frames. It first updates its `MAC address table` with the source address of the frame. The `MAC address table` used by some switches also contains a timestamp that is updated each time a frame is received from each known source address. This timestamp is used to remove from the `MAC address table` entries that have not been active during the last `n` minutes. This limits the growth of the `MAC address table`, but also allows hosts to move from one port to another. The switch uses its `MAC address table` to forward the received unicast frame. If there is an entry for the frame's destination address in the `MAC address table`, the frame is forwarded selectively on the port listed in this entry. Otherwise, the switch does not know how to reach the destination address and it must forward the frame on all its ports except the port from which the frame has been received. This ensures that the frame will reach its destination, at the expense of some unnecessary transmissions. These unnecessary transmissions will only last until the destination has sent its first frame. Multicast and Broadcast frames are also forwarded in a similar way. 1217/10000 · 1217
60 ../../protocols/http.rst:203
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The HTTP response indicates the version of the server software used with the modules included. The `Last-Modified:` header indicates that the requested document was modified about one week before the request. A HTML document (not shown) is attached to the response. Note the blank line between the header of the HTTP response and the attached MIME document. The `Server:` header line has been truncated in this output. 418/10000 · 418
60 ../../protocols/ipv6.rst:201
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To understand the `longest prefix match` forwarding, consider the IPv6 routing below. 85/10000 · 85