Exit Zen
37
../../protocols/ethernet.rst:175
English
Category 5 UTP or STP, 100 m maximum
0/360 · 36
37
../../protocols/http.rst:156
English
HTTP clients and servers can include different HTTP headers in HTTP requests and responses. Each HTTP header is encoded as a single ASCII-line terminated by `CR` and `LF`. Several of these headers are briefly described below. A detailed discussion of the standard headers may be found in :rfc:`1945`. The MIME headers can appear in both HTTP requests and HTTP responses.
0/3700 · 370
37
../../protocols/http2.rst:251
English
The `HTTP2-Settings` line contains the HTTP/2.0 settings frame that the client would server over an HTTP/2.0 session encoded in Base64. The server replies with a response that indicates that it has accepted to upgrade the connection to HTTP/2.0. A sample response is shown below.
0/2790 · 279
37
../../protocols/ipv6.rst:127
English
``2001:0db8::cd30:0:0:0:0`` / ``60``
0/360 · 36
37
../../protocols/ethernet.rst:149
English
Computers can directly be attached to Ethernet hubs. Ethernet hubs themselves can be attached to other Ethernet hubs to build a larger network. However, some important guidelines must be followed when building a complex network with hubs. First, the network topology must be a tree. As hubs are relays in the physical layer, adding a link between `Hub2` and `Hub3` in the network below would create an electrical shortcut that would completely disrupt the network. This implies that there cannot be any redundancy in a hub-based network. A failure of a hub or of a link between two hubs would partition the network into two isolated networks. Second, as hubs are relays in the physical layer, collisions can happen and must be handled by CSMA/CD as in a 10Base5 network. This implies that the maximum delay between any pair of devices in the network cannot be longer than the 51.2 microseconds `slot time`. If the delay is longer, collisions between short frames may not be correctly detected. This constraint limits the geographical spread of 10BaseT networks containing hubs.
0/10770 · 1077
37
../../protocols/routing.rst:110
English
The second OSPF particularity that is worth discussing is the support of Local Area Networks (LAN). As shown in the example below, several routers may be attached to the same LAN.
0/1790 · 179
37
../../protocols/rpc.rst:124
English
Coming back to our example with the call for the `sum` procedure, it would return the following JSON structure.
0/1110 · 111
37
../../protocols/ssh.rst:290
English
The ``ssh`` protocol includes other features that are beyond the scope of this book. Additional details may be found in [BS2005]_.
0/1300 · 130
37
../../protocols/tcp.rst:119
English
the `sequence number` set to the current value of the 32 bits counter of the server host's TCP entity
0/1010 · 101
37
../../protocols/tls.rst:155
English
`Cipher suites` : this ordered list contains the set of cryptographic algorithms that are supported by the client, with the most preferred one listed first. In contrast with ``ssh`` that allows negotiating independent algorithms for encryption, key exchange and authentication, TLS relies on suites that combine these algorithms together. Many cryptographic suites have been defined for TLS. Various recommendations have been published on the security of some of these suites :rfc:`7525`.
0/4880 · 488
37
../../protocols/wifi.rst:56
English
An 802.11 access point is a relay that operates in the datalink layer like switches. The figure below represents the layers of the reference model that are involved when a WiFi host communicates with a host attached to an Ethernet network through an access point.
0/2630 · 263
38
../../bibliography.rst:120
English
Leboudec, J.-Y., `Rate Adaptation Congestion Control and Fairness : a tutorial <http://ica1www.epfl.ch/PS_files/LEB3132.pdf>`_, Dec. 2008
0/1370 · 137
38
../../glossary.rst:159
English
EIGRP
0/100 · 5
38
../../exercises/ex-sharing.rst:643
English
Slotted ALOHA improves the performance of ALOHA by dividing the time in slots. However, this basic idea raises two interested questions. First how would you enforce the duration of these slots ? Second, should a slot include the time to transmit a data frame or the time to transmit a data frame and the corresponding acknowledgment ?
0/3340 · 334
38
../../principles/network.rst:138
English
Another interesting point that is worth being discussed is when the forwarding tables are computed. A widely used solution is to compute the entries of the forwarding tables for all destinations on all routers. This ensures that each router has a valid route towards each destination. These entries can be updated when an event occurs and the network topology changes. A drawback of this approach is that the forwarding tables can become large in large networks since each router must always maintain one entry for each destination inside its forwarding table.
0/5600 · 560
38
../../principles/transport.rst:82
English
A simple BNF specification
0/260 · 26
38
../../principles/sharing.rst:167
English
If the buffer's occupancy continues to grow, it will overflow and packets will need to be discarded. Discarding packets during congestion is the second possible reaction of a network node to congestion. Before looking at how a node can discard packets, it is interesting to discuss qualitatively the impact of the buffer occupancy on the reliable delivery of data through a network. This is illustrated by the figure below, adapted from [Jain1990]_.
0/4490 · 449
38
../../principles/security.rst:393
English
Several public key encryption schemes have been proposed. Two of them have reached wide deployment :
0/1000 · 100
38
../../exercises/ipv6.rst:384
English
on router ``R5``
0/160 · 16
38
../../exercises/routing-protocols.rst:438
English
``AS3`` is assigned ``2001:cafe:3::/48``
0/400 · 40