Exit Zen
122
../../principles/reliability.rst:419
English
For example, consider a sender that sends `111`. If there is one bit in error, the receiver could receive `011` or `101` or `110`. In these three cases, the receiver will decode the received bit pattern as a `1` since it contains a majority of bits set to `1`. If there are two bits in error, the receiver will not be able anymore to recover from the transmission error.
0/3700 · 370
122
../../principles/transport.rst:670
English
The initiating entity receives the `CA` segment. The acknowledgment number of this segment confirms that the remote entity has correctly received the `CR` segment. The transport connection is considered to be established by the initiating entity and the numbering of the data segments starts at sequence number `x`. Before sending data segments, the initiating entity must acknowledge the received `CA` segments by sending another `CA` segment.
0/4440 · 444
122
../../principles/sharing.rst:597
English
The hidden station problem
0/260 · 26
122
../../protocols/bgp.rst:433
English
An AS always prefers a route received from a `customer` over a route received from a `shared-cost` peer or a `provider`.
0/1200 · 120
122
../../protocols/email.rst:252
English
10
0/100 · 2
122
../../protocols/ipv6.rst:406
English
ATM (AAL5)
0/100 · 10
122
../../protocols/ethernet.rst:393
English
Assume now that `Switch9` boots and immediately receives `Switch1` 's `BPDU` on port 1. `Switch9` computes its own `BPDU = <1,1,9,1>` (resp. `BPDU = <1,1,9,2>`) on port 1 (resp. port 2) and port 1 becomes the `Root` port of this switch. The `BPDU` is sent on port 2 of `Switch9` and reaches `Switch4`. `Switch4` compares the priority vectors. It notices that the last computed vector (i.e., `V[2] = <1,2,9,2,2>`) is better than `V[1] = <1,3,1,1,1>`. Thus, `Switch4`'s `BPDU` is recomputed and port 2 becomes the `Root` port of `Switch4`. `Switch4` compares its new `BPDU = <1,2,4,p>` with the last `BPDU` received on each port (except for the `Root` port). Port 1 becomes a `Blocked` port on `Switch4` because the `BPDU=<1,0,1,1>` received on this port is better.
0/7630 · 763
122
../../protocols/tcp.rst:348
English
859 Gbps
0/100 · 8
123
../../glossary.rst:167
English
A Network Address Translator is a middlebox that translates IP packets.
0/710 · 71
123
../../principles/dv.rst:14
English
`R[d].cost` is the sum of the metrics of the links that compose the shortest path to reach destination `d`
0/1060 · 106
123
../../principles/transport.rst:672
English
The remote entity considers the transport connection to be established after having received the segment that acknowledges its `CA` segment. The numbering of the data segments sent by the remote entity starts at sequence number `y`.
0/2320 · 232
123
../../principles/sharing.rst:603
English
To avoid collisions in these situations, CSMA/CA allows devices to reserve the transmission channel for some time. This is done by using two control frames : `Request To Send` (RTS) and `Clear To Send` (CTS). Both are very short frames to minimize the risk of collisions. To reserve the transmission channel, a device sends a RTS frame to the intended recipient of the data frame. The RTS frame contains the duration of the requested reservation. The recipient replies, after a SIFS delay, with a CTS frame which also contains the duration of the reservation. As the duration of the reservation has been sent in both RTS and CTS, all hosts that could collide with either the sender or the reception of the data frame are informed of the reservation. They can compute the total duration of the transmission and defer their access to the transmission channel until then. This is illustrated in the figure below where host `A` reserves the transmission channel to send a data frame to host `B`. Host `C` notices the reservation and defers its transmission.
0/10530 · 1053
123
../../protocols/bgp.rst:436
English
The first guideline implies that the provider of the provider of `ASx` cannot be a customer of `ASx`. Such a relationship would not make sense from an economic perspective as it would imply circular payments. Furthermore, providers are usually larger than customers.
0/2660 · 266
123
../../protocols/email.rst:252
English
K
0/100 · 1
123
../../protocols/ipv6.rst:406
English
9180 bytes
0/100 · 10
123
../../protocols/ethernet.rst:395
English
During the computation of the spanning tree, switches discard all received data frames, as at that time the network topology is not guaranteed to be loop-free. Once that topology has been stable for some time, the switches again start to use the MAC learning algorithm to forward data frames. Only the `Root` and `Designated` ports are used to forward data frames. Switches discard all the data frames received on their `Blocked` ports and never forward frames on these ports.
0/4760 · 476
123
../../protocols/tcp.rst:349
English
86 Gbps
0/100 · 7
124
../../glossary.rst:310
English
NBMA
0/100 · 4
124
../../principles/dv.rst:15
English
`R[d].time` is the timestamp of the last distance vector containing destination `d`
0/830 · 83
124
../../principles/transport.rst:674
English
The three way handshake is illustrated in the figure below.
0/590 · 59