On the public citation graph

Periodic routing to parallel queues and billiard sequences

0 signed · 35 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-1-4615-4493-7_33openalex-snapshot
Applications of m-Balanced Sequences to Some Network Scheduling Problems
inferredcites →https://doi.org/10.1007/bf02099463openalex-snapshot
Complexity of trajectories in rectangular billiards
inferredcites →https://doi.org/10.1007/s001860300319openalex-snapshot
The unbalance and bounds on the average waiting time for periodic routing to one queue
inferredcites →https://doi.org/10.1016/0167-6377(92)90091-gopenalex-snapshot
Algorithms for generalized round robin routing
inferredcites →https://doi.org/10.1080/15326348908807106openalex-snapshot
Evaluation of regular splitting queues
inferredcites →https://doi.org/10.1109/9.855547openalex-snapshot
Admission control in stochastic event graphs
inferredcites →https://doi.org/10.1287/moor.10.4.543openalex-snapshot
Extremal Splittings of Point Processes
inferredcites →https://doi.org/10.1287/moor.1040.0131openalex-snapshot
Routing Jobs to Servers with Deterministic Service Times
inferredcites →https://doi.org/10.1287/moor.1040.0135openalex-snapshot
On the Average Waiting Time for Regular Routing to Deterministic Queues
inferredcites →https://doi.org/10.1287/moor.25.2.324.12230openalex-snapshot
Multimodularity, Convexity, and Optimization Properties
inferredcites →https://doi.org/10.2307/2286953openalex-snapshot
Fundamentals of Queueing Theory.
inferredcites →https://doi.org/10.24033/bsmf.2220openalex-snapshot
Complexity of sequences defined by billiard in the cube
inferredcites →https://doi.org/10.5555/314613.314623openalex-snapshot
Minimizing service and operation costs of periodic scheduling

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-03859-9_4openalex-snapshot
Deadline-Constrained Workflow Scheduling in Volunteer Computing Systems
inferred← citeshttps://doi.org/10.1007/s001860300319openalex-snapshot
The unbalance and bounds on the average waiting time for periodic routing to one queue
inferred← citeshttps://doi.org/10.1007/s00607-018-0598-5openalex-snapshot
Improving routing decisions in parallel non-observable queues
inferred← citeshttps://doi.org/10.1007/s11227-012-0826-2openalex-snapshot
Enhancing performance of failure-prone clusters by adaptive provisioning of cloud resources
inferred← citeshttps://doi.org/10.1007/s11227-012-0866-7openalex-snapshot
A proximity-aware load balancing in peer-to-peer-based volunteer computing systems
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.09.040openalex-snapshot
On the scheduling of operations in a chat contact center
inferred← citeshttps://doi.org/10.1016/j.future.2014.11.007openalex-snapshot
Cloud-aware data intensive workflow scheduling on volunteer computing systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.10.008openalex-snapshot
QoS and preemption aware scheduling in federated and virtualized Grid computing environments
inferred← citeshttps://doi.org/10.1016/j.orl.2018.04.001openalex-snapshot
Waiting time based routing policies to parallel queues with percentiles objectives
inferred← citeshttps://doi.org/10.1016/j.peva.2011.07.023openalex-snapshot
The price of forgetting in parallel and non-observable queues
inferred← citeshttps://doi.org/10.1109/edge62653.2024.00011openalex-snapshot
An Empirical Study on Edge-to-Cloud Continuum for Smart Applications: Performance, Design Patterns, and Key Factors
inferred← citeshttps://doi.org/10.1109/ems.2015.65openalex-snapshot
A Simulation Study of the Stochastic Compensation Effect for Packet Reordering in Multipath Data Streaming
inferred← citeshttps://doi.org/10.1109/hpcc.2012.49openalex-snapshot
Cloud Resource Provisioning to Extend the Capacity of Local Resources in the Presence of Failures
inferred← citeshttps://doi.org/10.1109/itc.2010.5608745openalex-snapshot
Optimal routing in parallel, non-observable queues and the price of anarchy revisited
inferred← citeshttps://doi.org/10.1134/s1064226920060182openalex-snapshot
Minimizing Mean Response Time in Nonobservable Distributed Processing Systems with Nodes Operating under Egalitarian Processor-Sharing Policy
inferred← citeshttps://doi.org/10.1134/s1064226921060176openalex-snapshot
New Policy for Routing Jobs to Unobservable Parallel Queues with FIFO Scheduling
inferred← citeshttps://doi.org/10.1142/s0217595915500153openalex-snapshot
A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information
inferred← citeshttps://doi.org/10.1214/14-ssy146openalex-snapshot
Control of Parallel Non-observable Queues: Asymptotic Equivalence and Optimality of Periodic Policies
inferred← citeshttps://doi.org/10.1287/moor.1040.0135openalex-snapshot
On the Average Waiting Time for Regular Routing to Deterministic Queues
inferred← citeshttps://doi.org/10.7148/2017-0667openalex-snapshot
Using Inter-Arrival Times For Scheduling In Non-Observable Queues
inferred← citeshttps://doi.org/10.7148/2020-0398openalex-snapshot
A Simple Dispatching Policy For Minimizing Mean Response Time In Non-Observable Queues With SRPT Policy Operating In Parallel
inferred← citeshttps://doi.org/10.7148/2021-0272openalex-snapshot
Minimizing Mean Response Time In Batch-Arrival Non-Observable Systems With Single-Server FIFO Queues Operating In Parallel
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.