2. cnp3-ebook
3. English
4. Zen

93 ../../principles/reliability.rst:323
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When running on top of a perfect framing sub-layer, a datalink entity can simply issue a `send(SDU)` upon arrival of a `DATA.req(SDU)` [#fsdu]_. Similarly, the receiver issues a `DATA.ind(SDU)` upon receipt of a `recvd(SDU)`. Such a simple protocol is sufficient when a single SDU is sent. This is illustrated in the figure below. 330/10000 · 330
94 ../../glossary.rst:39
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ITU 3/10000 · 3
94 ../../principles/network.rst:461 • ../../principles/network.rst:501 • ../../principles/network.rst:503 • ../../principles/network.rst:515 • ../../principles/network.rst:515 • ../../principles/network.rst:527 • ../../principles/network.rst:527 • ../../principles/network.rst:539 • ../../principles/network.rst:539
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1 1/10000 · 1
94 ../../principles/sharing.rst:607
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To understand `binary exponential back-off`, let us consider a collision caused by exactly two hosts. Once it has detected the collision, a host can either retransmit its frame immediately or defer its transmission for some time. If each colliding host flips a coin to decide whether to retransmit immediately or to defer its retransmission, four cases are possible : 367/10000 · 367
94 ../../principles/transport.rst:568
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Interactions between the transport layer, its user, and its network layer provider 82/10000 · 82
94 ../../principles/security.rst:977
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Mallory generates a secret integer, :math:`m` and sends :math:`M=g^{m} \mod p` to Bob 85/10000 · 85
94 ../../exercises/ipv6.rst:888
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The ``pingall`` command reveals that there is a problem in this network. 72/10000 · 72
94 ../../protocols/bgp.rst:369
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — insert a low `local-pref` attribute in the routes learned from a provider 73/10000 · 73
94 ../../protocols/email.rst:244 • ../../protocols/email.rst:246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 6 1/10000 · 1
94 ../../protocols/ethernet.rst:368
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To determine the state of its other ports, the switch compares its own `BPDU` with the last `BPDU` received on each port. Note that the comparison is done by using the `BPDUs` and not the `root priority vectors`. If the switch's `BPDU` is better than the last `BPDU` of this port, the port becomes a `Designated` port. Otherwise, the port becomes a `Blocked` port. 364/10000 · 364
94 ../../protocols/ipv6.rst:349
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — For example, an IPv6 packet that contains an TCP segment would appear as shown in the figure below. 99/10000 · 99
94 ../../protocols/ethernet.rst:353
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bandwidth 9/10000 · 9
94 ../../protocols/tcp.rst:270
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `sending buffer` : a buffer used to store all unacknowledged data 65/10000 · 65
94 ../../bibliography.rst:119
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Lamport, L., `Password authentication with insecure communication <http://doi.acm.org/10.1145/358790.358797>`_. Communications ACM 24, 11 (November 1981), 770-772. 163/10000 · 163
94 ../../principles/reliability.rst:342
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Unfortunately, this is not always sufficient to ensure a reliable delivery of the SDUs. Consider the case where a client sends tens of SDUs to a server. If the server is faster than the client, it will be able to receive and process all the frames sent by the client and deliver their content to its user. However, if the server is slower than the client, problems may arise. The datalink entity contains buffers to store SDUs that have been received as a `Data.request` but have not yet been sent. If the application is faster than the physical link, the buffer may become full. At this point, the operating system suspends the application to let the datalink entity empty its transmission queue. The datalink entity also uses a buffer to store the received frames that have not yet been processed by the application. If the application is slow to process the data, this buffer may overflow and the datalink entity will not able to accept any additional frame. The buffers of the datalink entity have a limited size and if they overflow, the arriving frames will be discarded, even if they are correct. 1103/10000 · 1103
95 ../../bibliography.rst:122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Eng Keong Lua, Crowcroft, J., Pias, M., Sharma, R., Lim, S., `A survey and comparison of peer-to-peer overlay network schemes <https://dx.doi.org/10.1109/COMST.2005.1610546>`_, Communications Surveys & Tutorials, IEEE, Volume: 7 , Issue: 2, 2005, pp. 72-93 256/10000 · 256
95 ../../glossary.rst:41
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The International Telecommunication Union is a United Nation's agency whose purpose is to develop standards for the telecommunication industry. It was initially created to standardize the basic telephone system but expanded later towards data networks. The work within ITU is mainly done by network specialists from the telecommunication industry (operators and vendors). See https://www.itu.int for more information 416/10000 · 416
95 ../../principles/network.rst:461 • ../../principles/network.rst:461 • ../../principles/network.rst:513 • ../../principles/network.rst:513
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — none 4/10000 · 4
95 ../../principles/reliability.rst:344
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To solve this problem, a reliable protocol must include a feedback mechanism that allows the receiver to inform the sender that it has processed a frame and that another one can be sent. This feedback is required even though there are no transmission errors. To include such a feedback, our reliable protocol must process two types of frames : 343/10000 · 343
95 ../../principles/sharing.rst:609
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Both hosts retransmit immediately and a new collision occurs 60/10000 · 60