메뉴 건너뛰기




Volumn 20, Issue 4, 2006, Pages 595-598

Heavy traffic limits via Brownian embeddings

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDINGS; QUEUEING THEORY;

EID: 33750611125     PISSN: 02699648     EISSN: 14698951     Source Type: Journal    
DOI: 10.1017/s0269964806060360     Document Type: Article
Times cited : (1)

References (9)
  • 4
    • 0002708534 scopus 로고
    • 1965 Proceedings Symposium on Congestion Theory (Chapel Hill, N.C.). Chapel Hill: University of North Carolina Press
    • Kingman, J.F.C. The heavy traffic approximation in the theory of queues. 1965 Proceedings Symposium on Congestion Theory (Chapel Hill, N.C., 1964), pp. 137-169. Chapel Hill: University of North Carolina Press.
    • (1964) The Heavy Traffic Approximation in the Theory of Queues , pp. 137-169
    • Kingman, J.F.C.1
  • 5
    • 84890634099 scopus 로고    scopus 로고
    • The Skorokhod embedding problem and its offspring
    • Obłój, J. (2004). The Skorokhod embedding problem and its offspring. Probability Surveys 1: 321-390.
    • (2004) Probability Surveys , vol.1 , pp. 321-390
    • Obłój, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.