摘要
建立了1坚持指数退避算法的CSMA/CD协议的离散时间排队模型,基于该模型分析了网络吞吐量(S)、等待时间(W)等性能指标,并通过建立相应的马尔可夫链(MarkovChain),计算了信道忙的概率及产生冲突的概率。
The model of discrete-time queueing network system for1persistent CSMA/CD protocol with exponential back off is presented,the performance of throughput (S)and waiting time for this protocol is analyzed,with Markov chain,the probability of channel being busy and the probability of being collision is computed.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第5期51-52,73,共3页
Computer Engineering and Applications
基金
国家自然科学基金资助项目(编号:9871072)
