2. cnp3-ebook
3. English
4. Zen

35 ../../protocols/wifi.rst:47
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Most WiFi networks are `infrastructure` networks. An `infrastructure` network contains one or more `access points` that are attached to a fixed Local Area Network (usually an Ethernet network) that is connected to other networks such as the Internet. The figure below shows such a network with two access points and four WiFi devices. Each WiFi device is associated to one access point and uses this access point as a relay to exchange frames with the devices that are associated to another access point or reachable through the LAN. 533/10000 · 533
35 ../../principles/security.rst:377
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — an encryption function, :math:`E_{p}`, that takes a key and a message as parameters 83/10000 · 83
35 ../../protocols/congestion.rst:191
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This model considers a hypothetical TCP connection that suffers from equally spaced segment losses. If :math:`p` is the segment loss ratio, then the TCP connection successfully transfers :math:`\frac{1}{p}-1` segments and the next segment is lost. If we ignore the slow-start at the beginning of the connection, TCP in this environment is always in congestion avoidance as there are only isolated losses that can be recovered by using fast retransmit. The evolution of the congestion window is thus as shown in the figure below. Note that the `x-axis` of this figure represents time measured in units of one round-trip-time, which is supposed to be constant in the model, and the `y-axis` represents the size of the congestion window measured in MSS-sized segments. 765/10000 · 765
36 ../../exercises/ex-sharing.rst:639
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In a deployed CSMA/CD network, would it be possible to increase or decrease the duration of the slotTime ? Justify your answer 126/10000 · 126
36 ../../exercises/sockets.rst:289
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The IPv6 address of the computer 32/10000 · 32
36 ../../principles/naming.rst:150
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — It is interesting to note that to prevent any homograph attack, Google Inc. registered the `g00gle.com` domain name but does not apparently use it. 147/10000 · 147
36 ../../principles/network.rst:225
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another interesting point that is worth being discussed is when the forwarding tables are computed. A widely used solution is to compute the entries of the forwarding tables for all destinations on all routers. This ensures that each router has a valid route towards each destination. These entries can be updated when an event occurs and the network topology changes. A drawback of this approach is that the forwarding tables can become large in large networks since each router must always maintain one entry for each destination inside its forwarding table. 560/10000 · 560
36 ../../bibliography.rst:53
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Cohen, D., `On Holy Wars and a Plea for Peace`, IEN 137, April 1980, http://www.ietf.org/rfc/ien/ien137.txt 107/10000 · 107
36 ../../exercises/network.rst:334
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Host `A` uses the same flat address for both links. 51/10000 · 51
36 ../../glossary.rst:156
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — EIGRP 5/10000 · 5
36 ../../exercises/reliability.rst:72
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — one frame 9/10000 · 9
36 ../../principles/referencemodels.rst:228
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Besides this difference in the lower layers, the TCP/IP reference model is very close to the five layers that we use throughout this document. 142/10000 · 142
36 ../../principles/reliability.rst:154
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `Physical layer service` may deliver `fewer` bits to the receiver than the bits sent by the sender 102/10000 · 102
36 ../../principles/transport.rst:91
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Most applications exchange strings that are composed of fixed or variable numbers of characters. A common solution to define the character strings that are acceptable is to define them as a grammar using a Backus-Naur Form (:term:`BNF`) such as the Augmented BNF defined in :rfc:`5234`. A BNF is a set of production rules that generate all valid character strings. For example, consider a networked application that uses two commands, where the user can supply a username and a password. The BNF for this application could be defined as shown in the figure below. 563/10000 · 563
36 ../../exercises/ipv6.rst:350
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — on router ``R2`` 16/10000 · 16
36 ../../exercises/routing-protocols.rst:436
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``AS1`` is assigned ``2001:cafe:1::/48`` 40/10000 · 40
36 ../../exercises/tcp-2.rst:326
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A TCP stack uses both the fast retransmit technique and retransmission timers. A retransmission timer can fire after a fast retransmit when several segments are lost. The example below shows a loss of two consecutive segments. This script is available from :download:`/exercises/packetdrill_scripts/frr-rto.pkt`. 312/10000 · 312
36 ../../protocols/bgp.rst:122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The BGP protocol :rfc:`4271` defines several types of messages that can be exchanged over a BGP session : 105/10000 · 105
36 ../../protocols/congestion.rst:197
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Evolution of the congestion window with regular losses 54/10000 · 54
36 ../../protocols/email.rst:181
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Content-Type: multipart/alternative`. This header line indicates that the MIME message contains several representations of the same information. For example, a `multipart/alternative` message may contain both a plain text and an HTML version of the same text. 260/10000 · 260