Exit Zen
33
../../exercises/ex-sharing.rst:611
English
Same question as above, but now host `A` uses the simple DECBIT congestion control mechanism and a maximum window size of four segments.
0/1360 · 136
33
../../exercises/network.rst:325
English
Host `A` uses the same flat address for both links.
0/510 · 51
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.
0/1400 · 140
33
../../principles/naming.rst:142
English
See http://www.donelan.com/dnstimeline.html for a time line of DNS related developments.
0/880 · 88
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/referencemodels.rst:132
English
The TCP/IP reference model
0/260 · 26
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/transport.rst:70
English
`carriage return` (`CR`) : `0001101b`
0/370 · 37
34
../../bibliography.rst:107
English
Kleinrock, L., Tobagi, F., `Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and their Throughput-Delay Characteristics <https://dx.doi.org/10.1109/TCOM.1975.1092768>`_, IEEE Transactions on Communications, Vol. COM-23, No. 12, pp. 1400-1416, December 1975.
0/2880 · 288
34
../../glossary.rst:171
English
eBGP
0/100 · 4
34
../../exercises/ex-sharing.rst:630
English
Hosts `A` and `B` use the simple congestion control scheme described in the book and router `R1` uses the DECBIT mechanism to mark packets as soon as its buffers contain one packet. Hosts `A` and `B` need to send five segments and start exactly at the same time. How long does each hosts needs to wait to receive the acknowledgment for its fifth segment ?
0/3550 · 355
34
../../exercises/network.rst:326
English
Host `A` uses a different flat address on each of its links
0/590 · 59
34
../../exercises/reliability.rst:74
English
Discussion questions
0/200 · 20
34
../../exercises/sockets.rst:288
English
An IPv6 address often identifies a computer and not a program running on the computer. In order to identify a specific program running on a specific computer, we use a *port number* in addition to the IPv6 address. A program using an IPv6 socket is this identified using :
0/2720 · 272
34
../../principles/naming.rst:144
English
This specification evolved later to support domain names written by using other character sets than us-ASCII :rfc:`5890`. This extension is important to support languages other than English, but a detailed discussion is outside the scope of this document.
0/2550 · 255
34
../../principles/network.rst:130
English
The simplest `control plane` for a network is to manually compute the forwarding tables of all routers inside the network. This simple control plane is sufficient when the network is (very) small, usually up to a few routers.
0/2250 · 225
34
../../principles/reliability.rst:152
English
the `Physical layer service` may change, e.g. due to electromagnetic interference, the value of a bit being transmitted
0/1190 · 119
34
../../principles/sharing.rst:155
English
When a network node forwards small packets, its performance is usually limited by the number of lookup operations that it can perform every second. This lookup performance is measured in packets per second. The performance may depend on the length of the forwarded packets. The key performance factor is the number of minimal size packets that are forwarded by the node every second. This rate can lead to a capacity in bits per second which is much lower than the sum of the bandwidth of the node's links.
0/5060 · 506
34
../../principles/transport.rst:71
English
`line feed` (`LF`) : `0001010b`
0/310 · 31
35
../../bibliography.rst:109
English
Khanna, A. and Zinky, J. 1989. `The revised ARPANET routing metric <http://doi.acm.org/10.1145/75247.75252>`_. SIGCOMM Computer Communication Review 19, 4 (Aug. 1989), 45-56.
0/1740 · 174