Exit Zen
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
../../principles/transport.rst:653
English
the `transport clock` must continue to be incremented even if the transport entity stops or reboots
0/990 · 99
117
../../glossary.rst:125
English
A TCP option used by a TCP entity in SYN segments to indicate the Maximum Segment Size that it is able to receive.
0/1140 · 114
117
../../principles/network.rst:513
English
One of the objectives of the `control plane` in the network layer is to maintain the routing tables that are used on all routers. As indicated earlier, a routing table is a data structure that contains, for each destination address (or block of addresses) known by the router, the outgoing interface over which the router must forward a packet destined to this address. The routing table may also contain additional information such as the address of the next router on the path towards the destination or an estimation of the cost of this path.
0/5450 · 545
117
../../principles/reliability.rst:410
English
`1101` is encoded as `11011`
0/280 · 28
117
../../principles/sharing.rst:546
English
Collisions with CSMA/CA
0/230 · 23
117
../../principles/transport.rst:659
English
Transport clock
0/150 · 15
118
../../glossary.rst:21
English
multicast
0/100 · 9
118
../../principles/network.rst:515
English
In this section, we discuss the main techniques that can be used to maintain the forwarding tables in a network.
0/1120 · 112
118
../../principles/reliability.rst:412
English
This parity scheme has been used in some RAMs as well as to encode characters sent over a serial line. It is easy to show that this coding scheme allows the receiver to detect a single transmission error, but it cannot correct it. However, if two or more bits are in error, the receiver may not always be able to detect the error.
0/3300 · 330
118
../../principles/sharing.rst:552
English
To deal with this problem, CSMA/CA relies on a backoff timer. This backoff timer is a random delay that is chosen by each device in a range that depends on the number of retransmissions for the current frame. The range grows exponentially with the retransmissions as in CSMA/CD. The minimum range for the backoff timer is :math:`[0,7*slotTime]` where the `slotTime` is a parameter that depends on the underlying physical layer. Compared to CSMA/CD's exponential backoff, there are two important differences to notice. First, the initial range for the backoff timer is seven times larger. This is because it is impossible in CSMA/CA to detect collisions as they happen. With CSMA/CA, a collision may affect the entire frame while with CSMA/CD it can only affect the beginning of the frame. Second, a CSMA/CA device must regularly sense the transmission channel during its back off timer. If the channel becomes busy (i.e. because another device is transmitting), then the back off timer must be frozen until the channel becomes free again. Once the channel becomes free, the back off timer is restarted. This is in contrast with CSMA/CD where the back off is recomputed after each collision. This is illustrated in the figure below. Host `A` chooses a smaller backoff than host `C`. When `C` senses the channel to be busy, it freezes its backoff timer and only restarts it once the channel is free again.
0/14030 · 1403
118
../../principles/transport.rst:662
English
It should be noted that `transport clocks` do not need and usually are not synchronized to the real-time clock. Precisely synchronizing real-time clocks is an interesting problem, but it is outside the scope of this document. See [Mills2006]_ for a detailed discussion on synchronizing the real-time clock.
0/3060 · 306
119
../../glossary.rst:23
English
a transmission mode where an information is sent efficiently to `all` the receivers that belong to a given group
0/1120 · 112
119
../../principles/dv.rst:7
English
Distance vector routing
0/230 · 23
119
../../principles/reliability.rst:414
English
Some coding schemes allow the receiver to correct some transmission errors. For example, consider the coding scheme that encodes each source bit as follows :
0/1570 · 157
119
../../principles/sharing.rst:559
English
Detailed example with CSMA/CA
0/290 · 29
119
../../principles/transport.rst:664
English
This `transport clock` can now be combined with an exchange of three segments, called the `three way handshake`, to detect duplicates. This `three way handshake` occurs as follows :
0/1810 · 181
120
../../glossary.rst:250
English
nameserver
0/100 · 10
120
../../principles/dv.rst:9
English
Distance vector routing is a simple distributed routing protocol. Distance vector routing allows routers to automatically discover the destinations reachable inside the network as well as the shortest path to reach each of these destinations. The shortest path is computed based on `metrics` or `costs` that are associated to each link. We use `l.cost` to represent the metric that has been configured for link `l` on a router.
0/4270 · 427
120
../../principles/reliability.rst:416
English
`1` is encoded as `111`
0/230 · 23