MODELLING OF COMPUTER COMMUNICATION NETWORKS VIA PROBABILISTIC AUTOMATA

DOI10.1108/EB005548MaRDI QIDQ3865532zbMATH OpenOpenAlexFDO

Authors 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

computer communication networksnetwork probability transition matrixprobabilistic automataqueueing

Mathematics Subject Classification ID

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

Cites work

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

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

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