Queueing and scheduling in random environments

DOI10.1239/aap/1077134474zbMath1064.60182OpenAlexW2023515481MaRDI QIDQ4464177

Nicholas Bambos, George Michailidis

Publication date: 27 May 2004

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1077134474

zbMATH Keywords

computer networkbandwidth allocationdynamic schedulingstability of queuesprocessing network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Processes in random environments (60K37) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (11)

Asymptotics for \(p\)-value based threshold estimation under repeated measurements ⋮ OPTIMIZING DATA THROUGHPUT IN CLIENT/SERVER SYSTEMS BY KEEPING QUEUE SIZES BALANCED ⋮ Dynamic power control in a fading downlink channel subject to an energy constraint ⋮ Control of multi-node mobile communications networks with time-varying channels via stability methods ⋮ Monotone Emulation of Computer Experiments ⋮ Erlang loss queueing system with batch arrivals operating in a random environment ⋮ Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes ⋮ A two-stage hybrid procedure for estimating an inverse regression function ⋮ A queueing analysis of max-min fairness, proportional fairness and balanced fairness ⋮ Dynamic scheduling for switched processing systems with substantial service-mode switching times ⋮ Stability of spatial queueing systems

Cites Work

• Sample-path analysis of queueing systems
• Queueing dynamics and maximal throughput scheduling in switched processing systems
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
• ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES
• On Mutually Interfering Parallel Servers Subject to External Disturbances
• Dynamic server allocation to parallel queues with randomly varying connectivity
• Scheduling and performance limits of networks with constantly changing topology
• Dynamic on-line task scheduling on parallel processors
• ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Queueing and scheduling in random environments