Exit Zen
146
../../principles/sharing.rst:694
English
To understand this problem better, let us consider the scenario shown in the figure below, where a server (`A`) attached to a `10 Mbps` link needs to reliably transfer segments to another computer (`C`) through a path that contains a `2 Mbps` link.
0/2480 · 248
146
../../protocols/email.rst:258
English
N
0/100 · 1
146
../../protocols/ipv6.rst:492
English
The fragments of an IPv6 packet may arrive at the destination in any order, as each fragment is forwarded independently in the network and may follow different paths. Furthermore, some fragments may be lost and never reach the destination.
0/2390 · 239
146
../../protocols/wifi.rst:23
English
802.11a
0/100 · 7
146
../../protocols/tcp.rst:439
English
Example computation of the `rto`
0/320 · 32
147
../../glossary.rst:138
English
RIP
3/100 · 3
147
../../principles/dv.rst:98
English
`B` sends its distance vector :math:`[B=0,A=\infty,C=1,D=2,E=1]` to `E` and `C`. `C` learns that there is no route anymore to reach `A` via `B`.
0/1440 · 144
147
../../principles/reliability.rst:466
English
Some headers also include a `length` field, which indicates the total length of the frame or the length of the payload.
0/1190 · 119
147
../../principles/transport.rst:782
English
To conclude our description of the basic mechanisms found in transport protocols, we still need to discuss the impact of segments arriving in the wrong order. If two consecutive segments are reordered, the receiver relies on their sequence numbers to reorder them in its receive buffer. Unfortunately, as transport protocols reuse the same sequence number for different segments, if a segment is delayed for a prolonged period of time, it might still be accepted by the receiver. This is illustrated in the figure below where segment `D(1,b)` is delayed.
0/5540 · 554
147
../../protocols/email.rst:258
English
30
0/100 · 2
147
../../protocols/ipv6.rst:494
English
The reassembly algorithm used by the destination host is roughly as follows. First, the destination can verify whether a received IPv6 packet is a fragment or not by checking whether it contains a fragment header. If so, all fragments with the some identification must be reassembled together. The reassembly algorithm relies on the `Identification` field of the received fragments to associate a fragment with the corresponding packet being reassembled. Furthermore, the `Fragment Offset` field indicates the position of the fragment payload in the original non-fragmented packet. Finally, the packet with the `M` flag reset allows the destination to determine the total length of the original non-fragmented packet.
0/7170 · 717
147
../../protocols/wifi.rst:23
English
5 GHz
0/100 · 5
147
../../protocols/tcp.rst:443
English
Advanced retransmission strategies
0/340 · 34
148
../../glossary.rst:140
English
Routing Information Protocol. An intradomain routing protocol based on distance vectors that is sometimes used in enterprise networks. RIP is defined in :rfc:`2453`.
0/1650 · 165
148
../../principles/dv.rst:99
English
`E` sends its distance vector :math:`[E=0,A=2,C=1,D=1,B=1]` to `D`, `B` and `C`. `D` learns a route towards `B`. `C` and `B` learn a route towards `A`.
0/1510 · 151
148
../../principles/reliability.rst:468
English
The simplest error detection scheme is the checksum. A checksum is basically an arithmetic sum of all the bytes that a frame is composed of. There are different types of checksums. For example, an eight bit checksum can be computed as the arithmetic sum of all the bytes of (both the header and trailer of) the frame. The checksum is computed by the sender before sending the frame and the receiver verifies the checksum upon frame reception. The receiver discards frames received with an invalid checksum. Checksums can be easily implemented in software, but their error detection capabilities are limited. Cyclical Redundancy Checks (CRC) have better error detection capabilities [SGP98]_, but require more CPU when implemented in software.
0/7420 · 742
148
../../principles/transport.rst:789
English
Ambiguities caused by excessive delays
0/380 · 38
148
../../principles/sharing.rst:702
English
In this network, the segments sent by the server reach router `R1`. `R1` forwards the segments towards router `R2`. Router `R1` can potentially receive segments at `10 Mbps`, but it can only forward them at `2 Mbps` to router `R2` and then to host `C`. Router `R1` includes buffers that allow it to store the packets that cannot immediately be forwarded to their destination. To understand the operation of a reliable transport protocol in this environment, let us consider a simplified model of this network where host `A` is attached to a `10 Mbps` link to a queue that represents the buffers of router `R1`. This queue is emptied at a rate of `2 Mbps`.
0/6560 · 656
148
../../protocols/email.rst:258
English
e
0/100 · 1
148
../../protocols/ipv6.rst:496
English
Note that the reassembly algorithm must deal with the unreliability of the IP network. This implies that a fragment may be duplicated or a fragment may never reach the destination. The destination can easily detect fragment duplication thanks to the `Fragment Offset`. To deal with fragment losses, the reassembly algorithm must bind the time during which the fragments of a packet are stored in its buffer while the packet is being reassembled. This can be implemented by starting a timer when the first fragment of a packet is received. If the packet has not been reassembled upon expiration of the timer, all fragments are discarded and the packet is considered to be lost.
0/6760 · 676