Performance Analysis of Source Policing Architectures in ATM Systems
暂无分享,去创建一个
[1] Lane A. Hemaspaandra,et al. Using Inductive Counting to Simulate Nondeterministic Computation , 1990, MFCS.
[2] Ronald V. Book. On Random Oracle Separations , 1991, Inf. Process. Lett..
[3] Conny Friedewald,et al. WUMPS, Würzburger Message Passing System , 1990, Transputer-Anwender-Treffen.
[4] Heribert Vollmer,et al. The Complexity of Finding Middle Elements , 1993, Int. J. Found. Comput. Sci..
[5] F Hh,et al. Queueing Analysis of Resource Dispatching and Scheduling in Multi-media Systems , 1991 .
[6] Phuoc Tran-Gia,et al. Performance analysis of a batch service queue arising out of manufacturing system modelling , 1993, Queueing Syst. Theory Appl..
[7] M. Ritter. Analysis of the Generic Cell Rate Algorithm Monitoring ON/OFF-Traffic , 1994 .
[8] Phuoc Tran-Gia,et al. Basic Concepts and Performance of High-Speed Protocols , 1993, Integrated Broadband Communications.
[9] F Hh. Autocorrelation and Power Density Spectrum of Atm Multiplexer Output Processes , 1992 .
[10] Phuoc Tran-Gia,et al. Approximate Performance Analysis of the DQDB Acess Protocol , 1990, Comput. Networks ISDN Syst..
[11] Phuoc Tran-Gia,et al. An Analysis of Multi-Service Systems with Trunk Reservation Mechanisms , 1992 .
[12] Phuoc Tran-Gia,et al. Performance of a neural net scheduler used in packet switching interconnection networks , 1993, IEEE International Conference on Neural Networks.
[13] F. H. Ubner. Analysis of a nite capacity asynchronous multiplexer with periodic sources , 1990 .
[14] P. Tran-Gia,et al. A discrete time analysis of the DQDB access protocol with general input traffic , 1990, SBT/IEEE International Symposium on Telecommunications.
[15] F Hh,et al. Output Process Analysis of the Peak Cell Rate Monitor Algorithm , 1994 .
[16] Manfred Mittler,et al. Triggering Scheduler , 1993 .
[17] Oliver Rose. Approximate Analysis of an ATM Multiplexer with MPEG Video Input , 1994 .
[18] T. Fritsch,et al. Communication network routing using neural nets-numerical aspects and alternative approaches , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.
[19] Celia Wrathall. Confluence of One-Rule Thue Systems , 1990, IWWERT.
[20] F Hh,et al. Dimensioning of a Peak Cell Rate Monitor Algorithm Using Discrete-time Analysis , 1993 .
[21] Phuoc Tran-Gia. Analysis of polling systems with general input process and finite capacity , 1992, IEEE Trans. Commun..
[22] Ulrich Hertrampf. Complexity classes defined via k-valued functions , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[23] M. Ritter,et al. Blocking in Multi-service Broadband Systems with Cbr and Vbr Input Traac , 1992 .
[24] Frank Puppe,et al. COKE: efficient solving of complex assignment problems with the propose-and-exchange method , 1992, Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92.
[25] R. Dittmann,et al. Discrete-time Analysis of a Cyclic Service System with Gated Limited Service , 1993 .
[26] F Hh,et al. Discrete-time Analysis of the Output Process of an Atm Multiplexer with Periodic Input , 1991 .
[27] Ulrich Hertrampf. Locally Definable Acceptance Types for Polynomial Time Machines , 1992, STACS.
[28] Hermann Gold,et al. Multi Server Batch Service Systems in Push and Pull Operating Mode - a Performance Comparison , 1991 .
[29] Phuoc Tran-Gia,et al. Discrete-time analysis of cell spacing in ATM systems , 1994, Telecommun. Syst..
[30] Ulrich Hertrampf. Locally Definable Acceptance Types - The Three-Valued Case , 1992, LATIN.
[31] Phuoc Tran-Gia,et al. Structure and Performance of Neural Nets in Broadband System Admission Control , 1994 .
[32] Klaus W. Wagner,et al. Bounded Query Classes , 1990, SIAM J. Comput..
[33] Heribert Vollmer,et al. Classes of Counting Functions and Complexity Theoretic Operators , 1996 .
[34] N Gerlich,et al. Reducing the Variance of Sojourn times in Queueing Networks with Overtaking , 1993 .
[35] Christoph Meinel,et al. Structure and Importance of Logspace-MOD-Classes , 1991, STACS.
[36] Eric Allender,et al. A note on the power of threshold circuits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[37] Sajal K. Das,et al. Incomplete Hypercubes: embeddings of Tree-Related Networks , 1995, J. Parallel Distributed Comput..
[38] Eric Allender,et al. On the Power of Uniform Families of Constant Depth Treshold Circuits , 1990, MFCS.
[39] Jack H. Lutz,et al. On Complexity Classes and Algorithmically Random Languages (Extended Abstract) , 1992, STACS.
[40] Miroslaw Kowaluk,et al. Vector Language: Simple Description of Hard Instances (Extended Abstract) , 1990, MFCS.
[41] Michael R. Frater,et al. A Comparison of Models for VBR Video Traffic Sources in B-ISDN , 1994, Broadband Communications.
[42] Hermann Gold,et al. Performance Analysis of a Batch Service System , 1994 .