메뉴 건너뛰기




Volumn 1, Issue , 1999, Pages 392-396

Interpolation approximations for M|G|∞ arrival processes

Author keywords

[No Author keywords available]

Indexed keywords

QUEUEING THEORY;

EID: 54249160679     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article
Times cited : (1)

References (15)
  • 3
    • 0003057550 scopus 로고
    • Superimposed renewal processes and storage with gradual input
    • J. W. Cohen. Superimposed renewal processes and storage with gradual input. Stochastic Processes and their Applications, 2:31-58, 1974.
    • (1974) Stochastic Processes and Their Applications , vol.2 , pp. 31-58
    • Cohen, J.W.1
  • 4
    • 0002810030 scopus 로고
    • Long-range dependence: A review
    • H. A. David and H. T. David, editors, The Iowa State University Press, Ames (IA)
    • D. R. Cox. Long-range dependence: A review. In H. A. David and H. T. David, editors, Statistics: An Appraisal, pages 55-74. The Iowa State University Press, Ames (IA), 1984.
    • (1984) Statistics: An Appraisal , pp. 55-74
    • Cox, D.R.1
  • 6
    • 0041442013 scopus 로고
    • Interpolation approximations of sojourn time distributions
    • P. J. Fleming and B. Simon. Interpolation approximations of sojourn time distributions. Operations Research, 39(2):251-260, 1991.
    • (1991) Operations Research , vol.39 , Issue.2 , pp. 251-260
    • Fleming, P.J.1    Simon, B.2
  • 7
    • 0031357217 scopus 로고    scopus 로고
    • Multiplexing on-off sources with subexponential on periods: Part I
    • Kobe (Japan), April
    • P. R. Jelenković and A. A. Lazar. Multiplexing on-off sources with subexponential on periods: Part I. In IEEE Infocom 97, Kobe (Japan), April 1997.
    • (1997) IEEE Infocom 97
    • Jelenković, P.R.1    Lazar, A.A.2
  • 9
    • 0031336241 scopus 로고    scopus 로고
    • M|G|∞ input processes: A versatile class of models for network traffic
    • Kobe (Japan), April
    • M. Parulekar and A. M. Makowski. M|G|∞ input processes: A versatile class of models for network traffic. In IEEE Infocom 97, Kobe (Japan), April 1997.
    • (1997) IEEE Infocom 97
    • Parulekar, M.1    Makowski, A.M.2
  • 10
  • 12
    • 0031700503 scopus 로고    scopus 로고
    • Computing queue-length distributions for power-law queues
    • San Francisco (CA), April
    • M. Roughan, D. Veitch, and M. Rumsewicz. Computing queue-length distributions for power-law queues. In IEEE Infocom 98, San Francisco (CA), April 1998.
    • (1998) IEEE Infocom 98
    • Roughan, M.1    Veitch, D.2    Rumsewicz, M.3


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