| 二叉树形冲突分解算法研究 |
| |
| 引用本文： | 赵东风,李必海,郑苏民.二叉树形冲突分解算法研究[J].电子科技大学学报(社会科学版),1996(Z2). |
| |
| 作者姓名： | 赵东风 李必海 郑苏民 |
| |
| 作者单位： | 云南大学信息与电子科技系 |
| |
| 基金项目： | 国家科委863高科技项目 |
| |
| 摘 要： | 采用了一种新的二叉树形算法分析技术，对随机存取系统中报文分组冲突分解进行了研究，得到了冲突报文分组平均分解次数的解析式和动态吞吐率和静态吞吐率的解析式。给出了报文分组冲突分解的计算机模拟实验值。改进了Ｊ．Ｉ．Ｃａｐｅｔａｎａｋｉｓ的二叉树形冲突分解算法分析。
|
| 关 键 词： | 随机存取系统 二叉树形算法 报文分组冲突分解 吞吐率 |
Study on Two-Ary Trees Algorithms of Packet Conflict Resolution for Random Access Channels |
| |
| Zhao Dongfeng,Li Bihai,Zheng Sumin.Study on Two-Ary Trees Algorithms of Packet Conflict Resolution for Random Access Channels[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),1996(Z2). |
| |
| Authors: | Zhao Dongfeng Li Bihai Zheng Sumin |
| |
| Abstract: | This peper presents a method of packet conflict resolution to analyze random accesschannels. The mean times of packet conflict resolution are explicitly obtained. The analytical formulae of the throughputs for dynamic and static algorithms are provided. Also ,the simulation resultS are given in thispaper. The contentions resolving tree algorithms obtained by J. I. Capetanakis are revised . |
| |
| Keywords: | random access channel two-ary tree algorithm pocket conflict resolution throughput |
| 本文献已被 CNKI 等数据库收录！ |
