← Back to selected research
Open-Source Software · QueueSimLab v0.2.0

QueueSimLaboratory

I developed QueueSimLab by extending a supermarket-queueing course project into a reusable MATLAB framework. It supports reproducible experiments on single queues and open queueing networks, with tools for comparing operating policies, staffing decisions, and network configurations.

TypeIndependent open-source project
Releasev0.2.0 · October 2026
TechnologyBase MATLAB R2022b
LicenseMIT License
89/89Acceptance tests passed
3Benchmark families
23Integrated metric rows
QueueSimLab workflow from arrival sources through an open queueing network to metrics, diagnostics, and reports
Project architecture · based on the public v0.2.0 configuration and reporting workflow
Reading the diagram

An arrival source feeds a service network. Each node can have its own service rule, number of servers, capacity, and routing behavior. The simulator records both node-level and end-to-end performance, checks flow consistency and bottlenecks, and exports reproducible tables, figures, and reports.

Independent project authored and maintained by Jiajun Xia. The public repository, versioned release, documentation, tests, and reproducible benchmark scripts are available on GitHub.

From one queueing exercise to a reusable experimental framework.

The project began as a course assignment about supermarket checkout lines. I wanted to move beyond a single hard-coded scenario and build a tool that could answer broader operational questions: Should customers share one line or choose among several? Where should an extra server be placed in a multi-stage service process? How does uneven routing change congestion as demand increases?

I reorganized the model around configuration objects, separate simulation engines, reusable statistics, and scripted experiments. This made it possible to change arrival processes, service rules, queue policies, network topology, and staffing without rewriting the core event logic.

My contribution

I independently designed the software architecture, implemented the simulation and analysis modules, built the test suite and benchmark workflows, wrote the technical documentation, and prepared the v0.2.0 public release.

Configurable queues, service rules, and open networks.

Systems

Queue structures

Single- and multi-server FIFO queues, pooled or dedicated lines, finite capacity, rejection, and heterogeneous server speeds.

Inputs

Arrival and service laws

Poisson, explicit-schedule, and supported renewal arrivals with exponential, deterministic, uniform, lognormal, or explicit service times.

Decisions

Routing policies

Random assignment, shortest queue, and estimated-wait or workload routing for dedicated queues and network branches.

Networks

Multi-stage flow

Open directed acyclic networks with probabilistic routing, fixed transfer delays, and per-node as well as end-to-end metrics.

Project capability illustration
Dedicated Random, Pooled FIFO, and Dedicated Smart queue policies supported by QueueSimLab
Benchmark A compares three ways of organizing the same service capacity. Matched external arrivals and service requirements support a controlled policy comparison.

Three reproducible demos connect the model to operating decisions.

The benchmark suite separates three questions instead of combining them into one loosely controlled comparison.

BenchmarkDecision questionSelected outputs
A · Queue policyHow does line organization change congestion?Mean and P95 wait, utilization, mechanism traces, load and staffing sweeps
B · Network staffingWhich service stage benefits most from one extra server?Node offered load, observed wait, flow checks, paired staffing gain
C · Topology × demandHow do routing concentration and demand interact?End-to-end journey time and node-level bottleneck warnings
Reproducible demo map
QueueSimLab Benchmarks A, B, and C and their integrated reporting workflow
The integrated script runs or loads the three benchmark families and assembles 23 tidy metric rows together with CSV, MAT, PNG, and Markdown artifacts.

The public repository intentionally ignores runtime-generated output files. These diagrams document the released workflow; the scripts below reproduce the numerical tables and plots in MATLAB rather than presenting fabricated screenshots.

Configurations, matched inputs, and explicit statistical units.

Each independent replication is treated as one experimental unit. Benchmark A reuses the same externally sampled customers and service requirements across policy scenarios. Benchmark B uses matched seeds and verifies that only the staffing decision changes. Results are summarized with replication-level 95% Student-t confidence intervals.

ConfigureSpecify arrivals, service laws, queue rules, topology, capacity, and horizons.
ReplicateRun independent seeds and use matched inputs only when the comparison supports it.
DiagnoseCheck flow consistency, offered load, utilization, rejection, and bottlenecks.
CompareEstimate scenario-level means, paired gains, tail metrics, and 95% intervals.
ExportWrite CSV, MAT, PNG, and Markdown evidence for later inspection.

A minimal run

cfg = qsim.defaultConfig();
cfg.simulation.arrivalHorizon = 120;
cfg.simulation.observationHorizon = 120;
cfg.network.nodes.nServers = 2;
results = qsim.run(cfg);
disp(results.system);

The framework uses base MATLAB R2022b and does not require SimEvents.

Verified behavior, with the model boundary stated clearly.

The v0.2.0 release records 89 of 89 acceptance tests passing on owner-supplied MATLAB R2022b / Windows evidence. The same acceptance run verified complete Benchmarks A–C exports, including 23 integrated metric rows and six performance-workload records. Static release checks also passed on GitHub.

What is covered

Core event logic, queue policies, network flow, replication statistics, diagnostics, export integrity, and benchmark contracts are included in the test and acceptance workflow.

What is not claimed

Finite-horizon simulation outcomes are not automatically steady-state results or real-world causal estimates. Runtime measurements are descriptive rather than a fixed performance guarantee.

Current scope limits

  • Networks must be directed and acyclic; cycles, fork/join synchronization, and upstream physical spillback are not implemented.
  • The release does not yet include shared inter-node resources, EV or energy coupling, a graphical interface, or an automatic optimization solver.
  • Policy extension points are defined, but arbitrary plug-in policies are not yet supported.

The private-repository MATLAB CI job was skipped because of licensing configuration; it is not reported as a successful CI run. The acceptance result above refers to the documented local MATLAB evidence.

Run the examples or inspect the design contracts.

The repository includes a quickstart, API reference, benchmark interpretation notes, validation records, a citation file, and a versioned public release.

Related systems analysisMetro Travel-Time Reliability →Explore another projectTRB 2024 Conference Paper →