Exit Zen
101
../../protocols/email.rst:246 • ../../protocols/email.rst:248
English
7
0/100 · 1
101
../../protocols/ethernet.rst:375 • ../../protocols/ethernet.rst:376 • ../../protocols/ethernet.rst:376 • ../../protocols/ethernet.rst:377 • ../../protocols/ethernet.rst:377 • ../../protocols/ethernet.rst:377
English
yes
0/100 · 3
101
../../protocols/ipv6.rst:365
English
`Fragment` header. This option is processed only by hosts.
0/580 · 58
101
../../protocols/ethernet.rst:357
English
20000
0/100 · 5
101
../../protocols/tcp.rst:291
English
An elegant solution to this problem was proposed by John Nagle in :rfc:`896`. John Nagle observed that the overhead caused by the TCP header was a problem in wide area connections, but less in local area connections where the available bandwidth is usually higher. He proposed the following rules to decide to send a new data segment when a new data has been produced by the user or a new `ack` segment has been received.
0/4210 · 421
102
../../glossary.rst:27
English
LAN
0/100 · 3
102
../../principles/network.rst:382
English
`Label switching` enables a full control over the path followed by packets inside the network. Consider the network below and assume that we want to use two virtual circuits : `R1->R3->R4->R2->R5` and `R2->R1->R3->R4->R5`.
0/2220 · 222
102
../../principles/reliability.rst:353
English
The above FSM shows that the sender has to wait for an acknowledgment from the receiver before being able to transmit the next SDU. The figure below illustrates the exchange of a few frames between two hosts.
0/2090 · 209
102
../../principles/transport.rst:559
English
A `segment` also contains control information, usually stored inside a `header` and the payload that comes from the application. To detect transmission errors, transport protocols rely on checksums or CRCs like the datalink layer protocols.
0/2400 · 240
102
../../principles/sharing.rst:472
English
Both hosts retransmit immediately and a new collision occurs
0/600 · 60
102
../../principles/security.rst:997
English
Bob chooses a secret integer : :math:`b`, computes :math:`B= g^{b} \mod p` and sends :math:`Cert(Bob,Bob_{pub},Ted), E_p(Bob_{priv},B)` to Alice
0/1440 · 144
102
../../exercises/ipv6.rst:980
English
When an IPv6 router receives a packet that is larger than the Maximum Transmission Unit (MTU) on its outgoing interface, it drops the packet and returns an ICMPv6 message back to the source. Upon reception of this ICMPv6 message, the source will either adjust the size of the packets that it transmits or use IPv6 packet fragmentation. The exercises below show a few examples of the utilization of IPv6 fragmentation.
0/4170 · 417
102
../../protocols/bgp.rst:398
English
`AS3` sends first `U(2001:db8:1234/48,AS3:AS1)` to `AS4`. `AS4` has learned two routes towards `2001:db8:1234/48`. It runs its BGP decision process and selects the route via `AS3` and does not advertise a route to `AS3`
0/2190 · 219
102
../../protocols/email.rst:246
English
H
0/100 · 1
102
../../protocols/ethernet.rst:375 • ../../protocols/ethernet.rst:375 • ../../protocols/ethernet.rst:376
English
no
0/100 · 2
102
../../protocols/ipv6.rst:366
English
`Authentication` header. This option is processed only by hosts.
0/640 · 64
102
../../protocols/ethernet.rst:358
English
2000
0/100 · 4
102
../../protocols/tcp.rst:303
English
The first rule ensures that a TCP connection used for bulk data transfer always sends full TCP segments. The second rule sends one partially filled TCP segment every round-trip-time.
0/1820 · 182
103
../../glossary.rst:29
English
Local Area Network
0/180 · 18
103
../../principles/reliability.rst:372
English
Services and protocols
0/220 · 22