Workload Loss Examinations with a Novel Probabilistic Extension of Network Calculus

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.

[1]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[2]  Cheng-Shang Chang On Deterministic Traffic Regulation and Service Guarantees : A Systematic Approach by Filtering , 1998, IEEE Trans. Inf. Theory.

[3]  Moshe Sidi,et al.  Stochastically bounded burstiness for communication networks , 2000, IEEE Trans. Inf. Theory.

[4]  Ness B. Shroff,et al.  Loss probability calculations and asymptotic analysis for finite buffer multiplexers , 2001, TNET.

[5]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[6]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[7]  Almut Burchard,et al.  A Calculus for End-to-end Statistical Service Guarantees , 2002, ArXiv.

[8]  József Bíró,et al.  A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems , 2005, NETWORKING.

[9]  Cheng-Shang Chang,et al.  Stability, queue length, and delay of deterministic and stochastic queueing networks , 1994, IEEE Trans. Autom. Control..

[10]  András György,et al.  Estimates on the packet loss ratio via queue tail probabilities , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[11]  Chaiwat Oottamakorn,et al.  Statistical service assurances for traffic scheduling algorithms , 2000, IEEE Journal on Selected Areas in Communications.

[12]  A. Gulyas,et al.  Direct and indirect methods for packet loss approximation in buffered systems , 2005, Next Generation Internet Networks, 2005.

[13]  Nick G. Duffield,et al.  Entropy of ATM Traffic Streams: A Tool for Estimating QoS Parameters , 1995, IEEE J. Sel. Areas Commun..

[14]  Marwan Krunz,et al.  The Correlation Structure for a Class of Scene/Based Video Models and Its Impact on the Dimensioning of Video Buffers , 2000, IEEE Trans. Multim..

[15]  Chengzhi Li,et al.  A Network Calculus With Effective Bandwidth , 2007, IEEE/ACM Transactions on Networking.

[16]  Jean-Yves Le Boudec,et al.  Stochastic analysis of some Expedited Forwarding networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.