| 自由接入信道中带优先级的二叉树分裂算法及其仿真 |
| |
| 引用本文： | 李欢欢,尹茂林,高飞.自由接入信道中带优先级的二叉树分裂算法及其仿真[J].计算机应用,2010,30(1):140-142. |
| |
| 作者姓名： | 李欢欢 尹茂林 高飞 |
| |
| 作者单位： | 1. 云南民族大学物理与电子电气信息工程学院2. 3. 云南民族大学物电学院 |
| |
| 基金项目： | 国家民委科研基金资助项目(08YN02);;云南省教育厅重点科研项目(08Z10983) |
| |
| 摘 要： | 提出了一种带优先级的二叉树分裂算法，使得高优先级的分组能以更大的概率接入信道，且不会出现分组的拥塞现象。分析了算法中影响优先级分组划分及传输效率的因素。通过计算机仿真实验，在双优先级条件下，改变到达率、初始接入概率、优先级的比重和重发概率时，对阻塞式接入和自由式接入信道系统的时延和吞吐率进行了分析。结果表明，算法具有较好的有效性和可靠性。
|
| 关 键 词： | 优先级 二叉树分裂算法 自由接入信道 计算机仿真 时隙 |
| 收稿时间： | 2009-07-07 |
| 修稿时间： | 2009-08-19 |
Split algorithm of binary tree with priority and its simulation under free access channel |
| |
| LI Huan-huan,YIN Mao-lin,GAO Fei.Split algorithm of binary tree with priority and its simulation under free access channel[J].journal of Computer Applications,2010,30(1):140-142. |
| |
| Authors: | LI Huan-huan YIN Mao-lin GAO Fei |
| |
| Abstract: | A modified binary-tree based algorithm with priority scheme was proposed in this paper.The algorithm can guarantee the priority service to access channel in high probability while avoiding congestion.The main factors that affect the grouping measure for priority services and its transmission efficiency were analyzed also in the paper.Computer simulation experiments were carried out under the condition of two priorities,while set different arrival rate,initial access probability,the proportion of high priori... |
| |
| Keywords: | binary tree algorithm free access channel computer simulation slot blocked channel |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
