Exit Zen
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
../../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/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
48
../../principles/security.rst:469
English
Cryptographic protocols
0/230 · 23
48
../../exercises/ipv6.rst:478
English
Can you configure the forwarding tables of the six routers to achieve the following network objectives :
0/1040 · 104
48
../../exercises/routing-protocols.rst:569
English
Note that the path preferred by ``AS3`` to reach ``AS1`` is different.
0/700 · 70
48
../../exercises/tcp-2.rst:644
English
the transmission delay for a TCP acknowledgment is negligible
0/610 · 61
48
../../protocols/bgp.rst:143
English
From a conceptual point of view, a BGP router connected to `N` BGP peers, can be described as being composed of four parts as shown in the figure below.
0/1520 · 152
48
../../protocols/congestion.rst:223
English
`NewReno` (:rfc:`3782`), which was proposed as an improvement of the fast recovery mechanism in the `Reno` implementation.
0/1220 · 122
48
../../protocols/email.rst:227
English
`Base64` divides the sequence of bytes to be encoded into groups of three bytes (with the last group possibly being partially filled). Each group of three bytes is then divided into four six-bit fields and each six bit field is encoded as a character from the table below.
0/2720 · 272
48
../../protocols/ethernet.rst:192 • ../../protocols/ethernet.rst:308
English
Footnotes
0/100 · 9
48
../../protocols/http.rst:172
English
the `Referrer:` header is followed by a URI. It indicates the URI of the document that the client visited before sending this HTTP request. Thanks to this header, the server can know the URI of the document containing the hyperlink followed by the client, if any. This information is very useful to measure the impact of advertisements containing hyperlinks placed on websites.
0/3770 · 377
48
../../protocols/ipv6.rst:166
English
To preserve the scalability of the routing system, it is important to minimize the number of routes that are stored on each router. A router cannot store and maintain one route for each of the almost 1 billion hosts that are connected to today's Internet. Routers should only maintain routes towards blocks of addresses and not towards individual hosts. For this, hosts are grouped in `subnets` based on their location in the network. A typical subnet groups all the hosts that are part of the same enterprise. An enterprise network is usually composed of several LANs interconnected by routers. A small block of addresses from the Enterprise's block is usually assigned to each LAN.
0/6830 · 683