Optimal Round-Robin Routing to Parallel Servers in Heavy Traffic

Research output: Journal article publicationJournal articleAcademic researchpeer-review

Abstract

We study a system with heterogeneous parallel servers. Upon arrival, a job is routed to the queue of one of the servers. We establish the diffusion limit for the round-robin (RR) policy, and show that with properly chosen parameters, it achieves the optimal performance asymptotically over all blind routing policies. Analysis of the diffusion limit yields a number of insights into the performance of the optimal RR policies.

Original languageEnglish
Pages (from-to)27-29
Number of pages3
JournalPerformance Evaluation Review
Volume50
Issue number2
DOIs
Publication statusPublished - 30 Aug 2022

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Optimal Round-Robin Routing to Parallel Servers in Heavy Traffic'. Together they form a unique fingerprint.

Cite this