Exit Zen
173
../../protocols/tcp.rst:561
English
When an `RST` segment is sent by a TCP entity, it should contain the current value of the `sequence number` for the connection (or 0 if it does not belong to any existing connection) and the `acknowledgment number` should be set to the next expected in-sequence `sequence number` on this connection.
0/2990 · 299
174
../../glossary.rst:303
English
For DNS servers and resolvers, a standard query is a query for a `A` or a `AAAA` record. Such a query typically returns an IP address.
0/1340 · 134
174
../../principles/reliability.rst:722
English
Utilisation of the sliding window with modulo arithmetic
0/560 · 56
174
../../principles/sharing.rst:783
English
:math:`rate(t+1)=\alpha_N + \beta_N rate(t)` when the network is *not* congested
0/800 · 80
174
../../protocols/email.rst:274 • ../../protocols/email.rst:293 • ../../protocols/email.rst:307
English
6-bit
0/100 · 5
174
../../protocols/ipv6.rst:578
English
ICMPv6 is used by TCP implementations to discover the largest MTU size that is allowed to reach a destination host without causing network fragmentation. A TCP implementation parses the `Packets Too Big` ICMP messages that it receives. These ICMP messages contain the MTU of the router's outgoing link in their `Data` field. Upon reception of such an ICMP message, the source TCP implementation adjusts its Maximum Segment Size (MSS) so that the packets containing the segments that it sends can be forwarded by this router without requiring fragmentation.
0/5560 · 556
174
../../protocols/wifi.rst:115
English
IEEE 802.11 ACK and CTS frames
0/300 · 30
174
../../protocols/tcp.rst:563
English
TCP `RST` wars
0/140 · 14
175
../../glossary.rst:177
English
switch
0/100 · 6
175
../../principles/linkstate.rst:33
English
Once a router has discovered its neighbors, it must reliably distribute all its outgoing edges to all routers in the network to allow them to compute their local view of the network topology. For this, each router builds a `link-state packet` (LSP) containing the following information:
0/2860 · 286
175
../../principles/reliability.rst:727
English
Unfortunately, frame losses do not disappear because a reliable protocol uses a sliding window. To recover from losses, a sliding window protocol must define :
0/1590 · 159
175
../../principles/sharing.rst:785
English
With a linear adaption algorithm, :math:`\alpha_C,\alpha_N, \beta_C` and :math:`\beta_N` are constants. The analysis of [CJ1989]_ shows that to be fair and efficient, such a binary rate adaption mechanism must rely on `Additive Increase and Multiplicative Decrease`. When the network is not congested, the hosts should slowly increase their transmission rate (:math:`\beta_N=1~and~\alpha_N>0`). When the network is congested, the hosts must multiplicatively decrease their transmission rate (:math:`\beta_C < 1~and~\alpha_C = 0`). Such an AIMD rate adaptation algorithm can be implemented by the pseudo-code below.
0/6140 · 614
175
../../protocols/email.rst:274
English
000101 001111 101110 011100 000000 111101 100101 111110
0/560 · 56
175
../../protocols/ipv6.rst:583
English
Two types of informational ICMPv6 messages are defined in :rfc:`4443` : `echo request` and `echo reply`, which are used to test the reachability of a destination by using :manpage:`ping6(8)`. Each host is supposed [#fpingproblems]_ to reply with an ICMP `Echo reply` message when it receives an ICMP `Echo request` message. A sample usage of :manpage:`ping6(8)` is shown below.
0/3780 · 378
175
../../protocols/wifi.rst:120
English
802.11 RTS/CTS frames are used to reserve the transmission channel, in order to transmit one data frame and its acknowledgment. The RTS frames contain a `Duration` and the transmitter and receiver addresses. The `Duration` field of the RTS frame indicates the duration of the entire reservation (i.e. the time required to transmit the CTS, the data frame, the acknowledgments and the required SIFS delays). The CTS frame has the same format as the acknowledgment frame.
0/4690 · 469
175
../../protocols/tcp.rst:567
English
The designers of TCP implementations should ensure that two TCP entities never enter a TCP `RST` war where host `A` is sending a `RST` segment in response to a previous `RST` segment that was sent by host `B` in response to a TCP `RST` segment sent by host `A` ... To avoid such an infinite exchange of `RST` segments that do not carry data, a TCP entity is *never* allowed to send a `RST` segment in response to another `RST` segment.
0/4350 · 435
176
../../glossary.rst:179
English
A relay operating in the datalink layer.
0/400 · 40
176
../../principles/linkstate.rst:35
English
LSP.Router: identification (address) of the sender of the LSP
0/610 · 61
176
../../principles/reliability.rst:729
English
a heuristic to detect frame losses
0/340 · 34
176
../../principles/sharing.rst:799
English
Which binary feedback ?
0/230 · 23