Discrete Random Contention System with Variable Packet Length Based on Binary Tree Conflict Resolution Algorithm

Abstract

The paper researches the random contention system based on the binary tree conflict resolution algorithm to improve the throughput in-depth using the average cycle method, then gets the formulas of the systemic throughput and so on. The simulation results verify the correctness of the theory, meanwhile, gets some conclusions that the different arrival rate G is how to affect the main source of the throughput with variable packet length. It has some researching significance and improves the system performance.