Exit Zen
58
../../exercises/network.rst:366
English
3 via B
0/100 · 7
58
../../principles/network.rst:257
English
The last, but important, point to discuss about the `data plane` of the networks that rely on the datagram mode is their addressing scheme. In the examples above, we have used letters to represent the addresses of the hosts and network nodes. In practice, all addresses are encoded as a bit string. Most network technologies use a fixed size bit string to represent source and destination address. These addresses can be organized in two different ways.
0/4530 · 453
58
../../principles/reliability.rst:223
English
01111110011011111011111011111011001001111110
0/440 · 44
58
../../principles/sharing.rst:241
English
Based on the feedback received from the network, the hosts can adjust their transmission rate. We discuss in section `Congestion control` some techniques that allow hosts to react to congestion.
0/1940 · 194
58
../../principles/transport.rst:201
English
As the transport layer is built on top of the network layer, it is important to know the key features of the network layer service. In this book, we only consider the `connectionless network layer service` which is the most widespread. Its main characteristics are :
0/2660 · 266
59
../../bibliography.rst:353
English
ITU-T, recommendation X.200, `Open Systems Interconnection - Model and Notation <http://www.itu.int/rec/T-REC-X.200-199407-I/en>`_, 1994
0/1360 · 136
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