Exit Zen
61
../../principles/reliability.rst:228
English
For example, consider the transmission of `0110111111111111111110010`. The sender will first send the `01111110` marker followed by `011011111`. After these five consecutive bits set to `1`, it inserts a bit set to `0` followed by `11111`. A new `0` is inserted, followed by `11111`. A new `0` is inserted followed by the end of the frame `110010` and the `01111110` marker.
0/3740 · 374
61
../../principles/transport.rst:205
English
the `connectionless network layer service` may corrupt SDUs
0/590 · 59
61
../../principles/sharing.rst:254
English
Now that we have provided a broad overview of the techniques that can be used to spread the load and allocate resources in the network, let us analyze two techniques in more details : Medium Access Control and Congestion control.
0/2290 · 229
61
../../principles/security.rst:705
English
In the above example, Alice sends her public key, (:math:`Alice_{pub}`), in her first message together with her identity. Mallory intercepts the message and replaces Alice's key with his own key, (:math:`Mallory_{pub}`). Bob replies with a nonce, `R`. Alice then signs the random nonce to prove that she knows :math:`Alice_{priv}`. Mallory discards the information and instead computes :math:`E_p(Mallory_{priv},R)`. Bob now thinks that he is discussing with Alice while Mallory sits in the middle.
0/4980 · 498
61
../../exercises/ipv6.rst:592
English
Then, you need to extend the build method that creates routers and hosts.
0/730 · 73
61
../../exercises/routing-protocols.rst:854
English
We also add a ``post_build`` method to launch tcpdump_ and capture the BGP packets exchanged by the routers. A BGP session runs over a TCP connection. Let us examine a few of the BGP messages exchanged on the BGP session between ``AS1`` and ``AS2``. The traces collected on the three routers are available from :download:`/exercises/traces/bgp-as1-trace.pcap`, :download:`/exercises/traces/bgp-as2-trace.pcap` and :download:`/exercises/traces/bgp-as2-trace.pcap`.
0/4630 · 463
61
../../exercises/tcp-2.rst:832
English
Redraw the same figure assuming that the second segment that was delivered by the sender in the figure experienced congestion. In a network that uses Explicit Congestion Notification, this segment would be marked by routers and the receiver would return the congestion mark in the corresponding acknowledgment.
0/3100 · 310
61
../../protocols/bgp.rst:263
English
If the import filter accepts the BGP message, the pseudo-code distinguishes two cases. If this is an `Update message` for prefix `p`, this can be a new route for this prefix or a modification of the route's attributes. The router first retrieves from its `RIB` the best route towards prefix `p`. Then, the new route is inserted in the `RIB` and the `BGP decision process` is run to find whether the best route towards destination `p` changes. A BGP message only needs to be sent to the router's peers if the best route has changed. For each peer, the router applies the `export filter` to verify whether the route can be advertised. If yes, the filtered BGP message is sent. Otherwise, a `Withdraw message` is sent. When the router receives a `Withdraw message`, it also verifies whether the removal of the route from its `RIB` caused its best route towards this prefix to change. It should be noted that, depending on the content of the `RIB` and the `export filters`, a BGP router may need to send a `Withdraw message` to a peer after having received an `Update message` from another peer and conversely.
0/11070 · 1107
61
../../protocols/email.rst:234
English
18
0/100 · 2
61
../../protocols/ethernet.rst:287
English
Security issues with Ethernet hubs and switches
0/470 · 47
61
../../protocols/http.rst:216
English
HTTP was initially designed to share text documents. For this reason, and to ease the implementation of clients and servers, the designers of HTTP chose to open a TCP connection for each HTTP request. This implies that a client must open one TCP connection for each URI that it wants to retrieve from a server as illustrated on the figure below, showing HTTP 1.0 and the underlying TCP connection. For a web page containing only text documents this was a reasonable design choice as the client usually remains idle while the (human) user is reading the retrieved document.
0/5720 · 572
61
../../protocols/ipv6.rst:214
English
With the longest match rule, the route ``::/0`` plays a particular role. As this route has a prefix length of `0` bits, it matches all destination addresses. This route is often called the `default` route.
0/2050 · 205
61
../../protocols/ethernet.rst:180
English
40-100 Gbps
0/110 · 11
61
../../protocols/tcp.rst:None
English
Retransmitting the first `SYN` segment
0/380 · 38
61
../../protocols/tls.rst:329
English
A TLS record is always composed of four different fields :
0/580 · 58
62
../../bibliography.rst:359
English
Zheng, X., `Phishing with Unicode Domains <https://www.xudongz.com/blog/2017/idn-phishing/>`_, April 14, 2017, https://www.xudongz.com/blog/2017/idn-phishing/
0/1580 · 158
62
../../glossary.rst:168
English
iBGP
0/100 · 4
62
../../principles/reliability.rst:231
English
`Bit stuffing` increases the number of bits required to transmit each frame. The worst case for bit stuffing is of course a long sequence of bits set to `1` inside the frame. If transmission errors occur, stuffed bits or markers can be in error. In these cases, the frame affected by the error and possibly the next frame will not be correctly decoded by the receiver, but it will be able to resynchronize itself at the next valid marker.
0/4380 · 438
62
../../principles/transport.rst:206
English
the `connectionless network layer service` may delay, reorder or even duplicate SDUs
0/840 · 84
62
../../principles/sharing.rst:260
English
Medium Access Control algorithms
0/320 · 32