Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing Plan

DOI10.1109/TCOM.1980.1094644zbMATH Open0422.94024OpenAlexW2098563405MaRDI QIDQ3856597FDOQ3856597

Authors: W. S. Chan 

Publication date: 1980

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1980.1094644

zbMATH Keywords

algorithms for computing end-to-end blocking probabilities in a network with alternate routingarbitrary routing planshierarchical routing planslink blocking probabilitiespredictive routing planssingle-loss-route routing planstandem-node-matrix-generated routing plansterminal-pair reliability problem

Mathematics Subject Classification ID

Reliability and life testing (62N05) Communication, information (94A99)

Cited In (1)

• One moment model for telephone traffic

This page was built for publication: Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing Plan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3856597)