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

DOI10.2307/1426775zbMath0392.60075OpenAlexW2059712268MaRDI QIDQ4174052

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)

Related Items

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