Biased Diffusion and Universality in Model Queues

We study the structure and robustness of universality classes for queueing, deriving analytic
results for priority-based models with continuous-valued priorities. By mapping one model onto the
problem of biased diffusion, we show that its distribution of waiting times, , decreases for large
times as or as exp () in different parameter regimes. In a second
model, introducing a cost for switching between different classes of tasks substantially changes the
asymptotic behavior of P( ).

By: G. Grinstein; R. Linsker

Published in: RC23960 in 2006


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .