Both collision resolution mechanisms, presented above, are based on an adaptation of the transmission probability, explicitly calculated like in Pseudo-Bayesian algorithm or by a dynamical change of the contention window in the dynamic backoff mechanism, according to the current load situation or the collision probability in a network. Thus, by application of these mechanisms it is tried to avoid the collisions in next contention intervals. A third method for collision resolution can be defined as a procedure for collision resolving, which is carried out after a collision have been occurred. As an example of collision-resolving mechanisms, we consider a splitting algorithm, which divides the backlogged network stations into subsets, so far that all collisions are resolved [Walke99, RomSi90]. After a collision, all stations involved are divided into two subsets, according to a binary splitting algorithm. Each of the subsets can contain a number of collided stations or it can contain no collided stations. The stations of a subset get allocated an extra portion of the network capacity to retransmit the collided packets