Exit Zen
59
../../glossary.rst:182
English
A relay operating in the physical layer.
0/400 · 40
59
../../exercises/network.rst:366
English
1 via D
0/100 · 7
59
../../principles/network.rst:259
English
The first organization, which is the one that we have implicitly assumed until now, is the `flat addressing` scheme. Under this scheme, each host and network node has a unique address. The unicity of the addresses is important for the operation of the network. If two hosts have the same address, it can become difficult for the network to forward packets towards this destination. `Flat addresses` are typically used in situations where network nodes and hosts need to be able to communicate immediately with unique addresses. These `flat addresses` are often embedded inside the network interface cards. The network card manufacturer creates one unique address for each interface and this address is stored in the read-only memory of the interface. An advantage of this addressing scheme is that it easily supports unstructured and mobile networks. When a host moves, it can attach to another network and remain confident that its address is unique and enables it to communicate inside the new network.
0/10040 · 1004
59
../../principles/reliability.rst:224
English
01111110
0/100 · 8
59
../../principles/transport.rst:203
English
the `connectionless network layer service` can only transfer SDUs of *limited size*
0/830 · 83
60
../../bibliography.rst:357
English
Zimmermann, H., `OSI Reference Model - The ISO Model of Architecture for Open Systems Interconnection <https://dx.doi.org/10.1109/TCOM.1980.1094702>`_, IEEE Transactions on Communications, vol. 28, no. 4, April 1980, pp. 425 - 432.
0/2320 · 232
60
../../glossary.rst:132
English
IANA
0/100 · 4
60
../../exercises/network.rst:367
English
E
0/100 · 1
60
../../principles/reliability.rst:224
English
0111111001111101001111110
0/250 · 25
60
../../principles/transport.rst:204
English
the `connectionless network layer service` may discard SDUs
0/590 · 59
61
../../bibliography.rst:358
English
Zakon, R., `Hobbes Internet Timeline <https://www.zakon.org/robert/internet/timeline/>`_, online, https://www.zakon.org/robert/internet/timeline/
0/1450 · 145
61
../../glossary.rst:134
English
The Internet Assigned Numbers Authority (IANA) is responsible for the coordination of the DNS Root, IP addressing, and other Internet protocol resources
0/1520 · 152
61
../../exercises/network.rst:367
English
4 via B
0/100 · 7
61
../../principles/reliability.rst:228
English
For example, consider the transmission of `0110111111111111111110010`. The sender will first send the `01111110` marker followed by `011011111`. After these five consecutive bits set to `1`, it inserts a bit set to `0` followed by `11111`. A new `0` is inserted, followed by `11111`. A new `0` is inserted followed by the end of the frame `110010` and the `01111110` marker.
0/3740 · 374
61
../../principles/sharing.rst:254
English
Now that we have provided a broad overview of the techniques that can be used to spread the load and allocate resources in the network, let us analyze two techniques in more details : Medium Access Control and Congestion control.
0/2290 · 229
61
../../principles/transport.rst:205
English
the `connectionless network layer service` may corrupt SDUs
0/590 · 59
62
../../bibliography.rst:359
English
Zheng, X., `Phishing with Unicode Domains <https://www.xudongz.com/blog/2017/idn-phishing/>`_, April 14, 2017, https://www.xudongz.com/blog/2017/idn-phishing/
0/1580 · 158
62
../../glossary.rst:168
English
iBGP
0/100 · 4
62
../../exercises/network.rst:367
English
1 via E
0/100 · 7
62
../../principles/reliability.rst:231
English
`Bit stuffing` increases the number of bits required to transmit each frame. The worst case for bit stuffing is of course a long sequence of bits set to `1` inside the frame. If transmission errors occur, stuffed bits or markers can be in error. In these cases, the frame affected by the error and possibly the next frame will not be correctly decoded by the receiver, but it will be able to resynchronize itself at the next valid marker.
0/4380 · 438