【摘要】 介绍了一种变换近似方法,该方法通过变换近似获得重尾分布的拉普拉斯变换,解决了不存在拉普拉斯变换分布的信源排队等待时间分析问题,为实际网络排队缓冲器的设计提供了参考。更多还原

【Abstract】 In this paper, the transform approximation method is introduced, which gains Laplace transforms of heavy-tailed distributions approximately. It overcomes the difficulties in analyzing queue waiting time of heavy-tailed distribution sources, which havent the Laplace transforms. It can be referred in practical design of the buffers of network queue.更多还原