摘要
本文就计算机局部网中，一种新的＂竞争－冲突淘汰＂存取方式的系统模型简述分类，并就Ⅰ类系统模型进行了性能评价。就顾客平均数，顾客源数Ｎ，每个顾客源请求服务的概率ｐ提出了简洁有效的关系式＝Ｎ－１／ｐ＋１。
In this paper,A new systematic model for access mode of 'contention-collision cancellation' in LAN has been simply catalogued. The performance judgement ofr I type systematic model has also been finished. Then the simple and effective formulation M= N- 1/p + 1 is given.(M: the average number of customers;N :the source number of customers; P:the probability of each customer source for requesting service).
出处
《电子学报》
EI
CAS
CSCD
北大核心
1995年第9期115-117,共3页
Acta Electronica Sinica
