Exit Zen
157
../../protocols/tcp.rst:512
English
The figure below illustrates the operation of the `fast retransmit` heuristic.
0/780 · 78
158
../../glossary.rst:216
English
Several types of remote procedure calls have been defined. The RPC mechanism defined in :rfc:`5531` is used by applications such as NFS
0/1350 · 135
158
../../principles/transport.rst:828
English
For example, the :manpage:`htonl(3)` (resp. :manpage:`ntohl(3)`) function the standard C library converts a 32-bits unsigned integer from the byte order used by the CPU to the network byte order (resp. from the network byte order to the CPU byte order). Similar functions exist in other programming languages.
0/3090 · 309
158
../../principles/sharing.rst:742
English
The congestion control scheme must `avoid congestion`. In practice, this means that the bottleneck link cannot be overloaded. If :math:`r_i(t)` is the transmission rate allocated to host :math:`i` at time :math:`t` and :math:`R` the bandwidth of the bottleneck link, then the congestion control scheme should ensure that, on average, :math:`\forall{t} \sum{r_i(t)} \le R`.
0/3720 · 372
158
../../protocols/email.rst:262
English
P
0/100 · 1
158
../../protocols/ipv6.rst:533
English
ICMPv6 specifies two classes of messages : error messages that indicate a problem in handling a packet and informational messages. Four types of error messages are defined in :rfc:`4443` :
0/1880 · 188
158
../../protocols/wifi.rst:26
English
2.4/5 GHz
0/100 · 9
158
../../protocols/tcp.rst:518
English
TCP fast retransmit heuristics
0/300 · 30
159
../../glossary.rst:66
English
SDU (Service Data Unit)
0/230 · 23
159
../../principles/dv.rst:167
English
After having detected the failure, router `B` sends its distance vectors:
0/730 · 73
159
../../principles/reliability.rst:579
English
Dealing with corrupted frames
0/290 · 29
159
../../principles/transport.rst:830
English
In the application layer, most servers are implemented as processes. The network and transport layer on the other hand are usually implemented inside the operating system and the amount of memory that they can use is limited by the amount of memory allocated to the entire kernel.
0/2800 · 280
159
../../principles/sharing.rst:743
English
The congestion control scheme must be `efficient`. The bottleneck link is usually both a shared and an expensive resource. Usually, bottleneck links are wide area links that are much more expensive to upgrade than the local area networks. The congestion control scheme should ensure that such links are efficiently used. Mathematically, the control scheme should ensure that :math:`\forall{t} \sum{r_i(t)} \approx R`.
0/4170 · 417
159
../../protocols/email.rst:262
English
32
0/100 · 2
159
../../protocols/ipv6.rst:539
English
``1`` : `Destination Unreachable`. Such an ICMPv6 message is sent when the destination address of a packet is unreachable. The `code` field of the ICMP header contains additional information about the type of unreachability. The following codes are specified in :rfc:`4443`
0/2730 · 273
159
../../protocols/wifi.rst:26
English
74 Mbps
0/100 · 7
159
../../protocols/tcp.rst:523
English
When losses are not isolated or when the windows are small, the performance of the `fast retransmit` heuristic decreases. In such environments, it is necessary to allow a TCP sender to use a selective repeat strategy instead of the default go-back-n strategy. Implementing selective-repeat requires a change to the TCP protocol as the receiver needs to be able to inform the sender of the out-of-order segments that it has already received. This can be done by using the Selective Acknowledgments (SACK) option defined in :rfc:`2018`. This TCP option is negotiated during the establishment of a TCP connection. If both TCP hosts support the option, SACK blocks can be attached by the receiver to the segments that it sends. SACK blocks allow a TCP receiver to indicate the blocks of data that it has received correctly but out of sequence. The figure below illustrates the utilization of the SACK blocks.
0/9040 · 904
160
../../glossary.rst:68
English
a Service Data Unit is the unit information transferred between applications
0/760 · 76
160
../../principles/dv.rst:169
English
:math:`[A=\infty,B=0,C=\infty,E=1]` to router `C`
0/490 · 49
160
../../principles/reliability.rst:581
English
The receiver FSM of the Alternating bit protocol discards all frames that contain an invalid CRC. This is the safest approach since the received frame can be completely different from the frame sent by the remote host. A receiver should not attempt at extracting information from a corrupted frame because it cannot know which portion of the frame has been affected by the error.
0/3790 · 379