Exit Zen
58
../../bibliography.rst:350
English
Williams, R. `A painless guide to CRC error detection algorithms`, August 1993, unpublished manuscript, https://web.archive.org/web/20060101004751/http://www.ross.net/crc/download/crc_v3.txt
0/1900 · 190
58
../../glossary.rst:180
English
hub
0/100 · 3
58
../../principles/network.rst:257
English
The last, but important, point to discuss about the `data plane` of the networks that rely on the datagram mode is their addressing scheme. In the examples above, we have used letters to represent the addresses of the hosts and network nodes. In practice, all addresses are encoded as a bit string. Most network technologies use a fixed size bit string to represent source and destination address. These addresses can be organized in two different ways.
0/4530 · 453
58
../../principles/reliability.rst:223
English
01111110011011111011111011111011001001111110
0/440 · 44
58
../../principles/transport.rst:201
English
As the transport layer is built on top of the network layer, it is important to know the key features of the network layer service. In this book, we only consider the `connectionless network layer service` which is the most widespread. Its main characteristics are :
0/2660 · 266
58
../../principles/sharing.rst:241
English
Based on the feedback received from the network, the hosts can adjust their transmission rate. We discuss in section `Congestion control` some techniques that allow hosts to react to congestion.
0/1940 · 194
58
../../principles/security.rst:634
English
A drawback of this approach is that Bob is forced to perform two public key computations : one encryption to send the random nonce to Alice and one decryption to recover the nonce encrypted by Alice. If these computations are costly from a CPU viewpoint, this creates a risk of Denial of Service Attacks were attackers could try to access Bob's computer and force it to perform such costly computations. Bob is more at risk than Alice in this situation and he should not perform complex operations before being sure that he is talking with Alice. An alternative is shown in the time sequence diagram below.
0/6060 · 606
58
../../exercises/ipv6.rst:533
English
The syntax of IPMininet_ is relatively simple and can be learned by looking at a few examples.
0/940 · 94
58
../../exercises/routing-protocols.rst:841
English
the eBGP session with ``fe80::c001:dcff:fe49:a512`` with an AS-Path of ``AS2`` (see last column)
0/960 · 96
58
../../exercises/tcp-2.rst:738
English
Assuming that there are no losses and that there is no congestion in the network. If the sender writes `x` bytes on a newly established TCP connection, derive a formula that computes the minimum time required to deliver all these `x` bytes to the receiver. For the derivation of this formula, assume that `x` is a multiple of the maximum segment size and that the receive window and the slow-start threshold are larger than `x`.
0/4280 · 428
58
../../protocols/bgp.rst:237
English
When a BGP message is received, the router first applies the peer's `import filter` to verify whether the message is acceptable or not. If the message is not acceptable, the processing stops. The pseudo-code below shows a simple `import filter`. This `import filter` accepts all routes, except those that already contain the local AS in their AS-Path. If such a route was used, it would cause a routing loop. Another example of an `import filter` would be a filter used by an Internet Service Provider on a session with a customer to only accept routes towards the IP prefixes assigned to the customer by the provider. On real routers, `import filters` can be much more complex and some `import filters` modify the attributes of the received BGP `UPDATE` [WMS2004]_ .
0/7670 · 767
58
../../protocols/email.rst:232
English
z
0/100 · 1
58
../../protocols/ethernet.rst:255
English
Operation of Ethernet switches
0/300 · 30
58
../../protocols/http.rst:192
English
In both HTTP requests and responses, the MIME document refers to a representation of the document with the MIME headers indicating the type of document and its size.
0/1650 · 165
58
../../protocols/ipv6.rst:196
English
The Belnet network advertises prefix ``2001:6a8::/32`` that includes the prefixes from both UCLouvain and ULg. These two subnetworks can be easily reached from any internet connected host. After a few years, UCLouvain decides to increase the redundancy of its Internet connectivity and buys transit service from ISP1. A direct link between UCLouvain and the commercial ISP appears on the network and UCLouvain expects to receive packets from both Belnet and the commercial ISP.
0/4770 · 477
58
../../protocols/ethernet.rst:178
English
Two multi-mode or single mode optical fibers with lasers
0/560 · 56
58
../../protocols/routing.rst:178
English
In some networks, there are several dozens of paths towards a given destination. Some routers, due to hardware limitations, cannot install more than 8 or 16 paths in their forwarding table. In this case, a subset of the computed paths is installed in the forwarding table.
0/2720 · 272
58
../../protocols/tcp.rst:202
English
the high order bits contain the low order bits of a counter that is incremented slowly
0/860 · 86
58
../../protocols/tls.rst:313
English
The TLS record protocol
0/230 · 23
59
../../bibliography.rst:353
English
ITU-T, recommendation X.200, `Open Systems Interconnection - Model and Notation <http://www.itu.int/rec/T-REC-X.200-199407-I/en>`_, 1994
0/1360 · 136