CSMA/CD uses a binary exponential backoff algorithm, also known as a binary exponential backoff algorithm. The backoff algorithm is based on the size of the collision window, and each node has a collision counter C. The backoff time has an exponential relationship with the number of collisions. The more collisions, the longer the backoff time. If the number of conflicts is reached, the node stops sending data.
Binary Exponential Back off. Refers to the site repeating transmissions in the event of repeated collisions, but after each collision, the average of the delays is doubled. The binary exponential backoff algorithm provides a way to handle heavy loads. Repeated attempts to transmit will result in a longer backoff time, which will help smooth the load. Without such a backoff, the following situation can occur: two or more sites attempting to transmit at the same time, which will result in a collision, and then these sites immediately try to retransmit, resulting in a new collision.
In the CSMA/CD protocol, once a collision is detected, in order to reduce the probability of re-collision, it is necessary to wait for a random time and then attempt to transmit using the CSMA method. In order to ensure that this backoff is stable, a binary exponential backoff algorithm is used. The algorithm process is as follows:
1. Determine the basic backoff time, generally the end-to-end round-trip time is 2t, 2t also becomes the conflict window or contention period.
2. Define the parameter k, k related to the number of collisions, specifying that k cannot exceed 10, k = Min [number of collisions, 10]. When the number of collisions is greater than 10 and less than 16, k does not increase any more, and the value is always 10.
3. Randomly fetch a number r from the discrete integer set [0,1,2,...,(2^k-1)], waiting for a delay of r times the basic backoff time, equal to rx 2t. The value range of r is related to the number of collisions k, and the optional random value of r is 2^k, which is also the cause of the binary backoff algorithm.
4. When the number of collisions is greater than 10, one of them is randomly selected from 0-2^10-1 2t as the waiting time.
5. When the number of collisions exceeds 16 times, the transmission fails, the transmitted frame is discarded, and an error report is sent.
Example
If the second collision occurs:
n = 2
k = MIN(2,10) = 2
R = {0, 1, 2, 3)
Delay time = R * 512 * Bit-time
Where: Bit-time = 1 / Debit
E.g:
For the transmission rate Debit = 10 Mbit/s,
Then Bit-time = 0.1 us
Delay time = {0, 51.2 us, 102.4 us, 153.6 us}
Stator Core welding is a important process for stator core assembly. We are able to use TIG, MIG, LASER weld to meet different requirement for customers. The stator core is an important part of the stator and the main component of the magnetic circuit of the motor. Different sizes of stator cores have different technological processes and application fields. For example, small-sized stator cores are usually assembled by interlocking, and the outer diameter is usually less than 200mm. Large-sized stators are assembled in different ways depending on the motor design, such as stator core by cleating and staor core by welding.
Stator Core By Welding,Stator Iron Core,Bldc Stator Core,Laminated Stator Core
Henan Yongrong Power Technology Co., Ltd , https://www.hnyongrongglobal.com