Exit Zen
142
../../protocols/wifi.rst:22 • ../../protocols/wifi.rst:24 • ../../protocols/wifi.rst:25
English
2.4 GHz
0/100 · 7
142
../../protocols/tcp.rst:426
English
:math:`rttvar=(1-\beta) \times rttvar + \beta \times |srtt - rtt|`
0/660 · 66
143
../../glossary.rst:316
English
remote login
0/120 · 12
143
../../principles/dv.rst:92
English
When a router notices that a route towards a destination has expired, it must first associate an :math:`\infty` cost to this route and send its distance vector to its neighbors to inform them. The route can then be removed from the routing table after some time (e.g. :math:`3 \times N` seconds), to ensure that the neighboring routers have received the bad news, even if some distance vectors do not reach them due to transmission errors.
0/4390 · 439
143
../../principles/reliability.rst:458
English
Other more powerful error correction codes have been proposed and are used in some applications. The `Hamming Code <https://en.wikipedia.org/wiki/Hamming_code>`_ is a clever combination of parity bits that provides error detection and correction capabilities.
0/2590 · 259
143
../../principles/transport.rst:767
English
Dynamic receiving window
0/240 · 24
143
../../principles/sharing.rst:684
English
Several other anomalies may occur in a Token Ring network. For example, a station could capture a token and be powered off before having resent the token. Another station could have captured the token, sent its data frame and be powered off before receiving all of its data frame. In this case, the bit string corresponding to the end of a frame would remain in the ring without being removed by its sender. Several techniques are defined in [IEEE802.5]_ to allow the `Monitor` to handle all these problems. If unfortunately, the `Monitor` fails, another station will be elected to become the new `Monitor`.
0/6070 · 607
143
../../protocols/email.rst:256
English
63
0/100 · 2
143
../../protocols/ipv6.rst:453
English
IPv6 fragmentation example
0/260 · 26
143
../../protocols/wifi.rst:22
English
0.9 Mbps
0/100 · 8
143
../../protocols/tcp.rst:428
English
:math:`srtt=(1-\alpha) \times srtt + \alpha \times rtt`
0/550 · 55
144
../../glossary.rst:318
English
A service that enables a user to connect to a distant server over the network. Telnet, defined in :rfc:`854` and the BSD rlogin services defined in :rfc:`1282` were popular in the past. They have been deprecated for security reasons and are now replaced by :term:`ssh`.
0/2690 · 269
144
../../principles/dv.rst:94
English
Consider the example above and assume that the link between routers `A` and `B` fails. Before the failure, `A` used `B` to reach destinations `B`, `C` and `E` while `B` only used the `A-B` link to reach `A`. The two routers detect the failure by the timeouts in the affected entries in their routing tables. Both routers `A` and `B` send their distance vector.
0/3600 · 360
144
../../principles/reliability.rst:461
English
Reliable protocols use error detection schemes, but none of the widely used reliable protocols rely on error correction schemes. To detect errors, a frame is usually divided into two parts :
0/1900 · 190
144
../../principles/transport.rst:769
English
The receiver may adjust its advertised receive window based on its current memory consumption, but also to limit the bandwidth used by the sender. In practice, the receive buffer can also shrink as the application may not able to process the received data quickly enough. In this case, the receive buffer may be completely full and the advertised receive window may shrink to `0`. When the sender receives an acknowledgment with a receive window set to `0`, it is blocked until it receives an acknowledgment with a positive receive window. Unfortunately, as shown in the figure below, the loss of this acknowledgment could cause a deadlock as the sender waits for an acknowledgment while the receiver is waiting for a data segment.
0/7310 · 731
144
../../principles/sharing.rst:688
English
Congestion control
0/180 · 18
144
../../protocols/email.rst:256
English
/
0/100 · 1
144
../../protocols/ipv6.rst:455
English
The following pseudo-code details the IPv6 fragmentation, assuming that the packet does not contain options.
0/1080 · 108
144
../../protocols/wifi.rst:22
English
2 Mbps
0/100 · 6
144
../../protocols/tcp.rst:430
English
:math:`rto=srtt + 4 \times rttvar`
0/340 · 34