Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Charging and accounting for bursty connections
Internet economics
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A framework for robust measurement-based admission control
IEEE/ACM Transactions on Networking (TON)
Statistical properties of MPEG video traffic and their impact on traffic modeling in ATM systems
LCN '95 Proceedings of the 20th Annual IEEE Conference on Local Computer Networks
Comparison of Measurement-based Admission Control Algorithms for Controlled-Load Service
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A time-scale decomposition approach to measurement-based admission control
IEEE/ACM Transactions on Networking (TON)
On the relevance of time scales in performance oriented traffic characterizations
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
The effect of multiple time scales and subexponentiality in MPEG video streams on queueing behavior
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Large deviations approximation for fluid queues fed by a large number of on/off sources
IEEE Journal on Selected Areas in Communications
A decision-theoretic approach to call admission control in ATM networks
IEEE Journal on Selected Areas in Communications
Allocating commodity resources in aggregate traffic networks
Performance Evaluation
The effect of bandwidth and buffer pricing on resource allocation and QoS
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
Statistical admission control for real-time services under earliest deadline first scheduling
Computer Networks and ISDN Systems
Dynamic congestion-based pricing of bandwidth and buffer
IEEE/ACM Transactions on Networking (TON)
Towards an FBM model based network calculus framework with service differentiation
Mobile Networks and Applications
On the feasibility of dynamic congestion-based pricing in differentiated services networks
IEEE/ACM Transactions on Networking (TON)
Statistical admission control for real-time services under earliest deadline first scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
For a multiplexer fed by a large number of sources, we derive conditions under which a given subset of the sources can be substituted for a single source while preserving the buffer overflow probability and the dominant timescales of buffer overflows. This notion of traffic equivalence is stronger than simple effective bandwidth equality and depends on the multiplexing context. We propose several applications of the above traffic substitution conditions. First, we show that fractional Brownian motion as a single source substitute can effectively model a large number of multiplexed sources using information obtained purely from traffic traces; this has direct application to simple but accurate traffic generation. Second, we focus on dynamic (i.e., on-line) estimation of available capacity and buffer overflow probability. This requires the solution of a double optimization problem expressed in terms of functions whose values are obtained from time averages of the traffic traces over a large range of timescales. We show how to solve this problem on-line by reducing it to the calculation of a fixed-point equation that can be solved iteratively by combining traffic substitution using fractional Brownian motion with dynamic measurements of the actual traffic. We have validated this approach by extensive experimentation with large numbers or real traffic sources that are fed to a high bandwidth link, and comparing our on-line estimation of available capacity and the resulting dynamic call admission control with other existing approaches. The superior accuracy of our approach also suggests that taking the buffer size into account, as does our on-line algorithm, may be vital for achieving approximations of practical interest.