Circuit-switching networks with priorities on a one-dimensional lattice

DOI10.2307/3214397zbMath0713.60096OpenAlexW2313762691MaRDI QIDQ3198664

Rahim Shamsiev

Publication date: 1989

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

Poisson point processnetwork with infinitely many nodes

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

On a class of packet-switching networks on an infinite graph

This page was built for publication: Circuit-switching networks with priorities on a one-dimensional lattice