MODELING BURST TRAFFIC USING A MAP WITH A TREE STRUCTURE

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Nishimura S

  Tokyo University Of Science

• Nishimura Shoichi

  Tokyo University Of Science

• Shinno Miyuki

  NTT Advanced Technology Corporation

関連論文

• A COMPUTATIONAL METHOD FOR THE BOUNDARY VECTOR OF A BMAP/G/1 QUEUE
• MODELING BURST TRAFFIC USING A MAP WITH A TREE STRUCTURE

スポンサーリンク