SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Insensitivity of proportional fairness in critically loaded bandwidth sharing networks
12 references·3 citing·36 second hop
Insensitivity of proportional fairness in critically loaded bandwidth sharing networks (2026)Insensitivity of proportional fairness in…A Stochastic Network Under Proportional Fair Resource Control—Diffusion Limit with Multiple Bottlenecks (2012)A Stochastic Network Under Pr…Resource pooling in congested networks: proportional fairness and product form (2009)Resource pooling in congested…MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic (2004)MaxWeight scheduling in a gen…Fundamentals of Queueing Networks (2001)Fundamentals of Queueing Netw…Brownian models of open processing networks: canonical representation of workload (2000)Brownian models of open proce…State space collapse with application to heavy traffic limits for multiclass queueing networks (1998)State space collapse with app…Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse (1998)Diffusion approximations for …Heavy tail modeling and teletraffic data: special invited paper (1997)Heavy tail modeling and telet…Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks (1996)Convergence to equilibria for…Heavy Tail Modelling and Teletraffic Data (1995)Heavy Tail Modelling and Tele…Multidimensional Reflected Brownian Motions Having Exponential Stationary Distributions (1987)Multidimensional Reflected Br…Applied Probability and Queues (1987)Applied Probability and QueuesStochastic Processing Networks (2016)Stochastic Processing NetworksA comparative analysis of the successive lumping and the lattice path counting algorithms (2016)A comparative analysis of the…Concave switching in single and multihop networks (2014)Concave switching in single a…Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks (1992)Dynamic server allocation to parallel queues with randomly varying connectivity (1993)Achieving 100% throughput in an input-queued switch (2002)Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule (2004)SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES (2004)Maximum Pressure Policies in Stochastic Processing Networks (2005)THE ESTIMATION AND APPLICATION OF LONG MEMORY TIME SERIES MODELS (1983)Extreme Values, Regular Variation and Point Processes (1987)Modelling of extremal events in insurance and finance (1994)A Dynamic Mixture Model for Unsupervised Tail Estimation without Threshold Selection (2002)The extremogram: A correlogram for extreme events (2009)Extreme Value Theory and Statistics of Univariate Extremes: A Review (2014)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Open Queueing Networks in Heavy Traffic (1984)On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models (1995)The Stability of Two-Station Multitype Fluid Networks (2000)The fluid limit of a heavily loaded processor sharing queue (2002)Dynamic Server Allocation for Queueing Networks with Flexible Servers (2003)Brownian Models of Queueing Networks with Heterogeneous Customer Populations (1988)A broader view of Brownian networks (2003)Pathwise optimality of the exponential scheduling rule for wireless channels (2004)Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse (2012)Piecewise-Deterministic Markov Processes: A General Class of Non-Diffusion Stochastic Models (1984)On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design (2004)Multiple channel queues in heavy traffic. I (1970)Stability of Queueing Networks (2008)Asymptotically tight steady-state queue length bounds implied by drift conditions (2012)Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization (2004)A survey of retrial queueing systems (2015)Pricing in Ride-Share Platforms: A Queueing-Theoretic Approach (2015)Limit theory for bilinear processes with heavy-tailed noise (1996)Discussion of the Danish Data on Large Fire Insurance Losses (1997)Brownian models of multiclass queueing networks: Current status and open problems (1993)Queueing theory in manufacturing: A survey (1999)Stochastic Portfolio Theory (2002)Asset Pricing with Heterogeneous Consumers (1996)
this work references cited by second hop

References

  • 1987Applied Probability and Queues2,704 cited
  • 2001Fundamentals of Queueing Networks530 cited
  • 2004MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic460 cited
  • 1998State space collapse with application to heavy traffic limits for multiclass queueing networks309 cited
  • 1997Heavy tail modeling and teletraffic data: special invited paper288 cited
  • 1998Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse264 cited
  • 1987Multidimensional Reflected Brownian Motions Having Exponential Stationary Distributions236 cited
  • 2000Brownian models of open processing networks: canonical representation of workload223 cited
  • 1995Heavy Tail Modelling and Teletraffic Data186 cited
  • 1996Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks135 cited
  • 2012A Stochastic Network Under Proportional Fair Resource Control—Diffusion Limit with Multiple Bottlenecks52 cited
  • 2009Resource pooling in congested networks: proportional fairness and product form46 cited

Cited by

  • 2016Stochastic Processing Networks25 cited
  • 2014Concave switching in single and multihop networks21 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

  • 2016A comparative analysis of the successive lumping and the lattice path counting algorithms12 cited