2. cnp3-ebook
3. English
4. Zen

137 ../../principles/dv.rst:120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `D` sends its distance vector `[D=0,A=1]` to `A` and `E`. `E` can now reach `A` and `D`. 88/10000 · 88
137 ../../principles/reliability.rst:471 • ../../principles/reliability.rst:488
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 101 3/10000 · 3
137 ../../principles/sharing.rst:825
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Most networks contain links having different bandwidth. Some hosts can use low bandwidth wireless networks. Some servers are attached via 10 Gbps interfaces and inter-router links may vary from a few tens of kilobits per second up to hundred Gbps. Despite these huge differences in performance, any host should be able to efficiently exchange segments with a high-end server. 375/10000 · 375
137 ../../protocols/bgp.rst:482
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In this text, we consider Autonomous System and domain as synonyms. In practice, a domain may be divided into several Autonomous Systems, but we ignore this detail. 165/10000 · 165
137 ../../protocols/email.rst:256
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 12 2/10000 · 2
137 ../../protocols/ipv6.rst:436
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — two `Reserved` fields set to `0`. 33/10000 · 33
137 ../../protocols/wifi.rst:19
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Frequency 9/10000 · 9
137 ../../protocols/tcp.rst:406
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `srtt` : the smoothed round-trip-time computed as :math:`srtt=(\alpha \times srtt)+( (1-\alpha) \times rtt)` where :math:`rtt` is the round-trip-time measured according to the above procedure and :math:`\alpha` a smoothing factor (e.g. 0.8 or 0.9) 247/10000 · 247
137 ../../bibliography.rst:344
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Stallings, W., `Protocol Basics: Secure Shell Protocol <http://www.cisco.com/web/about/ac123/ac147/archived_issues/ipj_12-4/124_ssh.html>`_, Internet Protocol Journal, vol 12, n 4, Dec. 2009 190/10000 · 190
137 ../../principles/transport.rst:818
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Compared to reliable protocols in the datalink layer, reliable transport protocols encode their sequence numbers using more bits. 32 bits and 64 bits sequence numbers are frequent in the transport layer while some datalink layer protocols encode their sequence numbers in an 8 bits field. This large sequence number space is motivated by two reasons. First, since the sequence number is incremented for each transmitted byte, a single segment may consume one or several thousands of sequence numbers. Second, a reliable transport protocol must be able to detect delayed segments. This can only be done if the number of bytes transmitted during the MSL period is smaller than the sequence number space. Otherwise, there is a risk of accepting duplicate segments. 761/10000 · 761
138 ../../glossary.rst:302
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — remote login 12/10000 · 12
138 ../../principles/dv.rst:121
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `C` sends its distance vector `[C=0]` to `B` and `E` 52/10000 · 52
138 ../../principles/reliability.rst:472 • ../../principles/reliability.rst:489
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 011 3/10000 · 3
138 ../../principles/transport.rst:820
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Go-back-n` and `selective repeat` can be used in the transport layer as in the datalink layer. Since the network layer does not guarantee an in-order delivery of the packets, a transport entity should always store the segments that it receives out-of-sequence. For this reason, most transport protocols will opt for some form of selective repeat mechanism. 357/10000 · 357
138 ../../principles/sharing.rst:829
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To understand this problem better, let us consider the scenario shown in the figure below, where a server (`A`) attached to a `10 Mbps` link needs to reliably transfer segments to another computer (`C`) through a path that contains a `2 Mbps` link. 248/10000 · 248
138 ../../protocols/bgp.rst:484
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The BGP sessions and the underlying TCP connection are typically established by the routers when they boot based on information found in their configuration. The BGP sessions are rarely released, except if the corresponding peering link fails or one of the endpoints crashes or needs to be rebooted. 299/10000 · 299
138 ../../protocols/email.rst:256
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — M 1/10000 · 1
138 ../../protocols/ipv6.rst:437
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `Fragment Offset` is a 13-bit unsigned integer that contains the offset, in 8 bytes units, of the data following this header, relative to the start of the original packet. 175/10000 · 175
138 ../../protocols/wifi.rst:19
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Typical throughput 18/10000 · 18
138 ../../protocols/tcp.rst:407
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `rto` : the retransmission timeout is computed as :math:`rto=\min(60,max(1,\beta \times srtt))` where :math:`\beta` is used to take into account the delay variance (value : 1.3 to 2.0). The `60` and `1` constants are used to ensure that the `rto` is not larger than one minute nor smaller than 1 second. 303/10000 · 303