Insensitivity in processor-sharing networks

DOI10.1016/S0166-5316(02)00110-4MaRDI QIDQ4788418zbMATH OpenOpenAlexFDO

Authors Thomas Bonald, Alexandre Proutiere

Publication date 21 January 2003

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-5316(02)00110-4

zbMATH Keywords

Whittle network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 4137158
• Insensitivity of the stationary distribution of state probabilities in an open network with non-active customers
• A Note on Insensitivity in Stochastic Networks
• Insensitive bandwidth sharing in data networks
• Insensitivity in stochastic models

Cited in

(28)

• Waiting times for \(M/M\) systems under state-dependent processor sharing
• Feedback invariant discipline and insensitivity in closed queueing networks
• Towards an Erlang formula for multiclass networks
• Insensitive versus efficient dynamic load balancing in networks without blocking
• On sojourn times in M/GI systems under state-dependent processor sharing
• Semi-product-form solution for PEPA models with functional rates
• Insensitive traffic models for communication networks
• INSENSITIVITY OF A FRONT-END WEB SYSTEM
• scientific article; zbMATH DE number 4137158 (Why is no real title available?)
• Optimal heavy-traffic queue length scaling in an incompletely saturated switch
• Insensitivity of the mean field limit of loss systems under \(\mathrm{SQ}(d)\) routeing
• Insensitive, maximum stable allocations converge to proportional fairness
• Some Time-Dependent Properties of Symmetric M/G/1 Queues
• Insensitive bandwidth sharing in data networks
• Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
• Optimal queue-size scaling in switched networks
• On Kelly networks with shuffling
• On stochastic bounds for monotonic processor sharing networks
• Insensitive load balancing in data networks
• Resource sharing networks: overview and an open problem
• Separable solutions for Markov processes in random environments
• Tail asymptotics for processor-sharing queues
• Biased Processor Sharing in Fork-Join Queues
• Stability of Processor Sharing Networks with Simultaneous Resource Requirements
• Sojourn time asymptotics in processor-sharing queues
• Additive functionals with application to sojourn times in infinite-server and processor sharing systems
• A Note on Insensitivity in Stochastic Networks
• On product form tandem structures

This page was built for publication: Insensitivity in processor-sharing networks

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