2. cnp3-ebook
3. English
4. Zen

99 ../../protocols/email.rst:244
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — o 1/10000 · 1
99 ../../protocols/ethernet.rst:373
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Handles data frames 19/10000 · 19
99 ../../protocols/ipv6.rst:363
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Destination Options` header. This option is processed only by hosts. 69/10000 · 69
99 ../../protocols/ethernet.rst:356
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 200000 6/10000 · 6
99 ../../protocols/tcp.rst:281
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Segment transmission strategies 31/10000 · 31
100 ../../bibliography.rst:133
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — McQuillan, J. M., Richer, I., and Rosen, E. C., `An overview of the new routing algorithm for the ARPANET <http://doi.acm.org/10.1145/800092.802981>`_. In Proceedings of the Sixth Symposium on Data Communications (Pacific Grove, California, United States, November 27 - 29, 1979). SIGCOMM '79. ACM, New York, NY, 63-68. 319/10000 · 319
100 ../../glossary.rst:271
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — leased line 11/10000 · 11
100 ../../principles/network.rst:468
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If this node receives a packet with `label=2`, it forwards the packet on its `West` interface and sets the `label` of the outgoing packet to `2`. If the received packet's `label` is set to `3`, then the packet is forwarded over the `East` interface and the `label` of the outgoing packet is set to `2`. If a packet is received with a label field set to `1`, the packet is discarded since the corresponding `label forwarding table` entry is invalid. 448/10000 · 448
100 ../../principles/reliability.rst:352
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the payload that contains the SDU supplied by the application 61/10000 · 61
100 ../../principles/sharing.rst:616
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If two hosts are competing, the algorithm above will avoid a second collision 50% of the time. However, if the network is heavily loaded, several hosts may be competing at the same time. In this case, the hosts should be able to automatically adapt their retransmission delay. The `binary exponential back-off` performs this adaptation based on the number of collisions that have affected a frame. After the first collision, the host flips a coin and waits 0 or 1 `slot time`. After the second collision, it generates a random number and waits 0, 1, 2 or 3 `slot times`, etc. The duration of the waiting time is doubled after each collision. The complete pseudo-code for the CSMA/CD algorithm is shown in the figure below. 722/10000 · 722
100 ../../principles/transport.rst:583
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To exchange data, the transport protocol encapsulates the SDU produced by its user inside a `segment`. The `segment` is the unit of transfer of information in the transport layer. Transport layer entities always exchange segments. When a transport layer entity creates a segment, this segment is encapsulated by the network layer into a packet which contains the segment as its payload and a network header. The packet is then encapsulated in a frame to be transmitted in the datalink layer. 491/10000 · 491
100 ../../principles/security.rst:988
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To safely use the Diffie-Hellman key exchange, Alice and Bob must use an `authenticated` exchange. Some of the information sent by Alice or Bob must be signed with a public key known by the other user. In practice, it is often important for Alice to authenticate Bob. If Bob has a certificated signed by Ted, the authenticated key exchange could be organized as follows. 370/10000 · 370
100 ../../exercises/ipv6.rst:967
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To correctly understand the operation of IPv6, it is sometimes important to remember the packet format and how the different fields are used. 141/10000 · 141
100 ../../protocols/bgp.rst:394
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The disagree internetwork 25/10000 · 25
100 ../../protocols/email.rst:244
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 57 2/10000 · 2
100 ../../protocols/ethernet.rst:375
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Blocked 7/10000 · 7
100 ../../protocols/ipv6.rst:364
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Routing` header. This option is processed by some nodes. 57/10000 · 57
100 ../../protocols/ethernet.rst:357
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1 Gbps 6/10000 · 6
100 ../../protocols/tcp.rst:289
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In a transport protocol such as TCP that offers a bytestream, a practical issue that was left as an implementation choice in :rfc:`793` is to decide when a new TCP segment containing data must be sent. There are two simple and extreme implementation choices. The first implementation choice is to send a TCP segment as soon as the user has requested the transmission of some data. This allows TCP to provide a low delay service. However, if the user is sending data one byte at a time, TCP would place each user byte in a segment containing 20 bytes of TCP header [#fnagleip]_. This is a huge overhead that is not acceptable in wide area networks. A second simple solution would be to only transmit a new TCP segment once the user has produced MSS bytes of data. This solution reduces the overhead, but at the cost of a potentially very high delay. 848/10000 · 848
101 ../../bibliography.rst:134
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — McQuillan, J.M., Richer, I., Rosen, E., `The New Routing Algorithm for the ARPANET <https://dx.doi.org/10.1109/TCOM.1980.1094721>`_ Communications, IEEE Transactions on , vol.28, no.5, pp.711,719, May 1980 205/10000 · 205