Scheduling policies using marked/phantom slot algorithms

DOI10.1007/BF01158437zbMath0840.90065WikidataQ115149446 ScholiaQ115149446MaRDI QIDQ1906875

Vibhor Julka, Christos G. Cassandras

Publication date: 24 January 1996

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

perturbation analysissingle-server systemgolden ratio policyrandom pollingtransmission in packet radio networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items

Optimal control of multiclass parallel service systems, Online surrogate problem methodology for stochastic discrete resource allocation problem., Generalized surrogate problem methodology for online stochastic discrete optimization, Adaptive decentralized control under non-uniqueness of the optimal control

Cites Work

• Unnamed Item
• Unnamed Item
• Dominance relations in polling systems
• On the pathwise computation of derivatives with respect to the rate of a point process: The phantom RPA method
• Convergence of recursive optimization algorithms using infinitesimal perturbation analysis estimates
• Stochastic approximation methods for constrained and unconstrained systems
• Effect of model uncertainty on some optimal routing problems
• A golden ratio control policy for a multiple-access channel
• Rude-CSMA: A Multihop Channel Access Protocol
• Customer routing to parallel servers with different rates
• Smoothed (conditional) perturbation analysis of discrete event dynamical systems
• The Analysis of Random Polling Systems
• On sampling controlled stochastic approximation
• Sensitivity Analysis for Simulations via Likelihood Ratios
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Stochastic Estimation of the Maximum of a Regression Function
• A Stochastic Approximation Method