Exit Zen
137
../../principles/reliability.rst:437 • ../../principles/reliability.rst:454
English
101
0/100 · 3
137
../../principles/sharing.rst:658
English
Let us consider the five station network depicted in figure :ref:`fig-tokenring` above and assume that station `S1` sends a token. If we neglect the propagation delay on the inter-station links, as each station introduces a one bit delay, the first bit of the frame would return to `S1` while it sends the fifth bit of the token. If station `S1` is powered off at that time, only the first five bits of the token will travel on the ring. To avoid this problem, there is a special station called the `Monitor` on each Token Ring. To ensure that the token can travel forever on the ring, this `Monitor` inserts a delay that is equal to at least 24 bit transmission times. If station `S3` was the `Monitor` in figure :ref:`fig-tokenring`, `S1` would have been able to transmit the entire token before receiving the first bit of the token from its upstream neighbor.
0/8620 · 862
137
../../protocols/bgp.rst:482
English
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.
0/1650 · 165
137
../../protocols/email.rst:256
English
12
0/100 · 2
137
../../protocols/ipv6.rst:436
English
two `Reserved` fields set to `0`.
0/330 · 33
137
../../protocols/wifi.rst:19
English
Frequency
0/100 · 9
137
../../protocols/tcp.rst:406
English
`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)
0/2470 · 247
138
../../glossary.rst:51
English
PBL
0/100 · 3
138
../../principles/dv.rst:76
English
`B` sends its distance vector `[B=0,A=1,C=1,D=2,E=1]` to `A`, `C` and `E`. `A`, `B`, `C` and `E` can now reach all five routers of this network.
0/1440 · 144
138
../../principles/reliability.rst:438 • ../../principles/reliability.rst:455
English
011
0/100 · 3
138
../../principles/transport.rst:738
English
Using sequence numbers to count bytes has also one advantage when the transport layer needs to fragment SDUs in several segments. The figure below shows the fragmentation of a large SDU in two segments. Upon reception of the segments, the receiver will use the sequence numbers to correctly reorder the data.
0/3080 · 308
138
../../protocols/bgp.rst:484
English
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.
0/2990 · 299
138
../../protocols/email.rst:256
English
M
0/100 · 1
138
../../protocols/ipv6.rst:437
English
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.
0/1750 · 175
138
../../protocols/wifi.rst:19
English
Typical throughput
0/180 · 18
138
../../protocols/tcp.rst:407
English
`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.
0/3030 · 303
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