Recurrence method of teletraffic evaluation in series-parallel telecommunication nets

zbMATH Open0901.94002MaRDI QIDQ1925349FDOQ1925349

V. I. Neiman, Andrei Klimov, S. A. Kolbasyuk

Publication date: 15 December 1996

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

capacitystate probabilitiesexact recurrence methodserial-parallel telecommunication nets

Mathematics Subject Classification ID

Communication theory (94A05) Consumer behavior, demand theory (91B42) Communication networks in operations research (90B18)

   Recommendations

• The computation algorithm of capacity indices of the telecommunication networks with repeated transmissions 👍 👎
• Analysis of a Recurrence Arising from a Construction for Nonblocking Networks 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Recursive construction of parallel distribution networks 👍 👎
• Title not available (Why is that?) 👍 👎
• A heuristic procedure for calculating telecommunication transmission networks in consideration of network reliability 👍 👎
• Recurrent Method for Blocking Probability Calculation in Multi-service Switching Networks with BPP Traffic 👍 👎
• Matrix and Analytical Methods for Performance Analysis of Telecommunication Systems 👍 👎
• Routing properties of a recursive interconnection network 👍 👎

This page was built for publication: Recurrence method of teletraffic evaluation in series-parallel telecommunication nets

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