Exit Zen
139
../../glossary.rst:53
English
Problem-based learning is a teaching approach that relies on problems.
0/700 · 70
139
../../principles/dv.rst:77
English
`A` sends its distance vector `[A=0,B=1,C=2,D=1,E=2]` to `B` and `D`.
0/690 · 69
139
../../principles/reliability.rst:441
English
The parity bit allows a receiver to detect transmission errors that have affected a single bit among the transmitted `N+r` bits. If there are two or more bits in error, the receiver may not necessarily be able to detect the transmission error. More powerful error detection schemes have been defined. The Cyclical Redundancy Checks (CRC) are widely used in datalink layer protocols. An N-bits CRC can detect all transmission errors affecting a burst of less than N bits in the transmitted frame and all transmission errors that affect an odd number of bits. Additional details about CRCs may be found in [Williams1993]_.
0/6200 · 620
139
../../principles/sharing.rst:669
English
802.5 data frame format
0/230 · 23
139
../../protocols/bgp.rst:486
English
90 seconds is the default delay recommended by :rfc:`4271`. However, two BGP peers can negotiate a different timer during the establishment of their BGP session. Using a too small interval to detect BGP session failures is not recommended. BFD [KW2009]_ can be used to replace BGP's KEEPALIVE mechanism if fast detection of interdomain link failures is required.
0/3620 · 362
139
../../protocols/email.rst:256
English
29
0/100 · 2
139
../../protocols/ipv6.rst:438
English
the `More` flag, which is set to `0` in the last fragment of a packet and to `1` in all other fragments.
0/1040 · 104
139
../../protocols/wifi.rst:19
English
Max bandwidth
0/130 · 13
139
../../protocols/tcp.rst:409
English
However, in practice, this computation for the retransmission timeout did not work well. The main problem was that the computed `rto` did not correctly take into account the variations in the measured round-trip-time. `Van Jacobson` proposed in his seminal paper [Jacobson1988]_ an improved algorithm to compute the `rto` and implemented it in the BSD Unix distribution. This algorithm is now part of the TCP standard :rfc:`2988`.
0/4300 · 430
140
../../glossary.rst:192 • ../../glossary.rst:256
English
POP
0/100 · 3
140
../../principles/dv.rst:79
English
At this point, all routers can reach all other routers in the network thanks to the routing tables shown in the figure below.
0/1250 · 125
140
../../principles/reliability.rst:443
English
It is also possible to design a code that allows the receiver to correct transmission errors. The simplest `error correction code` is the triple modular redundancy (TMR). To transmit a bit set to `1` (resp. `0`), the sender transmits `111` (resp. `000`). When there are no transmission errors, the receiver can decode `111` as `1`. If transmission errors have affected a single bit, the receiver performs majority voting as shown in the table below. This scheme allows the receiver to correct all transmission errors that affect a single bit.
0/5420 · 542
140
../../principles/transport.rst:757
English
`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.
0/3570 · 357
140
../../principles/sharing.rst:672
English
To capture a token, a station must operate in `Listen` mode. In this mode, the station receives bits from its upstream neighbor. If the bits correspond to a data frame, they must be forwarded to the downstream neighbor. If they correspond to a token, the station can capture it and transmit its data frame. Both the data frame and the token are encoded as a bit string beginning with the `Starting Delimiter` followed by the `Access Control` field. When the station receives the first bit of a `Starting Delimiter`, it cannot know whether this is a data frame or a token and must forward the entire delimiter to its downstream neighbor. It is only when it receives the fourth bit of the `Access Control` field (i.e. the `Token` bit) that the station knows whether the frame is a data frame or a token. If the `Token` bit is reset, it indicates a data frame and the remaining bits of the data frame must be forwarded to the downstream station. Otherwise (`Token` bit is set), this is a token and the station can capture it by resetting the bit that is currently in its buffer. Thanks to this modification, the beginning of the token is now the beginning of a data frame and the station can switch to `Transmit` mode and send its data frame starting at the fifth bit of the `Access Control` field. Thus, the one-bit delay introduced by each Token Ring station plays a key role in enabling the stations to efficiently capture the token.
0/14330 · 1433
140
../../protocols/bgp.rst:488
English
A link is said to be flapping if it switches several times between an operational state and a disabled state within a short period of time. A router attached to such a link would need to frequently send routing messages.
0/2200 · 220
140
../../protocols/email.rst:256
English
d
0/100 · 1
140
../../protocols/ipv6.rst:439
English
the 32-bit `Identification` field indicates to which original packet a fragment belongs. When a host sends fragmented packets, it should ensure that it does not reuse the same `identification` field for packets sent to the same destination during a period of `MSL` seconds. This is easier with the 32 bits `identification` used in the IPv6 fragmentation header, than with the 16 bits `identification` field of the IPv4 header.
0/4260 · 426
140
../../protocols/wifi.rst:19
English
Range (m) indoor/outdoor
0/240 · 24
140
../../protocols/tcp.rst:411
English
Jacobson's algorithm uses two state variables, `srtt` the smoothed `rtt` and `rttvar` the estimation of the variance of the `rtt` and two parameters : :math:`\alpha` and :math:`\beta`. When a TCP connection starts, the first `rto` is set to `3` seconds. When a first estimation of the `rtt` is available, the `srtt`, `rttvar` and `rto` are computed as follows :
0/3610 · 361
141
../../principles/reliability.rst:446
English
Received bits
0/130 · 13