On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
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)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
The output of a switch, or, effective bandwidths for networks
Queueing Systems: Theory and Applications
On–off fluid models in heavy traffic environment
Queueing Systems: Theory and Applications
Testing the Gaussian approximation of aggregate traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Alternative Admission Rules Based on the Many Sources Asymptotics
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
QoS-aware bandwidth provisioning for IP network links
Computer Networks: The International Journal of Computer and Telecommunications Networking
Capacity overprovisioning for networks with resilience requirements
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Inferring traffic burstiness by sampling the buffer occupancy
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Modeling Internet backbone traffic at the flow level
IEEE Transactions on Signal Processing
On the use of fractional Brownian motion in the theory of connectionless networks
IEEE Journal on Selected Areas in Communications
Entropy of ATM traffic streams: a tool for estimating QoS parameters
IEEE Journal on Selected Areas in Communications
Load characterization and anomaly detection for voice over IP traffic
IEEE Transactions on Neural Networks
Most likely paths to error when estimating the mean of a reflected random walk
Performance Evaluation
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
Link dimensioning, i.e., selecting a (minimal) link capacity such that the users' performance requirements are met, is a crucial component of network design. It requires insight into the interrelationship among the traffic offered (in terms of the mean offered load M, but also its fluctuation around the mean, i.e., 'burstiness'), the envisioned performance level, and the capacity needed. We first derive, for different performance criteria, theoretical dimensioning formulas that estimate the required capacity c as a function of the input traffic and the performance target. For the special case of Gaussian input traffic, these formulas reduce to c = M + αV, where α directly relates to the performance requirement (as agreed upon in a service level agreement) and V reflects the burstiness (at the timescale of interest). We also observe that Gaussianity applies for virtually all realistic scenarios; notably, already for a relatively low aggregation level, the Gaussianity assumption is justified. As estimating M is relatively straightforward, the remaining open issue concerns the estimation of V. We argue that particularly if V corresponds to small time-scales, it may be inaccurate to estimate it directly from the traffic traces. Therefore, we propose an indirect method that samples the buffer content, estimates the buffer content distribution, and 'inverts' this to the variance. We validate the inversion through extensive numerical experiments (using a sizeable collection of traffic traces from various representative locations); the resulting estimate of V is then inserted in the dimensioning formula. These experiments show that both the inversion and the dimensioning formula are remarkably accurate.