Loss circuit switched communication network -- performance analysis and dynamic routing

DOI10.1007/BF01158931zbMath0780.90051MaRDI QIDQ1801809

Vladimir Marbukh

Publication date: 17 August 1993

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

zbMATH Keywords

metastabilityperformance analysisblocking probabilitytrunk reservationaggregated Markov chainbifurcation diagram of the networkcatastrophic phenomenaloss circuit switched communication networkstate-dependent dynamic routing

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (3)

Choosing among heterogeneous server clouds ⋮ Stochastic networks with multiple stable points ⋮ The equilibrium states of large networks of Erlang queues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Investigation of a fully connected channel switching network with many nodes and alternative routes
• Fully connected message-switching network with a large number of nodes, bypass routes, and a limited number of waiting places at nodes
• Phenomenological approach to reduced description of large-scale systems. I: Description of the approach
• Asymptotic investigation of a complete communications network with a large number of points and bypass routes
• State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
• Dynamic Routing in Fully Connected Networks
• Blocking probabilities in large circuit-switched networks
• State-dependent routing on symmetric loss networks with trunk reservations. I

This page was built for publication: Loss circuit switched communication network -- performance analysis and dynamic routing