Exit Zen
161
../../principles/transport.rst:834
English
For a discussion on how the sending buffer can change, see e.g. [SMM1998]_
0/740 · 74
161
../../principles/sharing.rst:746
English
no link in the network is congested
0/350 · 35
161
../../protocols/email.rst:262
English
49
0/100 · 2
161
../../protocols/ipv6.rst:536
English
``0`` : No route to destination. This indicates that the router that sent the ICMPv6 message did not have a route towards the packet's destination
0/1460 · 146
161
../../protocols/wifi.rst:26
English
70/250
0/100 · 6
161
../../protocols/tcp.rst:531
English
A SACK option contains one or more blocks. A block corresponds to all the sequence numbers between the `left edge` and the `right edge` of the block. The two edges of the block are encoded as 32 bit numbers (the same size as the TCP sequence number) in an SACK option. As the SACK option contains one byte to encode its type and one byte for its length, a SACK option containing `b` blocks is encoded as a sequence of :math:`2+8 \times b` bytes. In practice, the size of the SACK option can be problematic as the optional TCP header extension cannot be longer than 40 bytes. As the SACK option is usually combined with the :rfc:`1323` timestamp extension, this implies that a TCP segment cannot usually contain more than three SACK blocks. This limitation implies that a TCP receiver cannot always place in the SACK option that it sends, information about all the received blocks.
0/8800 · 880
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/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
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
../../protocols/email.rst:262
English
x
0/100 · 1
162
../../protocols/ipv6.rst:537
English
``1`` : Communication with destination administratively prohibited. This indicates that a firewall has refused to forward the packet towards its final destination.
0/1630 · 163
162
../../protocols/wifi.rst:29
English
When developing its family of standards, the `IEEE 802.11 working group <http://www.ieee802.org/11/>`_ took a similar approach as the `IEEE 802.3 working group <http://www.ieee802.org/3/>`_ that developed various types of physical layers for Ethernet networks. 802.11 networks use the CSMA/CA Medium Access Control technique described earlier and they all assume the same architecture and use the same frame format.
0/4150 · 415
162
../../protocols/tcp.rst:533
English
To deal with the limited size of the SACK option, a TCP receiver currently having more than 3 blocks inside its receiving buffer must select the blocks to place in the SACK option. A good heuristic is to put in the SACK option the blocks that have most recently changed, as the sender is likely to be already aware of the older blocks.
0/3350 · 335
163
../../glossary.rst:189
English
SMTP
0/100 · 4
163
../../principles/dv.rst:177
English
Forwarding tables versus routing tables
0/390 · 39
163
../../principles/transport.rst:838
English
In reality, the Internet does not strictly enforce this MSL. However, it is reasonable to expect that most packets on the Internet will not remain in the network during more than 2 minutes. There are a few exceptions to this rule, such as :rfc:`1149` whose implementation is described in http://www.blug.linux.no/rfc1149/ but there are few real links supporting :rfc:`1149` in the Internet.
0/3900 · 390
163
../../principles/sharing.rst:749
English
Depending on the network, a `max-min fair allocation` may not always exist. In practice, `max-min fairness` is an ideal objective that cannot necessarily be achieved. When there is a single bottleneck link as in the example above, `max-min fairness` implies that each source should be allocated the same transmission rate.
0/3220 · 322
163
../../protocols/email.rst:264
English
16
0/100 · 2
163
../../protocols/ipv6.rst:538
English
``2`` : Beyond scope of source address. This message can be sent if the source is using link-local addresses to reach a global unicast address outside its subnet.
0/1620 · 162