多优先级业务通信网的阻塞性能分析算法  

Analytical Algorithms for Congestion Performance of Communication Network of Multi priority Traffic

作　　者：石铁山[1] 王楚[1] 

机构地区：[1]北京大学无线电电子学系

出　　处：《通信学报》1998年第3期68-73,共6页Journal on Communications

摘　　要：最短径通信网和多抢占优先级服务方式的研究对于网络规划和减少重载时的业务损失有重要意义。本文利用抢占优先级服务方式的特性和文献［１］的研究结果，建立所研究的具有任意种不同优先级业务最短径通信网的数学模型，导出不同优先级业务通信网点对点阻塞概率的迭代算法，并利用所得到的算法对一个通信网的性能进行了实例分析。本文给出的算法适用于任意多抢占优先级业务下的任意拓扑结构网络。The shortest routing communication network and multi priority have significant importance for network planning and traffic loss reducing under heavy loads.Making use of the characteristics of preemptive priority and the results of literature,this paper develops an analytical model for a shortest routing communication network and deuces algorithms for congestion performance analysis of the network of multi priority traffic .Numerical results demonstrate the applicability of the algorithms to topology forms of communications networks.

关 键 词：多优先级业务 通信网 阻塞 分析算法 

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