An acceleration simulation method for power law priority traffic
A method for accelerated simulation for simulated self-similar processes is proposed. This technique simplifies the simulation model and improves the efficiency by using excess packets instead of packet-by-packet source traffic for a FIFO and non-FIFO buffer scheduler. In this research is focusing...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
Faculty of Electrical Engineering
2008
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/9934/3/SharifahHSAriffin2008__AnAccelerationSimulationMethodforPower.pdf http://eprints.utm.my/id/eprint/9934/ http://www.fke.utm.my/elektrika/june08/paper10june08.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | A method for accelerated simulation for simulated self-similar processes is proposed. This technique simplifies
the simulation model and improves the efficiency by using excess packets instead of packet-by-packet source traffic for a FIFO and non-FIFO buffer scheduler. In this research is focusing on developing an equivalent model of the conventional packet buffer that can produce an output analysis (which in this case will be the steady state probability) much faster. This acceleration simulation method is a further development of the Traffic Aggregation technique, which had previously been applied to FIFO buffers only and applies the Generalized Ballot Theorem to calculate the waiting time for the low priority traffic (combined with prior work on traffic aggregation). This hybrid method is shown to provide a significant reduction in the process time, while maintaining queuing behavior in the buffer that is highly accurate when compared to results from a conventional simulation |
|---|