2. cnp3-ebook
3. English
4. Zen

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
101 ../../glossary.rst:273
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A telephone line that is permanently available between two endpoints. 69/10000 · 69
101 ../../principles/network.rst:470
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Label switching` enables a full control over the path followed by packets inside the network. Consider the network below and assume that we want to use two virtual circuits : `R1->R3->R4->R2->R5` and `R2->R1->R3->R4->R5`. 222/10000 · 222
101 ../../principles/reliability.rst:354
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The datalink entity can then be modeled as a finite state machine, containing two states for the receiver and two states for the sender. The figure below provides a graphical representation of this state machine with the sender above and the receiver below. 257/10000 · 257
101 ../../principles/sharing.rst:641
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The inter-frame delay used in this pseudo-code is a short delay corresponding to the time required by a network adapter to switch from transmit to receive mode. It is also used to prevent a host from sending a continuous stream of frames without leaving any transmission opportunities for other hosts on the network. This contributes to the fairness of CSMA/CD. Despite this delay, there are still conditions where CSMA/CD is not completely fair [RY1994]_. Consider for example a network with two hosts : a server sending long frames and a client sending acknowledgments. Measurements reported in [RY1994]_ have shown that there are situations where the client could suffer from repeated collisions that lead it to wait for long periods of time due to the exponential back-off algorithm. 787/10000 · 787
101 ../../principles/transport.rst:611
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A `segment` also contains control information, usually stored inside a `header` and the payload that comes from the application. To detect transmission errors, transport protocols rely on checksums or CRCs like the datalink layer protocols. 240/10000 · 240
101 ../../principles/security.rst:995
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Alice chooses a secret integer : :math:`a` and sends :math:`A= g^{a} \mod p` to Bob 83/10000 · 83
101 ../../exercises/ipv6.rst:971
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Next Header` of the IPv6 packet indicates the type of the header that follows the IPv6 packet. IANA_ maintains a list of all the assigned values of this header at https://www.iana.org/assignments/protocol-numbers/protocol-numbers.xhtml 240/10000 · 240
101 ../../protocols/bgp.rst:396
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In this internetwork, we focus on the route towards `2001:db8::1234/48` which is advertised by `AS1`. Let us also assume that `AS3` (resp. `AS4`) prefers, e.g. for economic reasons, a route learned from `AS4` (`AS3`) over a route learned from `AS1`. When `AS1` sends `U(2001:db8::1234/48,AS1)` to `AS3` and `AS4`, three sequences of exchanges of BGP messages are possible : 373/10000 · 373
101 ../../protocols/email.rst:246 • ../../protocols/email.rst:248
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 7 1/10000 · 1
101 ../../protocols/ethernet.rst:375 • ../../protocols/ethernet.rst:376 • ../../protocols/ethernet.rst:376 • ../../protocols/ethernet.rst:377 • ../../protocols/ethernet.rst:377 • ../../protocols/ethernet.rst:377
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — yes 3/10000 · 3
101 ../../protocols/ipv6.rst:365
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Fragment` header. This option is processed only by hosts. 58/10000 · 58
101 ../../protocols/ethernet.rst:357
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 20000 5/10000 · 5
101 ../../protocols/tcp.rst:291
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An elegant solution to this problem was proposed by John Nagle in :rfc:`896`. John Nagle observed that the overhead caused by the TCP header was a problem in wide area connections, but less in local area connections where the available bandwidth is usually higher. He proposed the following rules to decide to send a new data segment when a new data has been produced by the user or a new `ack` segment has been received. 421/10000 · 421
102 ../../glossary.rst:30
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — MAN 3/10000 · 3