Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process

DOI10.1016/0304-4149(86)90007-4zbMath0607.60086MaRDI QIDQ1085528

David J. Aldous

Publication date: 1986

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: http://www.escholarship.org/uc/item/8m27t6b9

zbMATH Keywords

heavy traffic limits; dynamic storage allocation; parking model

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

60K25: Queueing theory (aspects of probability theory)

Related Items

Closest open location rule under stochastic demand, A dynamic storage process, First-fit allocation of queues: Tight probabilistic bounds on wasted space, A provably efficient algorithm for dynamic storage allocation, Sunset over Brownistan, Asymptotic expansions for a stochastic model of queue storage, A simple direct solution to a storage allocation model, Geometrical Optics and Models of Computer Memory Fragmentation, The distribution of wasted spaces in the M/M/∞ queue with ranked servers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
• Extremes and related properties of random sequences and processes
• Wandering random measures in the Fleming-Viot model
• Priority queues
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• A stochastic model of neural response
• Heavy Traffic Limit Theorems for Queues: A Survey
• Weak convergence in queueing theory
• An introduction to synergetics
• Convergence of stochastic processes