Exit Zen
121
../../principles/sharing.rst:590
English
Another problem faced by wireless networks is often called the `hidden station problem`. In a wireless network, radio signals are not always propagated same way in all directions. For example, two devices separated by a wall may not be able to receive each other's signal while they could both be receiving the signal produced by a third host. This is illustrated in the figure below, but it can happen in other environments. For example, two devices that are on different sides of a hill may not be able to receive each other's signal while they are both able to receive the signal sent by a station at the top of the hill. Furthermore, the radio propagation conditions may change with time. For example, a truck may temporarily block the communication between two nearby devices.
0/7810 · 781
121
../../protocols/bgp.rst:432
English
The topology composed of all the directed `customer->provider` peering links is a graph that does not contain any cycle
0/1190 · 119
121
../../protocols/email.rst:250
English
60
0/100 · 2
121
../../protocols/ipv6.rst:405
English
2272 bytes
0/100 · 10
121
../../protocols/ethernet.rst:391
English
Assume that `Switch4` is the first to boot. It sends its own `BPDU = <4,0,4,1>` (resp. `BPDU = <4,0,4,2>`) on port 1 (resp. port 2). When `Switch1` boots, it sends `BPDU = <1,0,1,1>`. This `BPDU` is received by `Switch4`, which updates its `BPDU` and root priority vector tables and computes a new `BPDU = <1,3,4,1>` (resp. `BPDU = <1,3,4,2>`) on port 1 (resp. port 2). Indeed, there is only one root priority vector and hence, it is the best one. Port 1 of `Switch4` becomes the `Root` port while its second port is still in the `Designated` state.
0/5490 · 549
121
../../protocols/tcp.rst:347
English
8590 Gbps
0/100 · 9
122
../../glossary.rst:165
English
NAT
0/100 · 3
122
../../principles/dv.rst:13
English
`R[d].link` is the outgoing link that the router uses to forward packets towards destination `d`
0/960 · 96
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