On Poisson traffic processes in discrete-state Markovian systems by applications to queueing theory

DOI10.2307/1426775MaRDI QIDQ4174052zbMATH OpenOpenAlexFDO

Authors Benjamin Melamed

Publication date 1979

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1426775

zbMATH Keywords

Queueing TheoryDiscrete-State Markovian SystemsPointwise Independence of Traffic And StatePoisson TrafficQueueing Network Decomposition

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cited in

(9)

• Markovian network processes: Congestion-dependent routing and processing
• Mathematical theory of queueing networks
• Filtering formulas and the ./M/1 queue in a quasireversible network
• Optimization of data distributed network system under uncertainty
• Theory of queuing networks and its applications to the analysis of information-computing systems
• Algorithm of balance equations decomposition and investigation of Poisson flows in Jackson networks
• Interconnections of Markov chains and quasi-reversible queuing networks
• Characteristics of queueing systems observed at events and the connection between stochastic intensity and Palm probability
• Analysis of Jackson networks with infinite supply and unreliable nodes

This page was built for publication: On Poisson traffic processes in discrete-state Markovian systems by applications to queueing theory

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