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)
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
Testing the Gaussian approximation of aggregate traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
M|G|Infinity Input Processes: A Versatile Class of Models for Network Traffic
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Congestion at flow level and the impact of user behaviour
Computer Networks: The International Journal of Computer and Telecommunications Networking
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
On the use of fractional Brownian motion in the theory of connectionless networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Automated Detection of Load Changes in Large-Scale Networks
TMA '09 Proceedings of the First International Workshop on Traffic Monitoring and Analysis
Robust network dimensioning for realtime services over IP networks with traffic deviation
Computer Communications
Measurement and characteristics of aggregated traffic in broadband access networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
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
Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees
Journal of Network and Computer Applications
MPLS automatic bandwidth allocation via adaptive hysteresis
Computer Networks: The International Journal of Computer and Telecommunications Networking
Characterization of the busy-hour traffic of IP networks based on their intrinsic features
Computer Networks: The International Journal of Computer and Telecommunications Networking
Content delivery and caching from a network provider's perspective
Computer Networks: The International Journal of Computer and Telecommunications Networking
Internet and the Erlang formula
ACM SIGCOMM Computer Communication Review
Computer Networks: The International Journal of Computer and Telecommunications Networking
A wise cost-effective supplying bandwidth policy for multilayer wireless cognitive networks
Computers and Operations Research
Light-weight traffic parameter estimation for on-line bandwidth provisioning
Proceedings of the 24th International Teletraffic Congress
Hi-index | 0.00 |
Current bandwidth provisioning procedures for IP network links are mostly based on simple rules of thumb, using coarse traffic measurements made on a time scale of e.g., 5 or 15min. A crucial question, however, is whether such coarse measurements give any useful insight into the capacity actually needed: QoS degradation experienced by the users is strongly affected by traffic rate fluctuations on a much smaller time scale. The present paper addresses this question. The goal is to develop provisioning procedures that require a minimal measurement effort. The bandwidth provisioning formula that we propose (and which we justify under minimal model assumptions) is of the form @r+@a@r. Here @r (in Mbit/s) is the load of the system, which can evidently be estimated by coarse traffic measurements (e.g., 5 or 15min measurements). The @a depends on the characteristics of the individual flows and the QoS requirements. The QoS measure used is the probability that the traffic supply exceeds the available bandwidth, over some predefined (small) interval T, is below some small fixed number @e. The impact of changing the 'QoS parameters', i.e., T and @e, on the coefficient @a is explicitly given. The validity of the bandwidth provisioning rule is assessed through extensive measurements performed in several operational network environments.