Bounds and approximations for the periodic on/off queue with applications to ATM traffic control
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
IEEE/ACM Transactions on Networking (TON)
A new approach to service provisioning in ATM networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Traffic characterization algorithms for VBR video in multimedia networks
Multimedia Systems
IEEE/ACM Transactions on Networking (TON)
A Traffic Control Framework for High Speed Data Transmission
Proceedings of the IFIP TC6 Task Group/WG6.4 International Workshop on Performance of Communication Systems: Modelling and Performance Evaluation of ATM Technology
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
A framework for guaranteeing statistical QoS
IEEE/ACM Transactions on Networking (TON)
An estimator of regulator parameters in a stochastic setting
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.24 |
We consider a finite-buffer packet multiplexer to which traffic arrives from several independent sources. The traffic from each of the sources is regulated, i.e. the amount of traffic that can enter the multiplexer is constrained by known regulator constraints. The regulator constraints depend on the source and are more general than those resulting from cascaded leaky buckets. We assume that the traffic is adversarial to the extent permitted by the regulators. For lossless multiplexing, we show that if the original multiplexer is lossless it is possible to allocate bandwidth and buffer to the sources so that the resulting segregated systems are lossless. For lossy multiplexing, we use our results for lossless multiplexing to estimate the loss probability of the multiplexer. Our estimate involves transforming the original system into two independent resource systems, and using adversarial sources for the two independent resources to obtain a bound on the loss probability of the transformed system. We show that the adversarial sources are not extremal on-off sources, even when the regulator consists of a peak rate controller in series with a leaky bucket. We explicitly characterize the form of the adversarial source for the transformed problem. We also provide numerical results for the case of the simple regulator.