On the self-similar nature of Ethernet traffic
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Performance analysis of single-stage, output buffer packet switches with independent batch arrivals
Computer Networks and ISDN Systems
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Self-similar traffic and upper bounds to buffer-overflow probability in an ATM queue
Performance Evaluation
Overflow and loss probabilities in a finite ATM buffer fed by self-similar traffic
Queueing Systems: Theory and Applications
Tail probabilities for a multiplexer with self-similar traffic
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Self-similar processes in communications networks
IEEE Transactions on Information Theory
Performance evaluation of a queue fed by a Poisson Pareto burst process
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
Performance analysis of a Poisson-Pareto queue over the full range of system parameters
Computer Networks: The International Journal of Computer and Telecommunications Networking
Snapshot simulation of internet traffic: queueing of fixed-rate flows
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
This paper considers a discrete time queuing system that models a communication network multiplexer which is fed by a self-similar packet traffic. The model has a finite buffer of size h, a number of servers with unit service time, and an input traffic which is an aggregation of independent source-active periods having Pareto-distributed lengths and arriving as Poisson batches. The new asymptotic upper and lower bounds to the buffer-overflow and packet-loss probabilities P are obtained. The bounds give an exact asymptotic of log P/log h when h \to ∞. These bounds decay algebraically slow with buffer-size growth and exponentially fast with excess of channel capacity over traffic rate. Such behavior of the probabilities shows that one can better combat traffic losses in communication networks by increasing channel capacity rather than buffer size. A comparison of the obtained bounds and the known upper and lower bounds is done.