A Note on Insensitivity in Stochastic Networks

DOI10.1239/JAP/1175267175MaRDI QIDQ5443713zbMATH OpenOpenAlexFDO

Authors Stan Zachary

Publication date 22 February 2008

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

Full work available at URL https://arxiv.org/abs/math/0611526

zbMATH Keywords

insensitivitymulti-class networkspartial balance

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18)

Abstract: We give a simple and direct treatment of insensitivity in stochastic networks which is quite general and which provides probabilistic insight into the phenomenon. In the case of multi-class networks, the results generalise those of Bonald and Proutiere (2002, 2003).

Recommendations

• Insensitivity in stochastic models
• Insensitivity in processor-sharing networks
• Flow-level convergence and insensitivity for multi-class queueing networks
• scientific article; zbMATH DE number 4137158
• Insensitivity with age-dependent routing

Cites work

• Blocking probabilities in large circuit-switched networks
• scientific article; zbMATH DE number 425394 (Why is no real title available?)
• scientific article; zbMATH DE number 3134646 (Why is no real title available?)
• scientific article; zbMATH DE number 3901778 (Why is no real title available?)
• scientific article; zbMATH DE number 4070002 (Why is no real title available?)
• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• scientific article; zbMATH DE number 1350310 (Why is no real title available?)
• Insensitive bandwidth sharing in data networks
• Insensitivity in processor-sharing networks
• Insensitivity in queueing systems
• Insensitivity of blocking probabilities in a circuit-switching network
• Insensitivity of steady-state distributions of generalized semi-Markov processes by speeds
• P433-444
• Partial balance and insensitivity
• Two remarks on insensitive stochastic models

Cited in

(16)

• Precise estimates of persistence time for SIS infections in heterogeneous populations
• Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints
• On sojourn times in M/GI systems under state-dependent processor sharing
• Choosing among heterogeneous server clouds
• Insensitive traffic models for communication networks
• On expected durations of birth-death processes, with applications to branching processes and SIS epidemics
• Insensitivity in stochastic models
• Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
• Insensitivity with age-dependent routing
• Additive functionals with application to sojourn times in infinite-server and processor sharing systems
• Optimal queue-size scaling in switched networks
• On the rate of convergence for infinite server Erlang-Sevastyanov's problem
• Insensitivity in processor-sharing networks
• Flow-level convergence and insensitivity for multi-class queueing networks
• Resource sharing networks: overview and an open problem
• Asymptotic persistence time formulae for multitype birth–death processes

This page was built for publication: A Note on Insensitivity in Stochastic Networks

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