2. cnp3-ebook
3. English
4. Zen

11 ../../exercises/sockets.rst:110
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In order to reach a peer, a process must know its :term:`address`. An address is a value that identifies a peer in a given network. There exists many different kinds of address families. For example, some of them allow reaching a peer using the file system on the computer. Some others enable communicating with a remote peer through a network. The socket API provides generic functions: the peer address is taken as a ``struct sockaddr *``, which can point to any family of address. This is partly why sockets are a powerful abstraction. 538/10000 · 538
11 ../../bibliography.rst:17
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Anderson, B. and McGrew, D., 2019, October. `TLS Beyond the Browser: Combining End Host and Network Data to Understand Application Behavior <https://doi.org/10.1145/3355369.3355601>`_. In Proceedings of the Internet Measurement Conference (pp. 379-392). ACM. 258/10000 · 258
11 ../../principles/reliability.rst:46
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In computer networks, the bit rate of the physical layer is always expressed in bits per second. One Mbps is one million bits per second and one Gbps is one billion bits per second. This is in contrast with memory specifications that are usually expressed in bytes (8 bits), KiloBytes (1024 bytes) or MegaBytes (1048576 bytes). Transferring one MByte through a 1 Mbps link lasts 8.39 seconds. 392/10000 · 392
12 ../../exercises/ex-sharing.rst:231
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — With CSMA, hosts need to listen to the communication channel before starting their transmission. Consider again a 2 kilometers long cable where hosts send frames at 100 Mbps. Show in the figure below the correct transmission of frames with CSMA. 245/10000 · 245
12 ../../index.rst:177
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :ref:`search` 13/10000 · 13
12 ../../exercises/sockets.rst:112
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The ``sendto`` system call allows to send data to a peer identified by its socket address through a given socket. 113/10000 · 113
12 ../../principles/naming.rst:75
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This grammar specifies that a host name is an ordered list of labels separated by the dot (`.`) character. Each label can contain letters, numbers and the hyphen character (`-`) [#fidn]_. Fully qualified domain names are read from left to right. The first label is a hostname or a domain name followed by the hierarchy of domains and ending with the root implicitly at the right. The top-level domain name must be one of the registered TLDs [#ftld]_. For example, in the above figure, `www.computer-networking.info` corresponds to a host named `www` inside the `computer-networking` domain that belongs to the `info` top-level domain. 634/10000 · 634
12 ../../principles/referencemodels.rst:72
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Datalink layer 18/10000 · 18
12 ../../principles/reliability.rst:49
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bits per second 15/10000 · 15
12 ../../bibliography.rst:18
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Androutsellis-Theotokis, S. and Spinellis, D.. .. 2004. `A survey of peer-to-peer content distribution technologies <http://doi.acm.org/10.1145/1041680.1041681>`_. ACM Computing Surveys 36, 4 (December 2004), 335-371. 217/10000 · 217
12 ../../exercises/network.rst:105
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the router located in `New York` 32/10000 · 32
12 ../../exercises/reliability.rst:29
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Each frame contains `D` bytes of data and `c` bytes of control information 74/10000 · 74
12 ../../glossary.rst:48
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ARPANET 7/10000 · 7
12 ../../exercises/transport.rst:94
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consider a transport protocol that provides a reliable connection-oriented bytestream service. You observe the segments sent by a host that uses this protocol. Does the time-sequence diagram below reflects a valid implementation of this protocol ? Justify your answer. 268/10000 · 268
12 ../../principles/sharing.rst:115
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fairness in computer networks 29/10000 · 29
12 ../../principles/transport.rst:48
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Alice : `Thank you` 19/10000 · 19
12 ../../protocols/dns.rst:47
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — DNS Resource Records 20/10000 · 20
12 ../../principles/security.rst:155
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Eavesdropping and pervasive monitoring are not the only possible attacks against a network. Another type of attacker is the active attacker. In the literature, these attacks are often called `Man in the middle` or `MITM` attacks. Such attacks occur when one user, let us call him `Mallory`, has managed to configure the network so that he can both capture and modify the packets exchanged by two users. The simplest scenario is when Mallory controls a router that is on the path used by both Alice and Bob. For example, Alice could be connected to a WiFi access router controlled by Mallory and Bob would be a regular server on the Internet. 641/10000 · 641
12 ../../exercises/dns.rst:41
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — What are the IP addresses of the resolvers that the `dig` implementation you are using relies on [#fdig]_ ? 107/10000 · 107
12 ../../exercises/email.rst:27
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — On Unix hosts, a subset of the port assignments is often placed in `/etc/services`. 83/10000 · 83