Exit Zen
98
../../principles/reliability.rst:341
English
the `header` that contains one bit set to `0` in data frames and set to `1` in control frames
0/930 · 93
98
../../principles/sharing.rst:456
English
The short-frame collision problem
0/330 · 33
98
../../principles/transport.rst:550
English
The simplest service that can be provided in the transport layer is the connectionless transport service. Compared to the connectionless network layer service, this transport service includes two additional features :
0/2170 · 217
99
../../glossary.rst:41
English
The International Telecommunication Union is a United Nation's agency whose purpose is to develop standards for the telecommunication industry. It was initially created to standardize the basic telephone system but expanded later towards data networks. The work within ITU is mainly done by network specialists from the telecommunication industry (operators and vendors). See https://www.itu.int for more information
0/4160 · 416
99
../../principles/network.rst:377
English
3
0/100 · 1
99
../../principles/reliability.rst:342
English
the payload that contains the SDU supplied by the application
0/610 · 61
99
../../principles/sharing.rst:462
English
To solve this problem, networks using CSMA/CD require hosts to transmit for at least :math:`2\times\tau` seconds. Since the network transmission speed is fixed for a given network technology, this implies that a technology that uses CSMA/CD enforces a minimum frame size. In the most popular CSMA/CD technology, Ethernet, :math:`2\times\tau` is called the `slot time` [#fslottime]_.
0/3820 · 382
100
../../glossary.rst:153
English
IXP
0/100 · 3
100
../../principles/network.rst:377
English
East
0/100 · 4
100
../../principles/reliability.rst:344
English
The datalink entity can then be modeled as a finite state machine, containing two states for the receiver and two states for the sender. The figure below provides a graphical representation of this state machine with the sender above and the receiver below.
0/2570 · 257
100
../../principles/sharing.rst:468
English
The last innovation introduced by CSMA/CD is the computation of the retransmission timeout. As for ALOHA, this timeout cannot be fixed, otherwise hosts could become synchronized and always retransmit at the same time. Setting such a timeout is always a compromise between the network access delay and the amount of collisions. A short timeout would lead to a low network access delay but with a higher risk of collisions. On the other hand, a long timeout would cause a long network access delay but a lower risk of collisions. The `binary exponential back-off` algorithm was introduced in CSMA/CD networks to solve this problem.
0/6290 · 629
100
../../principles/transport.rst:553
English
a `multiplexing technique` that enables several applications running on one host to exchange information with another host
0/1220 · 122
101
../../glossary.rst:155
English
Internet eXchange Point. A location where routers belonging to different domains are attached to the same Local Area Network to establish peering sessions and exchange packets. See http://www.euro-ix.net/ or https://en.wikipedia.org/wiki/List_of_Internet_exchange_points_by_size for a partial list of IXPs.
0/3060 · 306
101
../../principles/network.rst:380
English
If this node receives a packet with `label=2`, it forwards the packet on its `West` interface and sets the `label` of the outgoing packet to `2`. If the received packet's `label` is set to `3`, then the packet is forwarded over the `East` interface and the `label` of the outgoing packet is set to `2`. If a packet is received with a label field set to `1`, the packet is discarded since the corresponding `label forwarding table` entry is invalid.
0/4480 · 448
101
../../principles/sharing.rst:470
English
To understand `binary exponential back-off`, let us consider a collision caused by exactly two hosts. Once it has detected the collision, a host can either retransmit its frame immediately or defer its transmission for some time. If each colliding host flips a coin to decide whether to retransmit immediately or to defer its retransmission, four cases are possible :
0/3670 · 367
101
../../principles/transport.rst:557
English
To exchange data, the transport protocol encapsulates the SDU produced by its user inside a `segment`. The `segment` is the unit of transfer of information in the transport layer. Transport layer entities always exchange segments. When a transport layer entity creates a segment, this segment is encapsulated by the network layer into a packet which contains the segment as its payload and a network header. The packet is then encapsulated in a frame to be transmitted in the datalink layer.
0/4910 · 491
102
../../glossary.rst:27
English
LAN
0/100 · 3
102
../../principles/network.rst:382
English
`Label switching` enables a full control over the path followed by packets inside the network. Consider the network below and assume that we want to use two virtual circuits : `R1->R3->R4->R2->R5` and `R2->R1->R3->R4->R5`.
0/2220 · 222
102
../../principles/reliability.rst:353
English
The above FSM shows that the sender has to wait for an acknowledgment from the receiver before being able to transmit the next SDU. The figure below illustrates the exchange of a few frames between two hosts.
0/2090 · 209
102
../../principles/sharing.rst:472
English
Both hosts retransmit immediately and a new collision occurs
0/600 · 60