Talk:Heavy traffic approximation
Latest comment: 1 year ago by 132.200.132.105 in topic math notation
This is the talk page for discussing improvements to the Heavy traffic approximation article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
math notation
editI found two instances of
and changed them to:
Just change the code from lim_{t\to\infty} to \lim_{t\to\infty}. Just one backslash.
I also did a bunch of other similar TeX corrections. See WP:MOS and standard LaTeX manuals. Michael Hardy (talk) 16:19, 29 March 2013 (UTC)
Is there an error here?
- with ρ representing the traffic intensity and s the number of servers. Traffic intensity and the number of servers are increased to infinity and the limiting process is a hybrid of the above results.
Since utilization rate is supposed to be below 1, I don't see how this could be taken in the limit to infinity. Checking the relevant equation in 2.2 of the Halfin and Whitt paper, it looks like the limit is in `s' (there in `n') only, not `s' and rho. It could be the limit as rho goes to 1 and `s' goes to infinity. — Preceding unsigned comment added by 132.200.132.105 (talk) 16:29, 9 January 2023 (UTC)