Exit Zen
33
../../exercises/sockets.rst:284
English
The ``2001:6a8:308f:9:0:82ff:fe68:e520`` IPv6 address identifies the computer serving the ``https://beta.computer-networking.info`` website.
137/1400 · 140
33
../../principles/naming.rst:142
English
See http://www.donelan.com/dnstimeline.html for a time line of DNS related developments.
97/880 · 88
33
../../principles/referencemodels.rst:132
English
The TCP/IP reference model
29/260 · 26
33
../../principles/network.rst:128
English
Besides the `data plane`, a network is also characterized by its `control plane`. The control plane includes all the protocols and algorithms (often distributed) that compute the forwarding tables that are installed on all routers inside the network. While there is only one possible `data plane` for a given networking technology, different networks using the same technology may use different control planes.
0/4100 · 410
33
../../principles/transport.rst:70
English
`carriage return` (`CR`) : `0001101b`
0/370 · 37
33
../../principles/sharing.rst:153
English
The node's capacity in bits per second mainly depends on the physical interfaces that it uses and also on the capacity of the internal interconnection (bus, crossbar switch, ...) between the different interfaces inside the node. Many vendors, in particular for low-end devices will use the sum of the bandwidth of the nodes' interfaces as the node capacity in bits per second. Measurements do not always match this maximum theoretical capacity. A well designed network node will usually have a capacity in bits per second larger than the sum of its link capacities. Such nodes will usually reach this maximum capacity when forwarding large packets.
0/6480 · 648
33
../../principles/security.rst:371
English
These two keys are generated together and they are linked by a complex mathematical relationship that is such that it is computationally difficult to compute :math:`K_{priv}` from :math:`K_{pub}`.
0/1960 · 196
33
../../exercises/dns.rst:112
English
Footnotes
21/100 · 9
33
../../exercises/ipv6.rst:297
English
...
0/100 · 3
33
../../exercises/routing-protocols.rst:378
English
Exploring BGP
0/130 · 13
33
../../exercises/tcp-2.rst:259
English
Another very interesting utilization of packetdrill_ is to explore how a TCP stack reacts to acknowledgments that would correspond to lost or reordered segments. For this analysis, we configure a very large initial congestion window to ensure that the connection does not start with a slow-start.
0/2960 · 296
33
../../protocols/bgp.rst:110
English
BGP routers exchange routes over BGP sessions. A BGP session is established between two routers belonging to two different domains that are directly connected. As explained earlier, the physical connection between the two routers can be implemented as a private peering link or over an Internet eXchange Point. A BGP session between two adjacent routers runs above a TCP connection (the default BGP port is 179). In contrast with intradomain routing protocols that exchange IP packets or UDP segments, BGP runs above TCP because TCP ensures a reliable delivery of the BGP messages sent by each router without forcing the routers to implement acknowledgments, checksums, etc. Furthermore, the two routers consider the peering link to be up as long as the BGP session and the underlying TCP connection remain up [#flifetimebgp]_. The two endpoints of a BGP session are called `BGP peers`.
0/8860 · 886
33
../../protocols/congestion.rst:186
English
Modeling TCP congestion control
0/310 · 31
33
../../protocols/email.rst:176
English
The `Content-Transfer-Encoding:` header line is used to specify how the message has been encoded. When MIME was designed, some email servers were only able to process messages containing characters encoded using the 7 bits ASCII character set. MIME allows the utilization of other character encodings.
0/3010 · 301
33
../../protocols/ethernet.rst:173
English
Two pairs of category 3+ UTP
0/280 · 28
33
../../protocols/http.rst:144
English
Several types of method can be used in HTTP requests. The three most important ones are :
0/890 · 89
33
../../protocols/http2.rst:232
English
As the server can send multiple objects at the same time, there is a risk of overloading the client buffers. To cope with this potential problem, HTTP/2.0 includes its own flow control mechanism. When an HTTP/2.0 session starts, a receiver agrees to receive up to 65,535 bytes over this connection (unless it has indicated a different initial window in its `Settings` frame). This limits the amount of data that a sender can transmit over the HTTP/2.0 session. The receiver can advertise a large receive window by sending a `Window_Update` frame at any time. This flow control mechanism can be applied to the entire connection or to a specific stream. In practice, using a small `HTTP/2.0 window` could severely limit the throughput over an HTTP/2.0 session.
0/7580 · 758
33
../../protocols/ipv6.rst:121
English
``0:0:0:0:0:0:0:1`` is represented as ``::1``
0/450 · 45
33
../../protocols/ethernet.rst:99
English
The first property is a consequence of the utilization of CSMA/CD. The second property is a consequence of the physical organization of the Ethernet network as a shared bus. These two properties are important and all revisions to the Ethernet technology have preserved them.
0/2740 · 274
33
../../protocols/routing.rst:101
English
On the other hand, consider the prefixes `2001:db8:aaaa:0000::/64` and `2001:db8:aaaa:0001::/64` that are inside `area 1`. Router `RA` is the only area border router that is attached to this area. This router can create two different network summary advertisements :
0/2660 · 266