Loss probability calculations and asymptotic analysis for finite buffer multiplexers
IEEE/ACM Transactions on Networking (TON)
A Calculus for End-to-end Statistical Service Guarantees
A Calculus for End-to-end Statistical Service Guarantees
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
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
IEEE Transactions on Multimedia
On deterministic traffic regulation and service guarantees: a systematic approach by filtering
IEEE Transactions on Information Theory
Stochastically bounded burstiness for communication networks
IEEE Transactions on Information Theory
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
Entropy of ATM traffic streams: a tool for estimating QoS parameters
IEEE Journal on Selected Areas in Communications
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The estimation of the expected traffic loss ratio (workload loss ratio, WLR) is a key issue in provisioning Quality of Service in packet based communication networks. Despite of its importance, the stationary (long run) loss ratio in queueing analysis is usually estimated through other assessable quantities, typically based on the approximates of the buffer overflow probability. In this paper we define a calculus for communication networks which is suitable for workload loss estimation based on the original definition of stationary loss ratio. Our novel calculus is a probabilistic extension of the deterministic network calculus, and takes an envelope approach to describe arrivals and services for the quantification of resource requirements in the network. We introduce the effective w-arrival curve and the effective w-service curve for describing the inputs and the service and we show that the per-node results can be extended to a network of nodes with the definition of the effective network w-service curve.