2. cnp3-ebook
3. English
4. Zen

139 ../../protocols/wifi.rst:19
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Max bandwidth 13/10000 · 13
139 ../../protocols/tcp.rst:409
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — However, in practice, this computation for the retransmission timeout did not work well. The main problem was that the computed `rto` did not correctly take into account the variations in the measured round-trip-time. `Van Jacobson` proposed in his seminal paper [Jacobson1988]_ an improved algorithm to compute the `rto` and implemented it in the BSD Unix distribution. This algorithm is now part of the TCP standard :rfc:`2988`. 430/10000 · 430
140 ../../bibliography.rst:349
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Shreedhar and G. Varghese. `Efficient fair queueing using deficit round robin <http://doi.acm.org/10.1145/217391.217453>`_ SIGCOMM Computer Communication Review 25, 4 (October 1995), 231-242. 191/10000 · 191
140 ../../glossary.rst:235
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — resolver 8/10000 · 8
140 ../../principles/dv.rst:123
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `B` sends its distance vector `[B=0,A=1,C=1,D=2,E=1]` to `A`, `C` and `E`. `A`, `B`, `C` and `E` can now reach all five routers of this network. 144/10000 · 144
140 ../../principles/reliability.rst:477
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — It is also possible to design a code that allows the receiver to correct transmission errors. The simplest `error correction code` is the triple modular redundancy (TMR). To transmit a bit set to `1` (resp. `0`), the sender transmits `111` (resp. `000`). When there are no transmission errors, the receiver can decode `111` as `1`. If transmission errors have affected a single bit, the receiver performs majority voting as shown in the table below. This scheme allows the receiver to correct all transmission errors that affect a single bit. 542/10000 · 542
140 ../../principles/transport.rst:824
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To deal with this issue, transport protocols allow the receiver to advertise the current size of its receiving window in all the acknowledgments that it sends. The receiving window advertised by the receiver bounds the size of the sending buffer used by the sender. In practice, the sender maintains two state variables : `swin`, the size of its sending window (that may be adjusted by the system) and `rwin`, the size of the receiving window advertised by the receiver. At any time, the number of unacknowledged segments cannot be larger than :math:`\min(swin,rwin)` [#facklost]_ . The utilization of dynamic windows is illustrated in the figure below. 653/10000 · 653
140 ../../principles/sharing.rst:854
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Self clocking 13/10000 · 13
140 ../../protocols/bgp.rst:488
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A link is said to be flapping if it switches several times between an operational state and a disabled state within a short period of time. A router attached to such a link would need to frequently send routing messages. 220/10000 · 220
140 ../../protocols/email.rst:256
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — d 1/10000 · 1
140 ../../protocols/ipv6.rst:439
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the 32-bit `Identification` field indicates to which original packet a fragment belongs. When a host sends fragmented packets, it should ensure that it does not reuse the same `identification` field for packets sent to the same destination during a period of `MSL` seconds. This is easier with the 32 bits `identification` used in the IPv6 fragmentation header, than with the 16 bits `identification` field of the IPv4 header. 426/10000 · 426
140 ../../protocols/wifi.rst:19
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Range (m) indoor/outdoor 24/10000 · 24
140 ../../protocols/tcp.rst:411
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Jacobson's algorithm uses two state variables, `srtt` the smoothed `rtt` and `rttvar` the estimation of the variance of the `rtt` and two parameters : :math:`\alpha` and :math:`\beta`. When a TCP connection starts, the first `rto` is set to `3` seconds. When a first estimation of the `rtt` is available, the `srtt`, `rttvar` and `rto` are computed as follows : 361/10000 · 361
141 ../../glossary.rst:237
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A server that implements the DNS protocol and can resolve queries. A resolver usually serves a set of clients (e.g. all hosts in campus or all clients of a given ISP). It sends DNS queries to nameservers everywhere on behalf of its clients and stores the received answers in its cache. A resolver must know the IP addresses of the root nameservers. 348/10000 · 348
141 ../../principles/dv.rst:124
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `A` sends its distance vector `[A=0,B=1,C=2,D=1,E=2]` to `B` and `D`. 69/10000 · 69
141 ../../principles/reliability.rst:480
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Received bits 13/10000 · 13
141 ../../principles/transport.rst:830
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Dynamic receiving window 24/10000 · 24
141 ../../protocols/bgp.rst:490
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Researchers such as [MUF+2007]_ have shown that modeling the Internet topology at the AS-level requires more than the `shared-cost` and `customer->provider` peering relationships. However, there is no publicly available model that goes beyond these classical peering relationships. 281/10000 · 281
141 ../../protocols/email.rst:256
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 46 2/10000 · 2
141 ../../protocols/ipv6.rst:445
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Some IPv6 implementations send the fragments of a packet in increasing fragment offset order, starting from the first fragment. Others send the fragments in reverse order, starting from the last fragment. The latter solution can be advantageous for the host that needs to reassemble the fragments, as it can easily allocate the buffer required to reassemble all fragments of the packet upon reception of the last fragment. When a host receives the first fragment of an IPv6 packet, it cannot know a priori the length of the entire IPv6 packet. 543/10000 · 543