Exit Zen
47
../../exercises/tcp-2.rst:643
English
the delay required to transmit a single TCP segment containing MSS bytes is small and set to 1 milliseconds, independently of the MSS size
0/1380 · 138
47
../../protocols/bgp.rst:138
English
`Update message` to indicate a BGP `UPDATE` containing a new or updated route towards one destination prefix with its attributes
0/1280 · 128
47
../../protocols/congestion.rst:221
English
The first TCP congestion control scheme was proposed by `Van Jacobson`_ in [Jacobson1988]_. In addition to writing the scientific paper, `Van Jacobson`_ also implemented the slow-start and congestion avoidance schemes in release 4.3 `Tahoe` of the BSD Unix distributed by the University of Berkeley. Later, he improved the congestion control by adding the fast retransmit and the fast recovery mechanisms in the `Reno` release of 4.3 BSD Unix. Since then, many researchers have proposed, simulated and implemented modifications to the TCP congestion control scheme. Some of these modifications are still used today, e.g. :
0/6220 · 622
47
../../protocols/email.rst:222
English
The last MIME header line is `Content-Transfer-Encoding:`. This header line is used after the `Content-Type:` header line, within a message part, and specifies how the message part has been encoded. The default encoding is to use 7 bits ASCII. The most frequent encodings are `quoted-printable` and `Base64`. Both support encoding a sequence of bytes into a set of ASCII lines that can be safely transmitted by email servers. `quoted-printable` is defined in :rfc:`2045`. We briefly describe `base64` which is defined in :rfc:`2045` and :rfc:`4648`.
0/5490 · 549
47
../../protocols/ethernet.rst:180
English
Optical fiber (experiences are performed with copper)
0/530 · 53
47
../../protocols/http.rst:171
English
the `If-Modified-Since:` header is followed by a date. It enables clients to cache in memory or on disk recent or most frequently used documents. When a client needs to request a URI from a server, it first checks whether the document is already in its cache. If it is, the client sends an HTTP request with the `If-Modified-Since:` header indicating the date of the cached document. The server will only return the document attached to the HTTP response if it is newer than the version stored in the client's cache.
0/5160 · 516
47
../../protocols/ipv6.rst:164
English
Inside each campus, the same division can be done, for example on a per building basis, starting from the buildings that host the largest number of nodes, e.g. the company datacenter. In each building, the same division can be done on a per floor basis, ... The advantage of such a hierarchical allocation of the addresses is that the routers in the large campus only need one route to reach a router in the smaller campus. The routers in the large campus would know more routes about the buildings in their campus, but they do not need to know the details of the organization of each smaller campus.
0/6000 · 600
47
../../protocols/ethernet.rst:173
English
10BaseT
0/100 · 7
47
../../protocols/routing.rst:148
English
A last, but operationally important, point needs to be discussed about intradomain routing protocols such as OSPF and IS-IS. Intradomain routing protocols always select the shortest path for each destination. In practice, there are often several equal paths towards the same destination. When a router computes several equal cost paths towards one destination, it can use these paths in different ways.
0/4020 · 402
47
../../protocols/tcp.rst:147
English
where `M` is the current value of the TCP clock and `H` is a cryptographic hash function. `localhost` and `remotehost` (resp. `localport` and `remoteport` ) are the IP addresses (port numbers) of the local and remote host and `secret` is a random number only known by the server. This method allows the server to use different ISNs for different clients at the same time. `Measurements <http://lcamtuf.coredump.cx/newtcp/>`_ performed with the first implementations of this technique showed that it was difficult to implement it correctly, but today's TCP implementation now generate good ISNs.
0/5940 · 594
47
../../protocols/tls.rst:220
English
At this point, it is time to describe the TLS key exchange. TLS supports different key exchange mechanisms that can be negotiated as part of the selection of the cipher suite. We focus on two of them to highlight their differences:
0/2310 · 231
47
../../protocols/wifi.rst:129
English
The 802.11 service
0/180 · 18
48
../../bibliography.rst:313
English
Ross, F., `An overview of FDDI: The fiber distributed data interface <https://dx.doi.org/10.1109/49.44552>`_, IEEE J. Selected Areas in Comm., vol. 7, no. 7, pp. 1043-1051, Sept. 1989
0/1830 · 183
48
../../glossary.rst:102
English
ftp
0/100 · 3
48
../../exercises/network.rst:363 • ../../exercises/network.rst:367
English
3 via C
7/100 · 7
48
../../exercises/sockets.rst:346
English
Exercises
9/100 · 9
48
../../principles/referencemodels.rst:165
English
An interesting historical discussion of the OSI-TCP/IP debate may be found in [Russel06]_
97/890 · 89
48
../../principles/reliability.rst:206
English
A first solution to this problem is to require the physical layer to remain idle for some time after the transmission of each frame. These idle periods can be detected by the receiver and serve as a marker to delineate frame boundaries. Unfortunately, this solution is not acceptable for two reasons. First, some physical layers cannot remain idle and always need to transmit bits. Second, inserting an idle period between frames decreases the maximum bit rate that can be achieved.
0/4820 · 482
48
../../principles/transport.rst:109 • ../../principles/transport.rst:122 • ../../principles/transport.rst:213 • ../../principles/transport.rst:526
English
The transport layer
22/190 · 19
48
../../principles/sharing.rst:195
English
In datagram networks, `Forward Explicit Congestion Notification` (FECN) can be used. One field of the packet header, typically one bit, is used to indicate congestion. When a host sends a packet, the congestion bit is unset. If the packet passes through a congested node, the congestion bit is set. The destination can then determine the current congestion level by measuring the fraction of the packets that it received with the congestion bit set. It may then return this information to the sending host to allow it to adapt its retransmission rate. Compared to packet discarding, the main advantage of FECN is that hosts can detect congestion explicitly without having to rely on packet losses.
0/6970 · 697