2. cnp3-ebook
3. English
4. Zen

161 ../../principles/sharing.rst:970
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The simplest form of feedback that the network can send to a source is a binary feedback (the network is congested or not congested). In this case, a `linear` rate adaptation algorithm can be expressed as : 206/10000 · 206
161 ../../protocols/email.rst:262
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 49 2/10000 · 2
161 ../../protocols/ipv6.rst:536
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``0`` : No route to destination. This indicates that the router that sent the ICMPv6 message did not have a route towards the packet's destination 146/10000 · 146
161 ../../protocols/wifi.rst:26
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 70/250 6/10000 · 6
161 ../../protocols/tcp.rst:531
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A SACK option contains one or more blocks. A block corresponds to all the sequence numbers between the `left edge` and the `right edge` of the block. The two edges of the block are encoded as 32 bit numbers (the same size as the TCP sequence number) in an SACK option. As the SACK option contains one byte to encode its type and one byte for its length, a SACK option containing `b` blocks is encoded as a sequence of :math:`2+8 \times b` bytes. In practice, the size of the SACK option can be problematic as the optional TCP header extension cannot be longer than 40 bytes. As the SACK option is usually combined with the :rfc:`1323` timestamp extension, this implies that a TCP segment cannot usually contain more than three SACK blocks. This limitation implies that a TCP receiver cannot always place in the SACK option that it sends, information about all the received blocks. 880/10000 · 880
161 ../../principles/reliability.rst:758
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The second figure illustrates how the hosts handle the loss of one control frame. 81/10000 · 81
162 ../../glossary.rst:117
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — socket 6/10000 · 6
162 ../../principles/reliability.rst:794
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Alternating Bit Protocol can recover from transmission errors and frame losses. However, it has one important drawback. Consider two hosts that are directly connected by a 50 Kbits/sec satellite link that has a 250 milliseconds propagation delay. If these hosts send 1000 bits frames, then the maximum throughput that can be achieved by the alternating bit protocol is one frame every :math:`20+250+250=520` milliseconds if we ignore the transmission time of the acknowledgment. This is less than 2 Kbits/sec ! 514/10000 · 514
162 ../../principles/dv.rst:417
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Forwarding tables versus routing tables 39/10000 · 39
162 ../../principles/sharing.rst:972
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :math:`rate(t+1)=\alpha_C + \beta_C rate(t)` when the network is congested 74/10000 · 74
162 ../../protocols/email.rst:262
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — x 1/10000 · 1
162 ../../protocols/ipv6.rst:537
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``1`` : Communication with destination administratively prohibited. This indicates that a firewall has refused to forward the packet towards its final destination. 163/10000 · 163
162 ../../protocols/wifi.rst:29
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When developing its family of standards, the `IEEE 802.11 working group <http://www.ieee802.org/11/>`_ took a similar approach as the `IEEE 802.3 working group <http://www.ieee802.org/3/>`_ that developed various types of physical layers for Ethernet networks. 802.11 networks use the CSMA/CA Medium Access Control technique described earlier and they all assume the same architecture and use the same frame format. 415/10000 · 415
162 ../../protocols/tcp.rst:533
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To deal with the limited size of the SACK option, a TCP receiver currently having more than 3 blocks inside its receiving buffer must select the blocks to place in the SACK option. A good heuristic is to put in the SACK option the blocks that have most recently changed, as the sender is likely to be already aware of the older blocks. 335/10000 · 335
163 ../../glossary.rst:119
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A low-level API originally defined on Berkeley Unix to allow programmers to develop clients and servers. 104/10000 · 104
163 ../../principles/reliability.rst:804
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Go-back-n and selective repeat 30/10000 · 30
163 ../../principles/dv.rst:419
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Routers usually maintain at least two data structures that contain information about the reachable destinations. The first data structure is the `routing table`. The `routing table` is a data structure that associates a destination to an outgoing interface or a nexthop router and a set of additional attributes. Different routing protocols can associate different attributes for each destination. Distance vector routing protocols will store the cost to reach the destination along the shortest path. Other routing protocols may store information about the number of hops of the best path, its lifetime or the number of sub paths. A `routing table` may store different paths towards a given destination and flag one of them as the best one. 741/10000 · 741
163 ../../principles/sharing.rst:973
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :math:`rate(t+1)=\alpha_N + \beta_N rate(t)` when the network is *not* congested 80/10000 · 80
163 ../../protocols/email.rst:264
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 16 2/10000 · 2
163 ../../protocols/ipv6.rst:538
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``2`` : Beyond scope of source address. This message can be sent if the source is using link-local addresses to reach a global unicast address outside its subnet. 162/10000 · 162