Exit Zen
29
../../principles/transport.rst:64
English
`z` : `1111010b`
0/160 · 16
30
../../bibliography.rst:97
English
Jung, J., Sit, E., Balakrishnan, H., and Morris, R. 2002. `DNS performance and the effectiveness of caching <https://dx.doi.org/10.1109/TNET.2002.803905>`_. IEEE/ACM Transactions Networking 10, 5 (Oct. 2002), 589-603.
0/2170 · 217
30
../../glossary.rst:54 • ../../glossary.rst:211 • ../../glossary.rst:232
English
DNS
0/100 · 3
30
../../exercises/ex-sharing.rst:591
English
Consider the simple network depicted in the figure below.
0/570 · 57
30
../../exercises/network.rst:276
English
The network below uses port forwarding tables. What happens if host `A` moves by removing its link with `R1` and replacing it with a link with `R3`? How should networks using port forwarding deal with such mobile hosts ?
0/2200 · 220
30
../../exercises/reliability.rst:64
English
all errors that affect an odd number of bits
0/440 · 44
30
../../exercises/sockets.rst:280
English
Sending a message to a remote peer using its IPv6 address
0/570 · 57
30
../../principles/network.rst:116
English
A second type of problem may exist in networks using the datagram organization. Consider a path that contains a cycle. For example, router `R1` sends all packets towards destination `D` via router `R2`. Router `R2` forwards these packets to router `R3` and finally router `R3`'s forwarding table uses router `R1` as its nexthop to reach destination `D`. In this case, if a packet destined to `D` is received by router `R1`, it will loop on the `R1 -> R2 -> R3 -> R1` cycle and will never reach its final destination. As in the black hole case, the destination is not reachable from all sources in the network. In practice the loop problem is more annoying than the black hole problem because when a packet is caught in a forwarding loop, it unnecessarily consumes bandwidth. In the black hole case, the problematic packet is quickly discarded. We will see later that network layer protocols include techniques to minimize the impact of such forwarding loops.
0/9580 · 958
30
../../principles/referencemodels.rst:120
English
application layer entities exchange *SDUs*
0/420 · 42
30
../../principles/transport.rst:65
English
`@` : `1000000b`
0/160 · 16
31
../../bibliography.rst:99
English
Kerrisk, M., `The Linux Programming Interface <http://nostarch.com/tlpi>`_, No Starch Press, 2010
0/970 · 97
31
../../exercises/ex-sharing.rst:609
English
In this network, a 250 Kbps link is used between the routers. The propagation delays in the network are negligible. Host `A` sends 1000 bits long segments so that it takes one msec to transmit one segment on the `A-R1` link. Neglecting the transmission delays for the acknowledgments, what is the minimum round-trip time measured on host `A` with such segments ?
0/3620 · 362
31
../../exercises/network.rst:299
English
Some hosts need to be multihomed, i.e. attached to two different network nodes as shown in the figure below.
0/1080 · 108
31
../../exercises/reliability.rst:65
English
all errors that affect a sequence of bits which is shorter than the length of the CRC
0/850 · 85
31
../../exercises/sockets.rst:284
English
Now that we created an IPv6 socket, we can use it to reach another program if we know its IPv6 address. IPv6 addresses have a human-readable format that can be represented as a string of characters. The details of IPv6 addresses are out of scope of this section but here are some examples :
0/2900 · 290
31
../../principles/naming.rst:139
English
Footnotes
0/100 · 9
31
../../principles/network.rst:118
English
Any solution which is used to compute the forwarding tables of a network must ensure that all destinations are reachable from any source. This implies that it must guarantee the absence of black holes and forwarding loops.
0/2220 · 222
31
../../principles/referencemodels.rst:125
English
Reference models
0/160 · 16
31
../../principles/reliability.rst:106
English
With the above transmission scheme, a bit is transmitted by setting the voltage on the electrical cable to a specific value during some period of time. We have seen that due to electromagnetic interference, the voltage measured by the receiver can differ from the voltage set by the transmitter. This is the main cause of transmission errors. However, this is not the only type of problem that can occur. Besides defining the voltages for bits `0` and `1`, the above transmission scheme also specifies the duration of each bit. If one million bits are sent every second, then each bit lasts 1 microsecond. On each host, the transmission (resp. the reception) of each bit is triggered by a local clock having a 1 MHz frequency. These clocks are the second source of problems when transmitting bits over a wire. Although the two clocks have the same specification, they run on different hosts, possibly at a different temperature and with a different source of energy. In practice, it is possible that the two clocks do not operate at exactly the same frequency. Assume that the clock of the transmitting host operates at exactly 1000000 Hz while the receiving clock operates at 999999 Hz. This is a very small difference between the two clocks. However, when using the clock to transmit bits, this difference is important. With its 1000000 Hz clock, the transmitting host will generate one million bits during a period of one second. During the same period, the receiving host will sense the wire 999999 times and thus will receive one bit less than the bits originally transmitted. This small difference in clock frequencies implies that bits can "disappear" during their transmission on an electrical cable. This is illustrated in the figure below.
0/17490 · 1749
31
../../principles/sharing.rst:150
English
the node's capacity measured in bits per second
0/470 · 47