On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Analysis, modeling and generation of self-similar VBR video traffic
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Experimental queueing analysis with long-range dependent packet traffic
IEEE/ACM Transactions on Networking (TON)
What are the implications of long-range dependence for VBR-video traffic engineering?
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Data networks as cascades: investigating the multifractal nature of Internet WAN traffic
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Analysis of Random Access Protocol under Bursty Traffic
MMNS '01 Proceedings of the 4th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
Placement of network resources in communication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Service curve estimation by measurement: an input output analysis of a softswitch model
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Framework based on stochastic L-Systems for modeling IP traffic with multifractal behavior
Computer Communications
Hi-index | 0.24 |
Source traffic streams as well as aggregated traffic flows often exhibit long-range-dependent (LRD) properties. In this paper, we study traffic streams through their counting process representation. We first study the condition for the measured LRD traffic, as described by the interarrival time and packet size sequences, to be sufficiently well approximated by a synthesized stream formed by recording the counting state of the traffic at the start of each time slot. We then demonstrate that the burstiness of the counting processes is not well characterized by the Hurst parameter. We model a counting process by constructing a multiplicative multifractal process, which contains only one or two parameters. We study the LRD property of such processes, and show that the model has well-defined burstiness descriptors, and are easy to construct. We consider a single server queueing system, which is loaded, on one hand, by the measured processes, and, on the other hand, by properly parameterized multifractal processes. In comparing the system-size tail distributions, we demonstrate our model to effectively track the behavior exhibited by the system driven by the actual traffic processes. Our study may help resolve a hot debate on the modeling of an often used trace of VBR video traffic.