×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.
Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Tight matrices and heavy traffic steady state convergence in queueing networks

Click here to flash read.

arXiv:2404.13651v1 Announce Type: new
Abstract: In Braverman et al. (2024), the authors prove that the stationary distribution of a multiclass queueing network converges to the stationary distribution of a semimartingale reflecting Brownian motion (SRBM) in heavy traffic. Among the sufficient conditions for the convergence is that the reflection matrix $R$ of the SRBM is "tight". In this paper, we study how we can verify this tightness of $R$. For a $2$-dimensional SRBM, we give necessary and sufficient conditions for $R$ to be tight, while, for a general dimension, we only give sufficient conditions. We then apply these results to the SRBMs arising from the diffusion approximations of multiclass queueing networks with static buffer priority service disciplines that are studied in Braverman et al. (2024). It is shown that $R$ is always tight for this network with two stations if $R$ is defined and completely-S. For the case of more than two stations, it is shown that $R$ is tight for reentrant lines with last-buffer-first-service (LBFS) discipline, but it is not always tight for reentrant line with first-buffer-first-service (FBFS) discipline.

Click here to read this post out
ID: 818215; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: April 23, 2024, 7:33 a.m. Changes:
/u/anonymous
Dictionaries:
Words:
Spaces:
Views: 6
CC:
No creative common's license
Comments: