Insensitivity in processor-sharing networks

DOI10.1016/S0166-5316(02)00110-4zbMath1043.68004OpenAlexW2074637591MaRDI QIDQ4788418

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)

Related Items

Insensitive versus efficient dynamic load balancing in networks without blocking, Optimal heavy-traffic queue length scaling in an incompletely saturated switch, Tail asymptotics for processor-sharing queues, Some Time-Dependent Properties of Symmetric M/G/1 Queues, Additive functionals with application to sojourn times in infinite-server and processor sharing systems, Biased Processor Sharing in Fork-Join Queues, Resource sharing networks: Overview and an open problem, Optimal queue-size scaling in switched networks, Insensitive traffic models for communication networks, Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing, Insensitive, maximum stable allocations converge to proportional fairness, On sojourn times in \(M/GI\) systems under state-dependent processor sharing, Sojourn time asymptotics in processor-sharing queues, A Note on Insensitivity in Stochastic Networks, Towards an Erlang formula for multiclass networks, Insensitivity of the mean field limit of loss systems under SQ(d) routeing, Waiting times for \(M/M\) systems under state-dependent processor sharing, Semi-Product-Form Solution for PEPA Models with Functional Rates, On product form tandem structures, Separable solutions for Markov processes in random environments