2. cnp3-ebook
3. English
4. Zen

153 ../../protocols/wifi.rst:24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 11 Mbps 7/10000 · 7
153 ../../protocols/tcp.rst:488
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — From a performance point of view, one issue with TCP's `retransmission timeout` is that when there are isolated segment losses, the TCP sender often remains idle waiting for the expiration of its retransmission timeouts. Such isolated losses are frequent in the global Internet [Paxson99]_. A heuristic to deal with isolated losses without waiting for the expiration of the retransmission timeout has been included in many TCP implementations since the early 1990s. To understand this heuristic, let us consider the figure below that shows the segments exchanged over a TCP connection when an isolated segment is lost. 619/10000 · 619
153 ../../bibliography.rst:370
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Ylonen, T., `SSH — Secure Login Connections over the Internet <https://www.usenix.org/legacy/publications/library/proceedings/sec96/full_papers/ylonen/index.html>`_, Usenix Security 1996 186/10000 · 186
154 ../../glossary.rst:63
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — SDU (Service Data Unit) 23/10000 · 23
154 ../../principles/dv.rst:301
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Routers `A` and `D` exchange distance vectors with increasing costs until these costs reach :math:`\infty`. This problem may occur in other scenarios than the one depicted in the above figure. In fact, distance vector routing may suffer from count to infinity problems as soon as there is a cycle in the network. Unfortunately, cycles are widely used in networks since they provide the required redundancy to deal with link and router failures. To mitigate the impact of counting to infinity, some distance vector protocols consider that :math:`16=\infty`. Unfortunately, this limits the metrics that network operators can use and the diameter of the networks using distance vectors. 683/10000 · 683
154 ../../principles/transport.rst:885
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Graceful connection release 27/10000 · 27
154 ../../principles/sharing.rst:947
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Possible allocated transmission rates 37/10000 · 37
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