RXRunhan Xie

Runhan Xie

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Runhan Xie has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Insensitivity for Matching Systems

    by Runhan Xie, Elene Anton, Kristen Gardner, Rhonda Righter

    We study matching queues motivated by applications in ride-sharing platforms, where items (e.g., drivers and riders) arrive over time and are matched based on a compatibility graph. Our model generalizes classical compatibility queueing models and queue-based ride-sharing models by allowing exogenous driver arrivals, queues for both drivers and riders, and arbitrary bipartite compatibility structures. We provide sufficient conditions under which the stationary distribution exhibits insensitivity to 1) service-time (drive-time) distributions and 2) the matching policies of drivers and riders, respectively. Using tools from Kelly networks and order-independent queues, we provide simple and unified proofs of insensitivity to service-time distributions and to matching policies for a broad class of models. Our policy insensitivity result requires a finite buffer; we demonstrate through counterexamples that such insensitivity may fail when the buffer is infinite. Our results also shed light on insensitivity in related redundancy systems, offering new insights into their stationary behavior.


  • Open Access

    Heavy-Traffic Optimal Size- and State-Aware Dispatching

    by Runhan Xie, Isaac Grosof, Ziv Scully

    We study the problem of dispatching jobs to multiple FCFS (First-Come, First-Served) queues. We consider the case where the dispatcher is size-aware, meaning it learns the size (i.e. service time) of each job as it arrives; and state-aware, meaning it always knows the amount of work (i.e. total remaining service time) at each queue. While size- and state-aware dispatching to FCFS queues has been extensively studied, little is known about optimal dispatching for the objective of minimizing mean delay. In this work, we propose the first size- and state-aware dispatching policy, called CARD (Controlled Asymmetry Reduces Delay), that provably minimizes mean delay in heavy traffic. This work summarizes our full paper.

  • Open Access

    Heavy-Traffic Optimal Size- and State-Aware Dispatching

    by Runhan Xie, Isaac Grosof, Ziv Scully

    We study the problem of dispatching jobs to multiple FCFS (First-Come, First-Served) queues. We consider the case where the dispatcher is size-aware, meaning it learns the size (i.e. service time) of each job as it arrives; and state-aware, meaning it always knows the amount of work (i.e. total remaining service time) at each queue. While size- and state-aware dispatching to FCFS queues has been extensively studied, little is known about optimal dispatching for the objective of minimizing mean delay. In this work, we propose the first size- and state-aware dispatching policy, called CARD (Controlled Asymmetry Reduces Delay), that provably minimizes mean delay in heavy traffic. This work summarizes our full paper.

  • Open Access

    Heavy-Traffic Optimal Size- and State-Aware Dispatching

    by Runhan Xie, Isaac Grosof, Ziv Scully

    Dispatching systems, where arriving jobs are immediately assigned to one of multiple queues, are ubiquitous in computer systems and service systems. A natural and practically relevant model is one in which each queue serves jobs in FCFS (First-Come First-Served) order. We consider the case where the dispatcher is size-aware, meaning it learns the size (i.e. service time) of each job as it arrives; and state-aware, meaning it always knows the amount of work (i.e. total remaining service time) at each queue. While size- and state-aware dispatching to FCFS queues has been extensively studied, little is known about optimal dispatching for the objective of minimizing mean delay. A major obstacle is that no nontrivial lower bound on mean delay is known, even in heavy traffic (i.e. the limit as load approaches capacity). This makes it difficult to prove that any given policy is optimal, or even heavy-traffic optimal. In this work, we propose the first size- and state-aware dispatching policy that provably minimizes mean delay in heavy traffic. Our policy, called CARD (Controlled Asymmetry Reduces Delay), keeps all but one of the queues short, then routes as few jobs as possible to the one long queue. We prove an upper bound on CARD's mean delay, and we prove the first nontrivial lower bound on the mean delay of any size- and state-aware dispatching policy. Both results apply to any number of servers. Our bounds match in heavy traffic, implying CARD's heavy-traffic optimality. In particular, CARD's heavy-traffic performance improves upon that of LWL (Least Work Left), SITA (Size Interval Task Assignment), and other policies from the literature whose heavy-traffic performance is known.