Exit Zen
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
../../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
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/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
../../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
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
160
../../principles/sharing.rst:744
English
The congestion control scheme should be `fair`. Most congestion schemes aim at achieving `max-min fairness`. An allocation of transmission rates to sources is said to be `max-min fair` if :
0/1890 · 189
161
../../glossary.rst:60
English
segment
0/100 · 7
161
../../principles/dv.rst:170
English
:math:`[A=\infty,B=0,C=1,E=\infty]` to router `E`
0/490 · 49
161
../../principles/reliability.rst:584
English
The figure below illustrates the operation of the alternating bit protocol.
0/750 · 75
161
../../principles/sharing.rst:746
English
no link in the network is congested
0/350 · 35
161
../../principles/transport.rst:834
English
For a discussion on how the sending buffer can change, see e.g. [SMM1998]_
0/740 · 74
162
../../glossary.rst:62
English
a segment is the unit of information transfer in the transport layer
0/680 · 68
162
../../principles/dv.rst:172
English
If, unfortunately, the distance vector sent to router `C` is lost due to a transmission error or because router `C` is overloaded, a new count to infinity problem can occur. If router `C` sends its distance vector :math:`[A=2,B=1,C=0,E=\infty]` to router `E`, this router installs a route of distance `3` to reach `A` via `C`. Router `E` sends its distance vectors :math:`[A=3,B=\infty,C=1,E=1]` to router `B` and :math:`[A=\infty,B=1,C=\infty,E=0]` to router `C`. This distance vector allows `B` to recover a route of distance `4` to reach `A`.
0/5450 · 545
162
../../principles/sharing.rst:747
English
the rate allocated to source :math:`j` cannot be increased without decreasing the rate allocated to a source :math:`i` whose allocation is smaller than the rate allocated to source :math:`j` [Leboudec2008]_ .
0/2080 · 208
162
../../principles/transport.rst:836
English
Note that if the receive window shrinks, it might happen that the sender has already sent a segment that is not anymore inside its window. This segment will be discarded by the receiver and the sender will retransmit it later.
0/2260 · 226