2. cnp3-ebook
3. English
4. Zen

154 ../../protocols/email.rst:260
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — f 1/10000 · 1
154 ../../protocols/ipv6.rst:520
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ICMP version 6 14/10000 · 14
154 ../../protocols/wifi.rst:24 • ../../protocols/wifi.rst:25
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 38/140 6/10000 · 6
154 ../../protocols/tcp.rst:494
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Detecting isolated segment losses 33/10000 · 33
154 ../../bibliography.rst:371
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Zimmermann T., Wolters B., Hohlfeld O., Wehrle K. `Is the web ready for HTTP/2 server push? <http://doi.acm.org/10.1145/3281411.3281434>`_ , Proceedings of the 14th International Conference on emerging Networking Experiments and Technologies 2018 Dec 4 (pp. 13-19). ACM. 270/10000 · 270
154 ../../principles/reliability.rst:590
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Alternating Bit Protocol uses a single bit to encode the sequence number. It can be implemented easily. The sender (resp. the receiver) only require a four-state (resp. three-state) Finite State Machine. 207/10000 · 207
155 ../../glossary.rst:65
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a Service Data Unit is the unit information transferred between applications 76/10000 · 76
155 ../../bibliography.rst:372
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Zimmermann, H., `OSI Reference Model - The ISO Model of Architecture for Open Systems Interconnection <https://dx.doi.org/10.1109/TCOM.1980.1094702>`_, IEEE Transactions on Communications, vol. 28, no. 4, April 1980, pp. 425 - 432. 232/10000 · 232
155 ../../principles/dv.rst:306
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This count to infinity problem occurs because router `A` advertises to router `D` a route that it has learned via router `D`. A possible solution to avoid this problem could be to change how a router creates its distance vector. Instead of computing one distance vector and sending it to all its neighbors, a router could create a distance vector that is specific to each neighbor and only contains the routes that have not been learned via this neighbor. This could be implemented by the following pseudocode. 510/10000 · 510
155 ../../principles/reliability.rst:643
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The initial state of the sender is `Wait for D(0,...)`. In this state, the sender waits for a `Data.request`. The first data frame that it sends uses sequence number `0`. After having sent this frame, the sender waits for an `OK0` acknowledgment. A frame is retransmitted upon expiration of the retransmission timer or if an acknowledgment with an incorrect sequence number has been received. 392/10000 · 392
155 ../../principles/transport.rst:890
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Footnotes 9/10000 · 9
155 ../../principles/sharing.rst:950
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As shown in the graph above, a rate allocation may be fair but not efficient (e.g. :math:`r_A=0.7,r_B=0.7`), fair and efficient ( e.g. :math:`r_A=1,r_B=1`) or efficient but not fair (e.g. :math:`r_A=1.5,r_B=0.5`). Ideally, the allocation should be both fair and efficient. Unfortunately, maintaining such an allocation with fluctuations in the number of flows that use the network is a challenging problem. Furthermore, there might be several thousands flows that pass through the same link [#fflowslink]_. 506/10000 · 506
155 ../../protocols/email.rst:260
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 48 2/10000 · 2
155 ../../protocols/ipv6.rst:522
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — It is sometimes necessary for intermediate routers or the destination host to inform the sender of the packet of a problem that occurred while processing a packet. In the TCP/IP protocol suite, this reporting is done by the Internet Control Message Protocol (ICMP). ICMPv6 is defined in :rfc:`4443`. It is used both to report problems that occurred while processing an IPv6 packet, but also to distribute addresses. 415/10000 · 415
155 ../../protocols/wifi.rst:25
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 802.11g 7/10000 · 7
155 ../../protocols/tcp.rst:496
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As shown above, when an isolated segment is lost the sender receives several `duplicate acknowledgments` since the TCP receiver immediately sends a pure acknowledgment when it receives an out-of-sequence segment. A duplicate acknowledgment is an acknowledgment that contains the same `acknowledgment number` as a previous segment. A single duplicate acknowledgment does not necessarily imply that a segment was lost, as a simple reordering of the segments may cause duplicate acknowledgments as well. Measurements [Paxson99]_ have shown that segment reordering is frequent in the Internet. Based on these observations, the `fast retransmit` heuristic has been included in most TCP implementations. It can be implemented as follows. 732/10000 · 732
156 ../../glossary.rst:57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — segment 7/10000 · 7
156 ../../bibliography.rst:373
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Zakon, R., `Hobbes Internet Timeline <https://www.zakon.org/robert/internet/timeline/>`_, online, https://www.zakon.org/robert/internet/timeline/ 145/10000 · 145
156 ../../principles/dv.rst:323
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This technique is called `split-horizon`. With this technique, the count to infinity problem would not have happened in the above scenario, as router `A` would have advertised :math:`[A=0]` after the failure, since it learned all its other routes via router `D`. Another variant called `split-horizon with poison reverse` is also possible. Routers using this variant advertise a cost of :math:`\infty` for the destinations that they reach via the router to which they send the distance vector. This can be implemented by using the pseudo-code below. 550/10000 · 550
156 ../../principles/reliability.rst:645
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The receiver first waits for `D(0,...)`. If the frame contains a correct `CRC`, it passes the SDU to its user and sends `OK0`. If the frame contains an invalid CRC, it is immediately discarded. Then, the receiver waits for `D(1,...)`. In this state, it may receive a duplicate `D(0,...)` or a data frame with an invalid CRC. In both cases, it returns an `OK0` frame to allow the sender to recover from the possible loss of the previous `OK0` frame. 448/10000 · 448