On the performance of multiplexing independent regulated inputs

Authors:
Cheng-Shang Chang;Yuh-ming Chiu;Wheyming Tina Song
Affiliations:
Institute of Communication Engineering, National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.;Institute of Communication Engineering, National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.;Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.
Venue:
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
2001

Citing 7
Cited 12

On computing per-session performance bounds in high-speed multi-hop computer networks

SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Comments on “a deterministic approach to the end-to-end analysis of packet flows in connection oriented networks”

IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Optimal trajectory to overflow in a queue fed by a large number of sources

Queueing Systems: Theory and Applications
Fast Simulation of Rare Events in Queueing and Reliability Models

Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Large deviations approximation for fluid queues fed by a large number of on/off sources

IEEE Journal on Selected Areas in Communications
A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node

IEEE Journal on Selected Areas in Communications

Probabilistic delay guarantees using delay distribution measurement

Proceedings of the 12th annual ACM international conference on Multimedia
Importance sampling for the estimation of buffer overflow probabilities via trace-driven simulations

IEEE/ACM Transactions on Networking (TON)
An estimator of regulator parameters in a stochastic setting

IEEE/ACM Transactions on Networking (TON)
Application of rare event techniques to trace driven simulation

WSC '05 Proceedings of the 37th conference on Winter simulation
Loss ratio approximations in buffered systems with regulated inputs

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Statistical admission control using delay distribution measurements

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
A calculus for stochastic QoS analysis

Performance Evaluation
Performance bounds for feedforward queueing networks with upper-constrained inputs

Performance Evaluation
Buffer overflow asymptotics for multiplexed regulated traffic

Performance Evaluation
Loss bounds for a finite-capacity queue based on interval-wise traffic observation

Queueing Systems: Theory and Applications
A novel direct upper approximation for workload loss ratio in general buffered systems

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
On the impact of storage in residential power distribution systems

ACM SIGMETRICS Performance Evaluation Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the performance analysis problem for a work conserving link with a large number of independent regulated inputs. For such a problem, we derive simple stochastic bounds under a general traffic constraint for the inputs. The bound for queue length is shown to be a stochastic extension of the deterministic worst case bound and it is asymptotically tighter than the bound in Kesidis and Konstantopoulos [23]. We also test the bound by considering periodic inputs with independent starting phases. Based on Sanov's theorem and importance sampling, we propose a fast simulation algorithm that achieves significant variance reduction. The simulations results are compared with our stochastic bound and the bound in [23].