Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Automation and Remote Control
Modeling IP traffic: joint characterization of packet arrivals and packet sizes using BMAPs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Source traffic characterization for thin client based office applications
EUNICE'07 Proceedings of the 13th open European summer school and IFIP TC6.6 conference on Dependable and adaptable networks and services
Correct router interface modeling
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Queue size in a BMAP queue with finite buffer
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
| Hi-index | 0.00 |
In some implementations, packet buffers are limited to a fixed number of packets regardless their lengths. Service times in a queuing model of such implementation are proportional to the packet lengths. Since packet lengths are not independent, the traditional queuing models assuming independence of service times are not suitable for such implementations. The new queuing model for such types of packet buffers is proposed. The buffer is described as a finite FIFO queuing system with a Markovian Arrival Process (MAP) and semi-Markov (SM) service times. The new analytical results for the loss ratio, the local loss intensity or the total number of losses are developed. All results are suitable either for a transient or a stationary analysis.