2. cnp3-ebook
3. English
4. Zen

159 ../../principles/sharing.rst:965
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Evolution of the transmission rates 35/10000 · 35
159 ../../protocols/email.rst:262
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 32 2/10000 · 2
159 ../../protocols/ipv6.rst:539
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``1`` : `Destination Unreachable`. Such an ICMPv6 message is sent when the destination address of a packet is unreachable. The `code` field of the ICMP header contains additional information about the type of unreachability. The following codes are specified in :rfc:`4443` 273/10000 · 273
159 ../../protocols/wifi.rst:26
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 74 Mbps 7/10000 · 7
159 ../../protocols/tcp.rst:523
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When losses are not isolated or when the windows are small, the performance of the `fast retransmit` heuristic decreases. In such environments, it is necessary to allow a TCP sender to use a selective repeat strategy instead of the default go-back-n strategy. Implementing selective-repeat requires a change to the TCP protocol as the receiver needs to be able to inform the sender of the out-of-order segments that it has already received. This can be done by using the Selective Acknowledgments (SACK) option defined in :rfc:`2018`. This TCP option is negotiated during the establishment of a TCP connection. If both TCP hosts support the option, SACK blocks can be attached by the receiver to the segments that it sends. SACK blocks allow a TCP receiver to indicate the blocks of data that it has received correctly but out of sequence. The figure below illustrates the utilization of the SACK blocks. 904/10000 · 904
160 ../../glossary.rst:93
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — SNMP 4/10000 · 4
160 ../../principles/dv.rst:410
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :math:`[A=\infty,B=0,C=1,E=\infty]` to router `E` 49/10000 · 49
160 ../../principles/transport.rst:899
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In reality, the Internet does not strictly enforce this MSL. However, it is reasonable to expect that most packets on the Internet will not remain in the network during more than 2 minutes. There are a few exceptions to this rule, such as :rfc:`1149` whose implementation is described in http://www.blug.linux.no/rfc1149/ but there are few real links supporting :rfc:`1149` in the Internet. 390/10000 · 390
160 ../../principles/sharing.rst:968
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Various types of rate adaption algorithms are possible. `Dah Ming Chiu`_ and `Raj Jain`_ have analyzed, in [CJ1989]_, different types of algorithms that can be used by a source to adapt its transmission rate to the feedback received from the network. Intuitively, such a rate adaptation algorithm increases the transmission rate when the network is not congested (ensure that the network is efficiently used) and decrease the transmission rate when the network is congested (to avoid congestion collapse). 505/10000 · 505
160 ../../protocols/email.rst:262
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — g 1/10000 · 1
160 ../../protocols/ipv6.rst:538
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Destination Unreachable. Such an ICMPv6 message is sent when the destination address of a packet is unreachable. The code field of the ICMP header contains additional information about the type of unreachability. The following codes are specified in RFC 4443 258/10000 · 258
160 ../../protocols/wifi.rst:26
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 150 Mbps 8/10000 · 8
160 ../../protocols/tcp.rst:529
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — TCP selective acknowledgments 29/10000 · 29
160 ../../principles/reliability.rst:731
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Alternating Bit Protocol can recover from the losses of data or control frames. This is illustrated in the two figures below. The first figure shows the loss of one data frame. 180/10000 · 180
161 ../../glossary.rst:95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Simple Network Management Protocol is a management protocol defined for TCP/IP networks. 92/10000 · 92
161 ../../principles/dv.rst:412
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If, unfortunately, the distance vector sent to router `C` is lost due to a transmission error or because router `C` is overloaded, a new count to infinity problem can occur. If router `C` sends its distance vector :math:`[A=2,B=1,C=0,E=\infty]` to router `E`, this router installs a route of distance `3` to reach `A` via `C`. Router `E` sends its distance vectors :math:`[A=3,B=\infty,C=1,E=1]` to router `B` and :math:`[A=\infty,B=1,C=\infty,E=0]` to router `C`. This distance vector allows `B` to recover a route of distance `4` to reach `A`. 545/10000 · 545
161 ../../principles/sharing.rst:970
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The simplest form of feedback that the network can send to a source is a binary feedback (the network is congested or not congested). In this case, a `linear` rate adaptation algorithm can be expressed as : 206/10000 · 206
161 ../../protocols/email.rst:262
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 49 2/10000 · 2
161 ../../protocols/ipv6.rst:536
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``0`` : No route to destination. This indicates that the router that sent the ICMPv6 message did not have a route towards the packet's destination 146/10000 · 146
161 ../../protocols/wifi.rst:26
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 70/250 6/10000 · 6