On the public citation graph

Job Dispatching Policies for Queueing Systems with Unknown Service Rates

https://doi.org/10.1145/3466772.3467047
0 signed · 39 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-387-49819-5_6openalex-snapshot
Multi-Armed Bandit Problems
inferredcites →https://doi.org/10.1007/s11134-012-9305-yopenalex-snapshot
Asymptotically tight steady-state queue length bounds implied by drift conditions
inferredcites →https://doi.org/10.1016/0196-8858(85)90002-8openalex-snapshot
Asymptotically efficient adaptive allocation rules
inferredcites →https://doi.org/10.1016/j.orl.2013.11.008openalex-snapshot
Two queues with non-stochastic arrivals
inferredcites →https://doi.org/10.1017/9781009179928openalex-snapshot
A Second Course in Probability
inferredcites →https://doi.org/10.1023/a:1013689704352openalex-snapshot
Finite-time Analysis of the Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1093/biomet/25.3-4.285openalex-snapshot
ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES
inferredcites →https://doi.org/10.1109/71.963420openalex-snapshot
The power of two choices in randomized load balancing
inferredcites →https://doi.org/10.1109/allerton.2018.8636001openalex-snapshot
On Learning the cμ Rule in Single and Parallel Server Networks
inferredcites →https://doi.org/10.1109/isit.2018.8437817openalex-snapshot
Learning Algorithms for Minimizing Queue Length Regret
inferredcites →https://doi.org/10.1109/sfcs.1996.548480openalex-snapshot
Load balancing and density dependent jump Markov processes
inferredcites →https://doi.org/10.1109/tcomm.2021.3118037openalex-snapshot
Regret of Age-of-Information Bandits
inferredcites →https://doi.org/10.1137/1119060openalex-snapshot
Time-Sharing Service Systems. I
inferredcites →https://doi.org/10.1145/2408776.2408794openalex-snapshot
The tail at scale
inferredcites →https://doi.org/10.1561/9781601986276openalex-snapshot
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
inferredcites →https://doi.org/10.2307/3213411openalex-snapshot
On the optimal assignment of customers to parallel servers
inferredcites →https://doi.org/10.23919/wiopt.2017.7959911openalex-snapshot
Learning for serving deadline-constrained traffic in multi-channel wireless networks
inferredcites →https://doi.org/10.48550/arxiv.1111.1797openalex-snapshot
Analysis of Thompson Sampling for the multi-armed bandit problem
inferredcites →https://doi.org/10.48550/arxiv.2008.08830openalex-snapshot
Optimal Load Balancing in Bipartite Graphs
inferredcites →https://doi.org/10.5555/306902.306921openalex-snapshot
A comparative study of load sharing in heterogeneous multicomputer systems
inferredcites →https://doi.org/10.5860/choice.45-2661openalex-snapshot
A second course in probability

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4090021openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-031-31597-8_4openalex-snapshot
Learning Network Decisions
inferred← citeshttps://doi.org/10.1049/cim2.12098openalex-snapshot
Simulation‐based optimisation for order release of printed circuit board workshop with process switching constraints
inferred← citeshttps://doi.org/10.1109/allerton49937.2022.9929406openalex-snapshot
Learning-based Optimal Admission Control in a Single Server Queuing System
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228901openalex-snapshot
Learning to Schedule Tasks with Deadline and Throughput Constraints
inferred← citeshttps://doi.org/10.1109/infocomwkshps65812.2025.11152765openalex-snapshot
The Merit of Simple Policies: Buying Performance With Parallelism and System Architecture
inferred← citeshttps://doi.org/10.1109/lcsys.2024.3516637openalex-snapshot
Data-Driven Adaptive Dispatching Policies for Processing Networks
inferred← citeshttps://doi.org/10.1109/nfv-sdn66355.2025.11349597openalex-snapshot
Adaptive Decentralized Queue Disclosure for Impatient Tenants in Edge and Non-terrestrial Systems
inferred← citeshttps://doi.org/10.1109/tnet.2022.3227136openalex-snapshot
Optimal Routing to Parallel Servers With Unknown Utilities—Multi-Armed Bandit With Queues
inferred← citeshttps://doi.org/10.1109/tnet.2024.3374755openalex-snapshot
When Lyapunov Drift Based Queue Scheduling Meets Adversarial Bandit Learning
inferred← citeshttps://doi.org/10.1109/tnet.2024.3425617openalex-snapshot
Online Task Scheduling and Termination With Throughput Constraint
inferred← citeshttps://doi.org/10.1109/vtc2024-spring62846.2024.10683365openalex-snapshot
Multi-Armed Bandit Based Learning Algorithms for Offloading in Queueing Systems
inferred← citeshttps://doi.org/10.1145/3569951.3593605openalex-snapshot
Airavata Metascheduler: A Reliable, Fault Tolerant, and Resource-Aware Job Scheduling Service
inferred← citeshttps://doi.org/10.1145/3700413openalex-snapshot
Adversarial Network Optimization under Bandit Feedback: Maximizing Utility in Non-Stationary Multi-Hop Networks
inferred← citeshttps://doi.org/10.1145/3788103openalex-snapshot
Stochastic Network Utility Maximization in Strategic Queueing Systems: A Game-Theoretic Approach
inferred← citeshttps://doi.org/10.1214/24-aap2090openalex-snapshot
Mean-field analysis for load balancing on spatial graphs
inferred← citeshttps://doi.org/10.1609/aaai.v38i12.29306openalex-snapshot
Decentralized Scheduling with QoS Constraints: Achieving O(1) QoS Regret of Multi-Player Bandits
inferred← citeshttps://doi.org/10.23919/itc-3665175.2025.11078624openalex-snapshot
Dispatching Odyssey: Exploring Performance in Computing Clusters under Real-world Workloads
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.