Exit Zen
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
62
../../principles/sharing.rst:260
English
Medium Access Control algorithms
0/320 · 32
62
../../principles/transport.rst:206
English
the `connectionless network layer service` may delay, reorder or even duplicate SDUs
0/840 · 84
63
../../glossary.rst:170
English
An iBGP session is a BGP between two routers belonging to the same Autonomous System. Also called an internal BGP session.
0/1220 · 122
63
../../exercises/network.rst:370
English
Distance vector protocols can operate in two different modes : `periodic updates` and `triggered updates`. `Periodic updates` is the default mode for a distance vector protocol. For example, each router could advertise its distance vector every thirty seconds. With the `triggered updates` a router sends its distance vector when its routing table changes (and periodically when there are no changes).
0/4010 · 401
63
../../principles/network.rst:269
English
This hierarchical allocation of addresses can be applied in any type of network. In practice, the allocation of the addresses must follow the network topology. Usually, this is achieved by dividing the addressing space in consecutive blocks and then allocating these blocks to different parts of the network. In a small network, the simplest solution is to allocate one block of addresses to each network node and assign the host addresses from the attached node.
0/4630 · 463
63
../../principles/reliability.rst:236
English
`Bit stuffing` can be easily implemented in hardware. However, implementing it in software is difficult given the complexity of performing bit manipulations in software. Software implementations prefer to process characters than bits, software-based datalink layers usually use `character stuffing`. This technique operates on frames that contain an integer number of characters. In computer networks, characters are usually encoded by relying on the :term:`ASCII` table. This table defines the encoding of various alphanumeric characters as a sequence of bits. :rfc:`20` provides the ASCII table that is used by many protocols on the Internet. For example, the table defines the following binary representations :
0/7140 · 714
63
../../principles/sharing.rst:265
English
The common problem among Local Area Networks is how to efficiently share the available bandwidth. If two devices send a frame at the same time, the two electrical, optical or radio signals that correspond to these frames will appear at the same time on the transmission medium and a receiver will not be able to decode either frame. Such simultaneous transmissions are called `collisions`. A `collision` may involve frames transmitted by two or more devices attached to the Local Area Network. Collisions are the main cause of errors in wired Local Area Networks.
0/5630 · 563
64
../../glossary.rst:241
English
ICANN
0/100 · 5