Exit Zen
97
../../principles/reliability.rst:339
English
These two types of frames can be distinguished by dividing the frame in two parts :
0/830 · 83
97
../../principles/transport.rst:548
English
Connectionless transport
0/240 · 24
97
../../principles/sharing.rst:449
English
Removing acknowledgments is an interesting optimization as it reduces the number of frames that are exchanged on the network and the number of frames that need to be processed by the hosts. However, to use this optimization, we must ensure that all hosts will be able to detect all the collisions that affect their frames. The problem is important for short frames. Let us consider two hosts, A and B, that are sending a small frame to host C as illustrated in the figure below. If the frames sent by A and B are very short, the situation illustrated below may occur. Hosts A and B send their frame and stop transmitting (point `(1)`). When the two short frames arrive at the location of host C, they collide and host C cannot decode them (point `(2)`). The two frames are absorbed by the ends of the wire. Neither host A nor host B have detected the collision. They both consider their frame to have been received correctly by its destination.
0/9440 · 944
97
../../principles/security.rst:980
English
Alice computes :math:`S_{A}=M^{a} \mod p` and uses this key to communicate with Mallory (acting as Bob)
0/1030 · 103
97
../../exercises/ipv6.rst:933
English
To debug this problem, let us look at the forwarding table of ``r3``. This router forwards the packets sent to host ``a`` to router ``r1`` that is directly connected to host ``a``.
0/1800 · 180
97
../../protocols/bgp.rst:379
English
Consider in this internetwork the routes available inside `AS1` to reach `AS5`. `AS1` learns the `AS4:AS6:AS7:AS5` path from `AS4`, the `AS3:AS8:AS5` path from `AS3` and the `AS2:AS5` path from `AS2`. The first path is chosen since it was learned from a customer. `AS5` on the other hand receives three paths towards `AS1` via its providers. It may select any of these paths to reach `AS1` , depending on how it prefers one provider over the others.
0/4490 · 449
97
../../protocols/email.rst:244
English
X
0/100 · 1
97
../../protocols/ethernet.rst:373
English
Receives BPDUs
0/140 · 14
97
../../protocols/ipv6.rst:360
English
:rfc:`2460` defines several types of IPv6 extension headers that could be added to an IPv6 packet :
0/990 · 99
97
../../protocols/ethernet.rst:355
English
2000000
0/100 · 7
97
../../protocols/tcp.rst:276
English
To send new data on an established connection, a TCP entity performs the following operations on the corresponding TCB. It first checks that the `sending buffer` does not contain more data than the receive window advertised by the remote host (`rcv.wnd`). If the window is not full, up to `MSS` bytes of data are placed in the payload of a TCP segment. The `sequence number` of this segment is the sequence number of the first byte of the payload. It is set to the first available sequence number : `snd.nxt` and `snd.nxt` is incremented by the length of the payload of the TCP segment. The `acknowledgment number` of this segment is set to the current value of `rcv.nxt` and the `window` field of the TCP segment is computed based on the current occupancy of the `receiving buffer`. The data is kept in the `sending buffer` in case it needs to be retransmitted later.
0/8680 · 868
98
../../glossary.rst:39
English
ITU
0/100 · 3
98
../../principles/network.rst:375
English
West
0/100 · 4
98
../../principles/reliability.rst:341
English
the `header` that contains one bit set to `0` in data frames and set to `1` in control frames
0/930 · 93
98
../../principles/transport.rst:550
English
The simplest service that can be provided in the transport layer is the connectionless transport service. Compared to the connectionless network layer service, this transport service includes two additional features :
0/2170 · 217
98
../../principles/sharing.rst:456
English
The short-frame collision problem
0/330 · 33
98
../../principles/security.rst:981
English
Bob computes :math:`S_{B}=M^{b} \mod p` and uses this key to communicate with Mallory (acting as Alice)
0/1030 · 103
98
../../exercises/ipv6.rst:946
English
Unfortunately, when router ``r1`` sends its ICMP HopLimit exceeded message, the destination of this IP packet is ``2001:db8:1341:3::b``. This packet is forward to router ``r2`` that returns the packet back to router ``r1``. The packet loops between the two routers until their HopLimit reaches zero.
0/2990 · 299
98
../../protocols/bgp.rst:384
English
BGP convergence
0/150 · 15
98
../../protocols/email.rst:244
English
40
0/100 · 2