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

DOI10.2307/3214397MaRDI QIDQ3198664zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4041596
• Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs
• On a class of packet-switching networks on an infinite graph
• One-dimensional circuit-switched networks
• Perturbation theory approach for a class of hybrid switching networks with small transit flows

Cited in

(3)

• scientific article; zbMATH DE number 4041596 (Why is no real title available?)
• On a class of packet-switching networks on an infinite graph
• Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs

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

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