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

DOI10.1007/BF02411485zbMath0696.60092MaRDI QIDQ910836

Yu. M. Sukhov, M. Ya. Kel'bert

Publication date: 1990

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

open queueing networkspacket-switching networksdecay of dependenceexternal message flowsWeak dependence properties

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cites Work

• Unnamed Item
• Unnamed Item
• Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs
• Circuit-switching networks with priorities on a one-dimensional lattice
• The stability of infinite-server networks with random routing

This page was built for publication: On a class of packet-switching networks on an infinite graph