Exit Zen
25
../../protocols/congestion.rst:124
English
If TCP acknowledgments are overloaded to carry the `ECE` bit, the situation is different. Consider the example shown in the figure below. A client sends packets to a server through a router. In the example below, the first packet is marked. The server returns an acknowledgment with the `ECE` bit set. Unfortunately, this acknowledgment is lost and never reaches the client. Shortly after, the server sends a data segment that also carries a cumulative acknowledgment. This acknowledgment confirms the reception of the data to the client, but it did not receive the congestion information through the `ECE` bit.
0/6110 · 611
25
../../protocols/dnssec.rst:277
English
The simplest way to allow a DNSSEC server to return signed negative responses would be for the server to return a signed response that contains the received query and some information indicating the error. The client could then easily check the validity of the negative response. Unfortunately, this would force the DNSSEC server to generate signatures in real time. This implies that the private key must be stored in the server memory, which leads to risks if an attacker can take control of the server. Furthermore, those signatures are computationally complex and a simple denial of service attack would be to send invalid queries to a DNSSEC server.
0/6540 · 654
25
../../protocols/email.rst:127
English
the `In-reply-to:` header line is used when a message was created in reply to a previous message. In this case, the end of the `In-reply-to:` line contains the identifier of the original message.
0/1950 · 195
25
../../protocols/ethernet.rst:164
English
The evolution of Ethernet did not stop. In 1998, the IEEE published a first standard to provide Gigabit Ethernet over optical fibers. Several other types of physical layers were added afterwards. The `10 Gigabit Ethernet <http://en.wikipedia.org/wiki/10_gigabit_Ethernet>`_ standard appeared in 2002. Work is ongoing to develop `standards <http://www.ieee802.org/3/ba/public/index.html>`_ for 40 Gigabit and 100 Gigabit Ethernet and some are thinking about `Terabit Ethernet <http://www.networkworld.com/news/2009/042009-terabit-ethernet.html>`_. The table below lists the main Ethernet standards. A more detailed list may be found at http://en.wikipedia.org/wiki/Ethernet_physical_layer.
0/6880 · 688
25
../../protocols/http.rst:114
English
The third component of the `world wide web` is the HyperText Transfer Protocol (HTTP). HTTP is a text-based protocol like SMTP. The client sends a request and the server returns a response. HTTP runs above the bytestream service and HTTP servers listen by default on port `80`. The design of HTTP has largely been inspired by the Internet email protocols. Each HTTP request contains three parts :
0/3960 · 396
25
../../protocols/http2.rst:165
English
This multiplexing capability is probably the most important feature of HTTP/2.0 from a performance viewpoint. To understand its benefits, let us consider a client that retrieves two web objects over a 1 Mbps connection. The two requests are sent together by the client. The first object is 125 bytes long, while the second is 12500 bytes long. In this case, the server will first return the first object as a single frame and the second will be sent in the subsequent frame.
0/4740 · 474
25
../../protocols/ipv6.rst:109
English
Textual representation of IPv6 addresses
0/400 · 40
25
../../protocols/ethernet.rst:70
English
Where should the CRC be located in a frame ?
0/440 · 44
25
../../protocols/routing.rst:78
English
For example, the network shown in the figure below has been divided into three areas : `area 0`, containing routers `RA`, `RB`, `RC` and `RD`, `area 1`, containing routers `R1`, `R3`, `R4`, `R5` and `RA`, and `area 2` containing `R7`, `R8`, `R9`, `R10`, `RB` and `RC`. OSPF areas are identified by a 32 bit integer, which is sometimes represented as an IP address. Among the OSPF areas, `area 0`, also called the `backbone area`, has a special role. The backbone area groups all the area border routers (routers `RA`, `RB` and `RC` in the figure below) and the routers that are directly connected to the backbone routers but do not belong to another area (router `RD` in the figure below). An important restriction imposed by OSPF is that the path between two routers that belong to two different areas (e.g. `R1` and `R8` in the figure below) must pass through the backbone area.
0/8800 · 880
25
../../protocols/rpc.rst:103
English
`method`: a string that contains the name of the procedure which is invoked
0/750 · 75
25
../../protocols/ssh.rst:208
English
a key used by the client (resp. server) to initialize the negotiated encryption scheme (if required by this scheme)
0/1150 · 115
25
../../protocols/tcp.rst:52
English
the `URG` flag is used together with the `Urgent pointer`
0/570 · 57
25
../../protocols/tls.rst:77
English
In the remaining parts of this chapter, we assume that the TLS session starts immediately after the establishment of the TCP connection. This corresponds to the deployments on web servers. We focus our presentation of TLS on this very popular use case. TLS is a complex protocol that supports other features than the one used by web servers. A more detailed presentation of TLS may be found in [KPS2002]_ and [Ristic2015]_.
0/4230 · 423
25
../../protocols/udp.rst:89
English
Footnotes
0/100 · 9
25
../../protocols/wifi.rst:25
English
802.11g
0/100 · 7
26
../../bibliography.rst:85
English
Garcia-Lunes-Aceves, J., `Loop-Free Routing Using Diffusing Computations <https://dx.doi.org/10.1109/90.222913>`_, IEEE/ACM Transactions on Networking, Vol. 1, No, 1, Feb. 1993
0/1760 · 176
26
../../glossary.rst:129
English
CIDR
0/100 · 4
26
../../exercises/ex-sharing.rst:561
English
Assume now that `R1` is using round-robin scheduling instead of a FIFO buffer. One queue is used to store the packets sent by `A` and another for the packets sent by `B`. `A` sends one 1000 bits packet every second while `B` sends packets at 10 Mbps. What is the round-trip-time measured by each of these two hosts if each of the two queues of `R1` can store 5 packets ?
0/3700 · 370
26
../../exercises/reliability.rst:57
English
the 16 bits or the 32 bits Cyclical Redundancy Checks (CRC) that are often used on disks, in zip archives and in datalink layer protocols. See http://rosettacode.org/wiki/CRC-32 for CRC-32 implementations in various languages.
0/2260 · 226
26
../../exercises/network.rst:240
English
`R1->R5->R4` and `R3->R2->R4`
27/290 · 29