Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling

  • Part of
  • Ramtin Pedarsani, Jean Walrand
  • Journal:
    Journal of Applied Probability / Volume 53 / Issue 2 / June 2016
    Published online by Cambridge University Press:
    21 June 2016, pp. 421-433
    Print publication:
    June 2016

  • We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routeing matrix and several disjoint groups of queues in which at most one queue can be served at a time. The arrival and potential service processes and routeing decisions at the queues are independent, stationary, and ergodic. A scheduling policy is called robust if it does not depend on the arrival and service rates nor on the routeing probabilities. A policy is called throughput-optimal if it makes the system stable whenever the parameters are such that the system can be stable. We propose two robust policies: longest-queue scheduling and a new policy called longest-dominating-queue scheduling. We show that longest-queue scheduling is throughput-optimal for two groups of two queues. We also prove the throughput-optimality of longest-dominating-queue scheduling when the network topology is acyclic, for an arbitrary number of groups and queues.