Discrete Random Contention System with Variable Packet Length Based on Binary Tree Conflict Resolution Algorithm
Jing Nan, Hongwei Ding, Yingying Guo, Qianlin Liu
Available Online May 2014.
- https://doi.org/10.2991/lemcs-14.2014.142How to use a DOI?
- the average cycle method; improved binary tree conflict resolution algorithm; throughput; discrete random contention system; arrival rate
- 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.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Jing Nan AU - Hongwei Ding AU - Yingying Guo AU - Qianlin Liu PY - 2014/05 DA - 2014/05 TI - Discrete Random Contention System with Variable Packet Length Based on Binary Tree Conflict Resolution Algorithm BT - International Conference on Logistics Engineering, Management and Computer Science (LEMCS 2014) PB - Atlantis Press SN - 1951-6851 UR - https://doi.org/10.2991/lemcs-14.2014.142 DO - https://doi.org/10.2991/lemcs-14.2014.142 ID - Nan2014/05 ER -