最优预约信息包树形分解协议的研究  

Optimization Study of Tree Algorithms for Conflict Resolution

作　　者：石晶林[1] 赵东风[1] 李必海[1] 郑苏民[1] 

机构地区：[1]云南大学信息与电子科学系

出　　处：《云南大学学报（自然科学版）》1996年第1期65-70,共6页Journal of Yunnan University(Natural Sciences Edition)

基　　金：云南省应用基础研究基金

摘　　要：研究一点多址通信网络系统中信息包随机访问信道的树形冲突分解协议．对树形计算法做了推广，提出采用３个预约时隙和采用２个或３个动态预约时隙相结合信息包冲突分解方案；并用随机过程的分析方法对其进行了分析，得到了预约信道吞吐量和信道延迟特性．与双预约时隙比较，后两种方案延迟和系统稳定性得到明显改善．在对协议进行分析的基础上，进行了计算机模拟，证明了理论分析的正确性．Probeinto the best schemes of conflict- resolving tree algorithms for reservation packets. Based on the former research, some improved schemes which use three reservation slots and two or three dynamic disposal reservation slots are provided. They are analyzed for specific probabilistic source's model with stochastic process' method. Analytic formulae for the mean epoch length when there are N conflict reserved packets are derived. On the basis of these, the throughput of channel is got.

关 键 词：树形协议 出现期 冲突分解 多址通信系统 

分 类 号：TN914.5[电子电信—通信与信息系统]