Goodness-of-fit techniques
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)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
A practical guide to heavy tails: statistical techniques and applications
A practical guide to heavy tails: statistical techniques and applications
Dimensioning bandwidth for elastic traffic in high-speed data networks
IEEE/ACM Transactions on Networking (TON)
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Managing capacity for telecommunications networks under uncertainty
IEEE/ACM Transactions on Networking (TON)
Testing the Gaussian approximation of aggregate traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Analyzing peer-to-peer traffic across large networks
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
NetFlow: information loss or win?
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Internet research needs better models
ACM SIGCOMM Computer Communication Review
MRTG - The Multi Router Traffic Grapher
LISA '98 Proceedings of the 12th USENIX conference on System administration
MRTG - The Multi Router Traffic Grapher
LISA '98 Proceedings of the 12th USENIX conference on System administration
A characterization of broadband user behavior and their e-business activities
ACM SIGMETRICS Performance Evaluation Review
Empirical Bandwidth Provisioning Models for High Speed Internet Traffic
CNSR '06 Proceedings of the 4th Annual Communication Networks and Services Research Conference
Discrete-time heavy-tailed chains, and their properties in modeling network traffic
ACM Transactions on Modeling and Computer Simulation (TOMACS)
QoS-aware bandwidth provisioning for IP network links
Computer Networks: The International Journal of Computer and Telecommunications Networking
Smart dimensioning of IP network links
DSOM'07 Proceedings of the Distributed systems: operations and management 18th IFIP/IEEE international conference on Managing virtualization of networks and services
Toward the accurate identification of network applications
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Understanding Internet traffic streams: dragonflies and tortoises
IEEE Communications Magazine
Long-term forecasting of Internet backbone traffic
IEEE Transactions on Neural Networks
Packet-level traffic measurements from the Sprint IP backbone
IEEE Network: The Magazine of Global Internetworking
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Internet traffic measurements collected during the busy hour constitute a key tool to evaluate the operation of networks under the heaviest-load case scenarios, and further provide a means to network dimensioning and capacity planning. In this light, this study provides a throughout analysis of the busy-hour traffic measurements of an extensive set of universities, regional networks, and Internet exchange points collected from the Spanish Research and Education Network, RedIRIS. After showing that the traffic volumes observed in the busy hour over time can be modeled by a white Gaussian process, this work takes one step further and examines the influence of the networks' intrinsic features, mainly population size and access link capacity, on the busy-hour traffic. Well-known statistical methodologies, such as ANOVA and ANCOVA, show that the network size in terms of number of users justifies most of the busy-hour traffic information. We further provide a linear-regression model that adjusts the amount of traffic that each network user contributes to the busy-hour traffic mean values, with a direct application to the problem of link capacity planning of IP networks.