2. cnp3-ebook
3. English
4. Zen

145 ../../principles/reliability.rst:497
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a `header` that contains the fields used by the reliable protocol to ensure reliable delivery. The header contains a checksum or Cyclical Redundancy Check (CRC) [Williams1993]_ that is used to detect transmission errors 219/10000 · 219
145 ../../principles/transport.rst:845
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To conclude our description of the basic mechanisms found in transport protocols, we still need to discuss the impact of segments arriving in the wrong order. If two consecutive segments are reordered, the receiver relies on their sequence numbers to reorder them in its receive buffer. Unfortunately, as transport protocols reuse the same sequence number for different segments, if a segment is delayed for a prolonged period of time, it might still be accepted by the receiver. This is illustrated in the figure below where segment `D(1,b)` is delayed. 554/10000 · 554
145 ../../principles/sharing.rst:926
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To avoid `congestion collapse`, the hosts must regulate their transmission rate [#fcredit]_ by using a `congestion control` mechanism. Such a mechanism can be implemented in the transport layer or in the network layer. In TCP/IP networks, it is implemented in the transport layer, but other technologies such as `Asynchronous Transfer Mode (ATM)` or `Frame Relay` include congestion control mechanisms in lower layers. 418/10000 · 418
145 ../../protocols/email.rst:258
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 13 2/10000 · 2
145 ../../protocols/ipv6.rst:490
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the above pseudocode, we maintain a single 32 bits counter that is incremented for each packet that needs to be fragmented. Other implementations to compute the packet identification are possible. :rfc:`2460` only requires that two fragmented packets that are sent within the MSL between the same pair of hosts have different identifications. 345/10000 · 345
145 ../../protocols/wifi.rst:22
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 20/100 6/10000 · 6
145 ../../protocols/tcp.rst:432
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The proposed values for the parameters are :math:`\alpha=\frac{1}{8}` and :math:`\beta=\frac{1}{4}`. This allows a TCP implementation, implemented in the kernel, to perform the `rtt` computation by using shift operations instead of the more costly floating point operations [Jacobson1988]_. The figure below illustrates the computation of the `rto` upon `rtt` changes. 368/10000 · 368
145 ../../bibliography.rst:355
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Varghese, G., `Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices <http://books.google.com/books?id=01QORuRF6fIC>`_, Morgan Kaufmann, 2005 175/10000 · 175
146 ../../glossary.rst:232
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — root nameserver 15/10000 · 15
146 ../../principles/dv.rst:209
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `A` sends its distance vector :math:`[A=0,B=\infty,C=\infty,D=1,E=\infty]`. `D` knows that it cannot reach `B` anymore via `A` 126/10000 · 126
146 ../../principles/reliability.rst:498
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a `payload` that contains the user data 39/10000 · 39
146 ../../principles/transport.rst:852
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Ambiguities caused by excessive delays 38/10000 · 38
146 ../../principles/sharing.rst:930
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Let us first consider the simple problem of a set of :math:`i` hosts that share a single bottleneck link as shown in the example above. In this network, the congestion control scheme must achieve the following objectives [CJ1989]_ : 232/10000 · 232
146 ../../protocols/email.rst:258
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — N 1/10000 · 1
146 ../../protocols/ipv6.rst:492
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The fragments of an IPv6 packet may arrive at the destination in any order, as each fragment is forwarded independently in the network and may follow different paths. Furthermore, some fragments may be lost and never reach the destination. 239/10000 · 239
146 ../../protocols/wifi.rst:23
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 802.11a 7/10000 · 7
146 ../../protocols/tcp.rst:439
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Example computation of the `rto` 32/10000 · 32
146 ../../bibliography.rst:356
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Vyncke, E., Paggen, C., `LAN Switch Security: What Hackers Know About Your Switches <http://books.google.com/books?id=HkraAQAACAAJ>`_, Cisco Press, 2007 152/10000 · 152
147 ../../glossary.rst:234
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A name server that is responsible for the root of the domain names hierarchy. There are currently a dozen root nameservers and each DNS resolver See http://www.root-servers.org/ for more information about the operation of these root servers. 241/10000 · 241
147 ../../principles/dv.rst:210
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `D` sends its distance vector :math:`[D=0,B=\infty,A=1,C=2,E=1]` to `A` and `E`. `A` recovers routes towards `C` and `E` via `D`. 129/10000 · 129