2. cnp3-ebook
3. English
4. Zen

147 ../../protocols/email.rst:258
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 30 2/10000 · 2
147 ../../protocols/ipv6.rst:494
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The reassembly algorithm used by the destination host is roughly as follows. First, the destination can verify whether a received IPv6 packet is a fragment or not by checking whether it contains a fragment header. If so, all fragments with the some identification must be reassembled together. The reassembly algorithm relies on the `Identification` field of the received fragments to associate a fragment with the corresponding packet being reassembled. Furthermore, the `Fragment Offset` field indicates the position of the fragment payload in the original non-fragmented packet. Finally, the packet with the `M` flag reset allows the destination to determine the total length of the original non-fragmented packet. 717/10000 · 717
147 ../../protocols/wifi.rst:23
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 5 GHz 5/10000 · 5
147 ../../protocols/tcp.rst:443
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Advanced retransmission strategies 34/10000 · 34
147 ../../bibliography.rst:358
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Wang XS, Balasubramanian A, Krishnamurthy A, Wetherall D. `How Speedy is SPDY ? <https://www.usenix.org/conference/nsdi14/technical-sessions/wang>`_ . In 11th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 14) 2014 (pp. 387-399). 256/10000 · 256
148 ../../glossary.rst:123
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — round-trip-time 15/10000 · 15
148 ../../principles/dv.rst:211
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `B` sends its distance vector :math:`[B=0,A=\infty,C=1,D=2,E=1]` to `E` and `C`. `C` learns that there is no route anymore to reach `A` via `B`. 144/10000 · 144
148 ../../principles/reliability.rst:502
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The simplest error detection scheme is the checksum. A checksum is basically an arithmetic sum of all the bytes that a frame is composed of. There are different types of checksums. For example, an eight bit checksum can be computed as the arithmetic sum of all the bytes of (both the header and trailer of) the frame. The checksum is computed by the sender before sending the frame and the receiver verifies the checksum upon frame reception. The receiver discards frames received with an invalid checksum. Checksums can be easily implemented in software, but their error detection capabilities are limited. Cyclical Redundancy Checks (CRC) have better error detection capabilities [SGP98]_, but require more CPU when implemented in software. 742/10000 · 742
148 ../../principles/transport.rst:860
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Connection release 18/10000 · 18
148 ../../principles/sharing.rst:933
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The congestion control scheme must be `efficient`. The bottleneck link is usually both a shared and an expensive resource. Usually, bottleneck links are wide area links that are much more expensive to upgrade than the local area networks. The congestion control scheme should ensure that such links are efficiently used. Mathematically, the control scheme should ensure that :math:`\forall{t} \sum{r_i(t)} \approx R`. 417/10000 · 417
148 ../../protocols/email.rst:258
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — e 1/10000 · 1
148 ../../protocols/ipv6.rst:496
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Note that the reassembly algorithm must deal with the unreliability of the IP network. This implies that a fragment may be duplicated or a fragment may never reach the destination. The destination can easily detect fragment duplication thanks to the `Fragment Offset`. To deal with fragment losses, the reassembly algorithm must bind the time during which the fragments of a packet are stored in its buffer while the packet is being reassembled. This can be implemented by starting a timer when the first fragment of a packet is received. If the packet has not been reassembled upon expiration of the timer, all fragments are discarded and the packet is considered to be lost. 676/10000 · 676
148 ../../protocols/wifi.rst:23
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 23 Mbps 7/10000 · 7
148 ../../protocols/tcp.rst:447
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The default go-back-n retransmission strategy was defined in :rfc:`793`. When the retransmission timer expires, TCP retransmits the first unacknowledged segment (i.e. the one having sequence number `snd.una`). After each expiration of the retransmission timeout, :rfc:`2988` recommends to double the value of the retransmission timeout. This is called an `exponential backoff`. This doubling of the retransmission timeout after a retransmission was included in TCP to deal with issues such as network/receiver overload and incorrect initial estimations of the retransmission timeout. If the same segment is retransmitted several times, the retransmission timeout is doubled after every retransmission until it reaches a configured maximum. :rfc:`2988` suggests a maximum retransmission timeout of at least 60 seconds. Once the retransmission timeout reaches this configured maximum, the remote host is considered to be unreachable and the TCP connection is closed. 964/10000 · 964
148 ../../bibliography.rst:360
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — White, R., Mc Pherson, D., Srihari, S., `Practical BGP <http://books.google.com/books?id=9OlSAAAAMAAJ>`_, Addison-Wesley, 2004 126/10000 · 126
149 ../../glossary.rst:125
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The round-trip-time (RTT) is the delay between the transmission of a segment and the reception of the corresponding acknowledgment in a transport protocol. 155/10000 · 155
149 ../../principles/dv.rst:212
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `E` sends its distance vector :math:`[E=0,A=2,C=1,D=1,B=1]` to `D`, `B` and `C`. `D` learns a route towards `B`. `C` and `B` learn a route towards `A`. 151/10000 · 151
149 ../../principles/transport.rst:864
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When we discussed the connection-oriented service, we mentioned that there are two types of connection releases : `abrupt release` and `graceful release`. 154/10000 · 154
149 ../../principles/sharing.rst:934
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The congestion control scheme should be `fair`. Most congestion schemes aim at achieving `max-min fairness`. An allocation of transmission rates to sources is said to be `max-min fair` if : 189/10000 · 189
149 ../../protocols/email.rst:258
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 47 2/10000 · 2