MODELLING OF COMPUTER COMMUNICATION NETWORKS VIA PROBABILISTIC AUTOMATA

DOI10.1108/EB005548zbMath0428.68107OpenAlexW2063971189MaRDI QIDQ3865532

Carol A. Niznik

Publication date: 1980

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/eb005548

zbMATH Keywords

queueingcomputer communication networksprobabilistic automatanetwork probability transition matrix

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computing methodologies and applications (68U99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Cites Work

• On the Probability of Buffer Overflow Under an Arbitrary Bounded Input-Output Distribution
• Communication between two self-organizing systems modelled by controlled Markov chains

This page was built for publication: MODELLING OF COMPUTER COMMUNICATION NETWORKS VIA PROBABILISTIC AUTOMATA