2. cnp3-ebook
3. English
4. Zen

5 ../../exercises/reliability.rst:17
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — How would you set the duration of the retransmission timer in the alternating bit protocol ? 92/10000 · 92
5 ../../glossary.rst:182
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Additive Increase, Multiplicative Decrease. A rate adaption algorithm used notably by TCP where a host additively increases its transmission rate when the network is not congested and multiplicatively decreases when congested is detected. 238/10000 · 238
5 ../../principles/referencemodels.rst:21
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Our reference model is divided into five layers, as shown in the figure below. 78/10000 · 78
5 ../../principles/reliability.rst:33
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `electrical cable`. Information can be transmitted over different types of electrical cables. The most common ones are the twisted pairs (that are used in the telephone network, but also in enterprise networks) and the coaxial cables (that are still used in cable TV networks, but are no longer used in enterprise networks). Some networking technologies operate over the classical electrical cable. 398/10000 · 398
5 ../../principles/security.rst:48
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Alice and Bob are the first names that are used in examples for security techniques. They first appeared in a seminal paper by Diffie and Hellman [DH1976]_. Since then, Alice and Bob are the most frequently used names to represent the users who interact with a network. Other characters such as Eve or Mallory have been added over the years. We will explain their respective roles later. 387/10000 · 387
5 ../../exercises/dns.rst:25
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Several software tools can be used to send queries to DNS servers. For this exercise, we use dig_ which is installed on most Unix/Linux systems. 144/10000 · 144
5 ../../exercises/email.rst:11
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — it is possible to test a server manually by using telnet 56/10000 · 56
5 ../../exercises/http.rst:21
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — What is the version of HTTP used by your version of curl_ ? 59/10000 · 59
5 ../../exercises/ipv6.rst:20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Now that you master the basics, you can determine the paths followed by IPv6 packets in simple networks. 104/10000 · 104
5 ../../exercises/lan.rst:28
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consider the switched network shown in Fig. 1. In this network, assume that the LAN between switches S3 and S12 fails. How should the switches update their port/address tables after the link failure ? 200/10000 · 200
5 ../../exercises/routing-policies.rst:58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — from `AS1` to `AS4` 19/10000 · 19
5 ../../exercises/routing-protocols.rst:80
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The code is very simple as by default IPMininet_ enables OSPF on routers. We introduce two specific parameters. First, the interface that connects a router to a host is flagged as a passive interface (``igp_passive=True``). This indicates to the router that there are no other routers attached to this interface and that it should not send or accept OSPF Hello messages on this interface. The second configuration parameter is that we set the IGP cost on each link. 465/10000 · 465
5 ../../exercises/tcp-2.rst:18
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — packetdrill_ is a TCP test suite that was designed to develop unit tests to verify the correct operation of a TCP implementation. A more detailed description of packetdrill_ may be found in [CCB+2013]_. packetdrill_ uses a syntax which is a mix between the C language and the tcpdump_ syntax. To understand the operation of packetdrill_, we first discuss several examples. The TCP implementation in the Linux kernel supports all the recent TCP extensions to improve its performance. For pedagogical reasons, we disable [#fsysctl]_ most of these extensions to use a simple TCP stack. packetdrill_ can be easily installed on recent Linux kernels [#finstall]_. 657/10000 · 657
5 ../../exercises/tcp.rst:43
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — TCP can be extended by using options that are negotiated during the three-way handshake. 88/10000 · 88
5 ../../exercises/tls.rst:41
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Footnotes 9/10000 · 9
5 ../../exercises/trace.rst:15
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As an illustration, let us use tcpdump_ to analyze the packets exchanged while executing the following command on a Linux host: 127/10000 · 127
5 ../../protocols/bgp.rst:19
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The stub domains can be further classified by considering whether they mainly send or receive packets. An `access-rich` stub domain is a domain that contains hosts that mainly receive packets. Typical examples include small ADSL- or cable modem-based Internet Service Providers or enterprise networks. On the other hand, a `content-rich` stub domain is a domain that mainly produces packets. Examples of `content-rich` stub domains include google_, yahoo_, microsoft_, facebook_ or content distribution networks such as akamai_ or limelight_. For the last few years, we have seen a rapid growth of these `content-rich` stub domains. Recent measurements [ATLAS2009]_ indicate that a growing fraction of all the packets exchanged on the Internet are produced in the data centers managed by these content providers. 812/10000 · 812
5 ../../protocols/congestion.rst:19
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a TCP connection begins, the sending host does not know whether the part of the network that it uses to reach the destination is congested or not. To avoid causing too much congestion, it must start with a small congestion window. [Jacobson1988]_ recommends an initial window of MSS bytes. As the additive increase part of the TCP congestion control scheme increments the congestion window by MSS bytes every round-trip-time, the TCP connection may have to wait many round-trip-times before being able to efficiently use the available bandwidth. This is especially important in environments where the :math:`bandwidth \times rtt` product is high. To avoid waiting too many round-trip-times before reaching a congestion window that is large enough to efficiently utilize the network, the TCP congestion control scheme includes the `slow-start` algorithm. The objective of the TCP `slow-start` phase is to quickly reach an acceptable value for the `cwnd`. During `slow-start`, the congestion window is doubled every round-trip-time. The `slow-start` algorithm uses an additional variable in the TCB : `ssthresh` (`slow-start threshold`). The `ssthresh` is an estimation of the last value of the `cwnd` that did not cause congestion. It is initialized at the sending window and is updated after each congestion event. 1319/10000 · 1319
5 ../../protocols/dnssec.rst:41
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If Mallory cannot control a router on the path between Alice and her resolver, she could still launch a different attack. To understand this attack, it is important to correctly understand how the DNS protocol operates and the roles of the different fields of the DNS header which is reproduced in the figure below. 315/10000 · 315
5 ../../protocols/email.rst:49
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a message format, that defines how valid email messages are encoded 67/10000 · 67