MODELING BURST TRAFFIC USING A MAP WITH A TREE STRUCTURE

• Nishimura Shoichi

  Tokyo University of Science

• Shinno Miyuki

  NTT Advanced Technology Corporation

抄録

In this paper, a modeling approach for burst traffic using a MAP whose underlying process has a tree structure (TSMAP) is proposed. Characteristics of a MAP/G/1 queue are analytically obtained. For large batch size, however, there are elaborate calculations. The spectral method is applied to overcome this problem. The rate matrix of a TSMAP is estimated by the EM algorithm. For a trace-driven simulation and our analytical model, probability density functions of the number of data units in the queueing system are quite similar. Using short-term dynamics of queueing system, the long-term dynamics is estimated.

収録刊行物

• 日本オペレーションズ・リサーチ学会論文誌

  日本オペレーションズ・リサーチ学会論文誌 47 (3), 129-144, 2004

  公益社団法人 日本オペレーションズ・リサーチ学会

キーワード

• Queue
• burst arrival
• MAP
• spectral method
• EM algorithm
• simulation

詳細情報

• CRID: 1390282679087367296
• NII論文ID: 110001183593
• NII書誌ID: AA00703935
• DOI: 10.15807/jorsj.47.129
• ISSN: 21888299
• ISSN: 04534514
• NDL書誌ID: 7064795
• Web Site: http://id.ndl.go.jp/bib/7064795
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I7064795
• Web Site: https://www.jstage.jst.go.jp/article/jorsj/47/3/47_KJ00000757448/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可