cnp3-ebook - English @ Weblate

Exit Zen

157 ../../principles/sharing.rst:954

	English A congestion control scheme can be modeled as an algorithm that adapts the transmission rate (:math:`r_i(t)`) of host :math:`i` based on the feedback received from the network. Different types of feedback are possible. The simplest scheme is a binary feedback [CJ1989]_ [Jacobson1988]_ where the hosts simply learn whether the network is congested or not. Some congestion control schemes allow the network to regularly send an allocated transmission rate in Mbps to each host [BF1995]_. 487/10000 · 487
157 ../../protocols/email.rst:262

	English 15 2/10000 · 2
157 ../../protocols/ipv6.rst:530

	English ICMP version 6 packet format 28/10000 · 28
157 ../../protocols/wifi.rst:26

	English 802.11n 7/10000 · 7
157 ../../protocols/tcp.rst:512

	English The figure below illustrates the operation of the `fast retransmit` heuristic. 78/10000 · 78
157 ../../principles/dv.rst:341

	English Unfortunately, split-horizon is not sufficient to avoid all count to infinity problems with distance vector routing. Consider the failure of link `A-B` in the four routers network shown below. 192/10000 · 192
158 ../../glossary.rst:186

	English SMTP 4/10000 · 4
158 ../../principles/reliability.rst:698

	English The receiver FSM of the Alternating bit protocol discards all frames that contain an invalid CRC. This is the safest approach since the received frame can be completely different from the frame sent by the remote host. A receiver should not attempt at extracting information from a corrupted frame because it cannot know which portion of the frame has been affected by the error. 379/10000 · 379
158 ../../principles/dv.rst:407

	English After having detected the failure, router `B` sends its distance vectors: 73/10000 · 73
158 ../../principles/transport.rst:895

	English For a discussion on how the sending buffer can change, see e.g. [SMM1998]_ 74/10000 · 74
158 ../../principles/sharing.rst:959

	English Let us focus on the binary feedback scheme which is the most widely used today. Intuitively, the congestion control scheme should decrease the transmission rate of a host when congestion has been detected in the network, in order to avoid congestion collapse. Furthermore, the hosts should increase their transmission rate when the network is not congested. Otherwise, the hosts would not be able to efficiently utilize the network. The rate allocated to each host fluctuates with time, depending on the feedback received from the network. The figure below illustrates the evolution of the transmission rates allocated to two hosts in our simple network. Initially, two hosts have a low allocation, but this is not efficient. The allocations increase until the network becomes congested. At this point, the hosts decrease their transmission rate to avoid congestion collapse. If the congestion control scheme works well, after some time the allocations should become both fair and efficient. 991/10000 · 991
158 ../../protocols/email.rst:262

	English P 1/10000 · 1
158 ../../protocols/ipv6.rst:533

	English ICMPv6 specifies two classes of messages : error messages that indicate a problem in handling a packet and informational messages. Four types of error messages are defined in :rfc:`4443` : 188/10000 · 188
158 ../../protocols/wifi.rst:26

	English 2.4/5 GHz 9/10000 · 9
158 ../../protocols/tcp.rst:518

	English TCP fast retransmit heuristics 30/10000 · 30
159 ../../glossary.rst:188

	English The Simple Mail Transfer Protocol is defined in :rfc:`821` 58/10000 · 58
159 ../../principles/reliability.rst:701

	English The figure below illustrates the operation of the alternating bit protocol. 75/10000 · 75
159 ../../principles/dv.rst:409

	English :math:`[A=\infty,B=0,C=\infty,E=1]` to router `C` 49/10000 · 49
159 ../../principles/transport.rst:897

	English Note that if the receive window shrinks, it might happen that the sender has already sent a segment that is not anymore inside its window. This segment will be discarded by the receiver and the sender will retransmit it later. 226/10000 · 226
159 ../../principles/sharing.rst:965

	English Evolution of the transmission rates 35/10000 · 35

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.