Exit Zen
114
../../protocols/ipv6.rst:395
English
The `Fragment Options` header is more important. An important problem in the network layer is the ability to handle heterogeneous datalink layers. Most datalink layer technologies can only transmit and receive frames that are shorter than a given maximum frame size. Unfortunately, all datalink layer technologies use different maximum frames sizes.
0/3490 · 349
114
../../protocols/ethernet.rst:375
English
Blocked
0/100 · 7
114
../../protocols/tcp.rst:335
English
52.4 Mbps
0/100 · 9
115
../../glossary.rst:282
English
A modem (modulator-demodulator) is a device that encodes (resp. decodes) digital information by modulating (resp. demodulating) an analog signal. Modems are frequently used to transmit digital information over telephone lines and radio links. See https://en.wikipedia.org/wiki/Modem for a survey of various types of modems
0/3220 · 322
115
../../principles/network.rst:506
English
We will see later a more detailed description of Multiprotocol Label Switching, a networking technology that is capable of using one or more labels.
0/1480 · 148
115
../../principles/reliability.rst:407
English
`Information theory` defines `coding schemes`. There are different types of coding schemes, but let us focus on coding schemes that operate on binary strings. A coding scheme is a function that maps information encoded as a string of `m` bits into a string of `n` bits. The simplest coding scheme is the (even) parity coding. This coding scheme takes an `m` bits source string and produces an `m+1` bits coded string where the first `m` bits of the coded string are the bits of the source string and the last bit of the coded string is chosen such that the coded string will always contain an even number of bits set to `1`. For example :
0/6380 · 638
115
../../principles/transport.rst:652
English
the `transport clock` is implemented as a `k` bits counter and its clock cycle is such that :math:`2^k \times cycle >> MSL`. Furthermore, the `transport clock` counter is incremented every clock cycle and after each connection establishment. This clock is illustrated in the figure below.
0/2880 · 288
115
../../principles/sharing.rst:534
English
Operation of a CSMA/CA device
0/290 · 29
115
../../protocols/bgp.rst:423
English
`AS3` sends `U(p, AS3:AS0)` to `AS1` and `AS4`. `AS1` selects the path via `AS3` since this is its preferred path. `AS4` still uses the path via `AS1`.
0/1510 · 151
115
../../protocols/email.rst:250 • ../../protocols/email.rst:252
English
9
0/100 · 1
115
../../protocols/ethernet.rst:415
English
IEEE defined in the [IEEE802.1q]_ standard a special header to encode the VLAN identifiers. This 32 bit header includes a 12 bit VLAN field that contains the VLAN identifier of each frame. The format of the [IEEE802.1q]_ header is described below.
0/2470 · 247
115
../../protocols/ipv6.rst:399
English
Each datalink layer has its own characteristics and as indicated earlier, each datalink layer is characterized by a maximum frame size. From IP's point of view, a datalink layer interface is characterized by its `Maximum Transmission Unit (MTU)`. The MTU of an interface is the largest packet (including header) that it can send. The table below provides some common MTU sizes.
0/3770 · 377
115
../../protocols/ethernet.rst:375 • ../../protocols/ethernet.rst:376 • ../../protocols/ethernet.rst:376 • ../../protocols/ethernet.rst:377 • ../../protocols/ethernet.rst:377 • ../../protocols/ethernet.rst:377
English
yes
0/100 · 3
115
../../protocols/tcp.rst:336 • ../../protocols/tcp.rst:349
English
100 msec
0/100 · 8
116
../../glossary.rst:123
English
MSS
0/100 · 3
116
../../principles/network.rst:511
English
The control plane
0/170 · 17
116
../../principles/reliability.rst:409
English
`1001` is encoded as `10010`
0/280 · 28
116
../../principles/transport.rst:653
English
the `transport clock` must continue to be incremented even if the transport entity stops or reboots
0/990 · 99
116
../../principles/sharing.rst:540
English
The main difficulty with CSMA/CA is when two or more devices transmit at the same time and cause collisions. This is illustrated in the figure below, assuming a fixed timeout after the transmission of a data frame. With CSMA/CA, the timeout after the transmission of a data frame is very small, since it corresponds to the SIFS plus the time required to transmit the acknowledgment frame.
0/3880 · 388
116
../../protocols/bgp.rst:424
English
As `AS1` has changed its path, it sends `U(p,AS1:AS3:AS0)` to `AS4` and `W(p)` to `AS3` since its new path is via `AS3`. `AS4` switches back to the direct path.
0/1600 · 160