Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
freem
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Openai/6931fd85-fcec-8011-8057-6c5f7152feee
(section)
Add languages
Page
Discussion
English
Read
Edit
Edit source
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
Edit source
View history
General
What links here
Related changes
Special pages
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===== 7.4 Step 4: Lifting back to the original queue ===== Finally, standard interchange‑of‑limits and stability arguments (as in Harrison’s and Atar–Mandelbaum–Reiman’s work on multiclass queues) show that if a policy is asymptotically optimal for the diffusion model and the diffusion model is a valid heavy‑traffic approximation, then the corresponding sequence of prelimit policies is asymptotically optimal for the original queues. Under the finite‑variance heavy‑tailed assumption and time‑varying but “slow” arrival rates (piecewise‑Lipschitz), the diffusion approximation is valid on any fixed time horizon, and the asymptotic compliance w.r.t. deadlines translates into achieving arbitrarily tight service‑level targets for percentiles such as the 99th.
Summary:
Please note that all contributions to freem are considered to be released under the Creative Commons Attribution-ShareAlike 4.0 (see
Freem:Copyrights
for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource.
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)