New stochastic network calculus for loss analysis

Recently some stochastic (probabilistic) extensions of the deterministic network calculus have been developed, mainly for exploiting the statistical multiplexing of flows aggregated in packet based communication networks. This exploitation could result "better" stochastic performance bounds than those bounds provided by the inherently worst case analysis of the deterministic network calculus. The core of these stochastic extensions is the re-definition of the so-called arrival and service curve in a probabilistic manner. Until this time the re-definitions of these curves are based on tail probability like functionals. In this paper we perform a new kind of stochastic network calculus based on defining arrival and service curves using a different functional called tail weight. The power of this approach is demonstrated by presenting fundamental results on backlog and delay bounds and concatenation of nodes, furthermore suitable service curves and numerical examples are also presented for one of the most complicated packet service disciplines, the generalized processor sharing scheduler.

[1]  Moshe Sidi,et al.  Stochastically bounded burstiness for communication networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[3]  R. Weber,et al.  Buffer overflow asymptotics for a buffer handling many traffic sources , 1996, Journal of Applied Probability.

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

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

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

[7]  Yuming Jiang,et al.  Analysis on generalized stochastically bounded bursty traffic for communication networks , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..

[8]  Kumar Jayantilal Parekn Abhay,et al.  A generalized processor sharing approach to frow control in integrated services networks , 1992 .

[9]  Florin Ciucu,et al.  Scaling properties of statistical end-to-end bounds in the network calculus , 2006, IEEE Transactions on Information Theory.

[10]  Gustavo de Veciana,et al.  On the relevance of time scales in performance oriented traffic characterizations , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[12]  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..

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

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

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

[16]  Yuming Jiang.  A basic stochastic network calculus , 2006, SIGCOMM 2006.

[17]  J AndrGulyand.  A Stochastic Extension of Network Calculus for Workload Loss Examinations , 2006 .

[18]  Yong Liu,et al.  A Stochastic Network Calculus 1 , 2004 .

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

[20]  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.

[21]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[22]  George D. Stamoulis,et al.  Application of the many sources asymptotic and effective bandwidths to traffic engineering , 1999, Telecommun. Syst..

[23]  Markus Fidler,et al.  An End-to-End Probabilistic Network Calculus with Moment Generating Functions , 2005, 200614th IEEE International Workshop on Quality of Service.

[24]  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).

[25]  Nick Duffield,et al.  Predicting Qos Parameters For Atm Traffic Using Shape-Function Estimation , 1997 .

[26]  Jean-Yves Le Boudec,et al.  Bounds for independent regulated inputs multiplexed in a service curve network element , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[27]  Nick G. Duffield,et al.  Large deviations, the shape of the loss curve, and economies of scale in large multiplexers , 1995, Queueing Syst. Theory Appl..