计算多级链路系统阻塞率的最小路集方法  

An approach to calculate block probability of multistage link system by using minimum pathset

作　　者：徐勇[1] 贾易荣[1] 项阳[1] 

机构地区：[1]长春邮电学院电信工程系

出　　处：《长春邮电学院学报》1995年第1期7-12,共6页Journal of Changchun Post and Telecommunication Institute

摘　　要：讨论了多级链路系统的结构及阻塞率计算问题，探讨了ＳＰＣ（程控交换机）数字交换网络的特点。通过定义李氏网络图的最小路集，给出计算复杂交换网络的阻塞率的最小路集算法。与传统方法相比，该算法简便高效，易于在计算机上实现，具有良好的实用价值。The structure of multistage link systems and the caiculation of their block probability is discussed.The characteristics of SPC digital switching network are specially outlined.Then by defining the minimum pathset used in net-work chart,a general algorithm is developed to calculate the block probability of a complex network.Compared with traditional methods for calculating the block probability,the algorithm derived in this paper is simple and effective,easily zealized on computer,and is well worthy of practical use.

关 键 词：程控交换机 多级链路系统 阻塞率 最小路集 

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