Effects of Variations in the Available Bandwidth on the Performance of the GFR Service

The Guaranteed Frame Rate service category is currently under discussion for incorporation into the specification documents of the ATM-Forum. The concept of the GFR service is to provide a minimum service guarantee to classical best-effort services, taking into account the frame-based nature of todays data-traffic. In this paper we present a discrete-time analysis of the GFR service and discuss the effects of variations of the bandwidth available for the GFR service. The presented method can be applied to dimension the thresholds of the algorithms used to enforce the guaranteed service.

[1]  M. Ritter,et al.  Analysis of a queueing model with delayed feedback and its application to the ABR flow control , 1997 .

[2]  Heribert Vollmer.  Relating Polynomial Time to Constant Depth , 1998, Theor. Comput. Sci..

[3]  H. Baier.  On the Approximability of the Selection Problem , 1996 .

[4]  Kurt Tutschku,et al.  Demand-based radio network planning of cellular mobile communication systems , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[5]  Michael W. Ritter,et al.  Carrying CDMA traffic over ATM using AAL-2: A performance study , 1997 .

[6]  Susanne Ziegler,et al.  KBA-D3: ein wissensbasiertes Diagnose- und Informationssystem für Druckmaschinen , 1998, Künstliche Intell..

[7]  Notker Gerlich,et al.  The Performance of Base Station Interconnection Alternatives in CDMA Networks , 1997 .

[8]  Phuoc Tran-Gia,et al.  Analysis of the dynamics of CDMA reverse link power control , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[9]  Reiner Kolla,et al.  Approximative Representation of boolean Functions by size controllable ROBDD's , 1997 .

[10]  Phuoc Tran-Gia,et al.  Code Division Multiple Access wireless network planning considering clustered spatial customer traffic , 1998 .

[11]  Lwkkuhvshfwwwrwkhhvlpsohprgholqjjdssurdfkkzhhrewdl Dqggprghohgggdwddvhw.  Measurement and Modeling of WWW-Sessions , 1997 .

[12]  Norbert Vicari,et al.  Performance of the GFR-service with constant available bandwidth , 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).

[13]  Klaus W. Wagner,et al.  Bounding Queries in the Analytic Polynomial-Time Hierarchy , 1998, Theor. Comput. Sci..

[14]  Michael Unger,et al.  Hybrid Weighted Finite Automata for Image and Video Compression , 1997 .

[15]  Heribert Vollmer,et al.  Uniformly Defining Complexity Classes of Functions , 1998, STACS.

[16]  Reiner Kolla,et al.  TEMPLATE: a generic TEchnology Mapping PLATform , 1997 .

[17]  Notker Gerlich,et al.  On the Spatial Multiplexing Gain of SDMA for Wireless Local Loop Access , 1997 .

[18]  Klaus W. Wagner,et al.  The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy , 1998, ArXiv.

[19]  Reiner Kolla,et al.  A parallel hybrid approach to hard optimization problems , 1997, ARCS.

[20]  Heribert Vollmer,et al.  The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae , 1998, Electron. Colloquium Comput. Complex..

[21]  M. Ritter,et al.  Discrete-Time Modeling of the Frame-Based Generic Cell Rate Algorithm , 1998 .

[22]  Reiner Kolla,et al.  Node normalization and decomposition in low power technology mapping , 1997, Proceedings of 1997 International Symposium on Low Power Electronics and Design.

[23]  O. Rose,et al.  A Memory Markov Chain Model For VBR Traffic With Strong Positive Correlations , 1998 .

[24]  Michael A. Ritter,et al.  A Decomposition Approach for User-Network Interface Modeling in ATM Networks , 1997 .

[25]  Michael Menth,et al.  A Numerical Framework for Solving Discrete Finite Markov Models Applied to the AAL-2 Protocol , 1999, MMB.

[26]  Kenji Leibnitz,et al.  Adaptive Soft-Handoff thresholds for CDMA systems with spatial traffic , 1999 .

[27]  Heribert Vollmer.  A Generalized Quantifier Concept in Computational Complexity Theory , 1997, ESSLLI.

[28]  Norbert Vicari,et al.  Series Models of WWW-Traffic : a Comparison of Pareto and Logarithmic Histogram Models , 1998 .

[29]  Oliver Rose.  WIP evolution of a semiconductor factory after a bottleneck workcenter breakdown , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[30]  Reiner Kolla,et al.  Spanning tree based state encoding for low power dissipation , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[31]  Mathias A. Dummler.  Analysis of the Departure Process of a Batch Service Queueing System , 1998 .

[32]  Michael Menth,et al.  The Performance of AAL-2 Carrying CDMA Voice Traffic , 1998 .

[33]  P. Tran-Gia,et al.  Discrete-Time Analysis of Batch Servers with Bounded Idle Time , 1996, ESM.

[34]  Klaus W. Wagner,et al.  On boolean lowness and boolean highness , 2001, Theor. Comput. Sci..

[35]  Reiner Kolla,et al.  Matching a Boolean Function against a Set of Functions , 1997 .

[36]  Heribert Vollmer,et al.  Succinct Inputs, Lindstr om Quantifiers, and a General Complexity Theoretic Operator Concept , 1997 .