In this paper,a convolution algorithm for the state probability of DNHR (Dynamic NonHierarchical Routing) networks with access control is presented. As its application, theoretical perfor- mance characteristics that ...In this paper,a convolution algorithm for the state probability of DNHR (Dynamic NonHierarchical Routing) networks with access control is presented. As its application, theoretical perfor- mance characteristics that show time congestion,call congestion and traffic congestion for call attempts between any pair of switching centers are determined.展开更多
文摘In this paper,a convolution algorithm for the state probability of DNHR (Dynamic NonHierarchical Routing) networks with access control is presented. As its application, theoretical perfor- mance characteristics that show time congestion,call congestion and traffic congestion for call attempts between any pair of switching centers are determined.
