Stability Problems in Local Area Networks: A Qualitative Approach
暂无分享,去创建一个
[1] Randolph D. Nelson,et al. Stochastic catastrophe theory in computer performance modeling , 1987, JACM.
[2] W. Szpankowski. Solution of a linear recurrence equation arising in the analysis of some algorithms , 1987 .
[3] Ward Whitt,et al. Comparison methods for queues and other stochastic models , 1986 .
[4] Peter March,et al. On the stability of the Ethernet , 1985, STOC '85.
[5] Hideaki Takagi,et al. Abstracts of research reportAnalysis of throughput and delay for single- and multi-hop packet radio networks☆ , 1985 .
[6] Frank Kelly,et al. Stochastic Models of Computer Communication Systems , 1985 .
[7] GUY FAYOLLE,et al. Analysis of a stack algorithm for random multiple-access communication , 1985, IEEE Trans. Inf. Theory.
[8] Philippe Flajolet,et al. Q -ary collision resolution algorithms in random-access systems with free or blocked channel access , 1985, IEEE Trans. Inf. Theory.
[9] Linn I. Sennott. Tests for the Nonergodicity of Multidimensional Markov Chains , 1985, Oper. Res..
[10] Optimal Load Balancing in a Multiple Processor System with Many Job Classes , 1985, IEEE Transactions on Software Engineering.
[11] N. L. Lawrie,et al. Comparison Methods for Queues and Other Stochastic Models , 1984 .
[12] Wojciech Szpankowski,et al. Ergodicity aspects of multidimensional Markov chains with application to computer communication system analysis , 1984 .
[13] Micha Hofri,et al. Stack algorithms for collision-detecting channels and their analysis: A limited survey , 1984 .
[14] Wojciech Szpankowski,et al. Performance Evaluation of a Reservation Protocol for Multiaccess Systems , 1983, International Symposium on Computer Modeling, Measurement and Evaluation.
[15] Daniel P. Heyman,et al. Stochastic models in operations research , 1982 .
[16] W. Bux. Local-Area Subnetworks: A Performance Comparison , 1981, IEEE Trans. Commun..
[17] Z. Rosberg,et al. A note on the ergodicity of Markov chains , 1981, Journal of Applied Probability.
[18] W. Whitt. Comparing counting processes and queues , 1981, Advances in Applied Probability.
[19] Marcel F. Neuts,et al. Matrix-Geometric Solutions in Stochastic Models , 1981 .
[20] A. Ephremides,et al. Analysis, stability, and optimization of slotted ALOHA with a finite number of buffered users , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[21] Â Zvi Rosberg. A positive recurrence criterion associated with multidimensional queueing processes , 1980 .
[22] Fouad A. Tobagi,et al. Multiaccess Protocols in Packet Communication Systems , 1980, IEEE Trans. Commun..
[23] Mario Gerla,et al. Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..
[24] John Capetanakis,et al. Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.
[25] Marc A. Kaplan,et al. A sufficient condition for nonergodicity of a Markov chain , 1979 .
[26] J. Keilson. Markov Chain Models--Rarity And Exponentiality , 1979 .
[27] J. Keilson,et al. Exponential spectra as a tool for the study of server-systems with several classes of customers , 1978, Journal of Applied Probability.
[28] Leonard Kleinrock. On flow control in computer networks , 1978 .
[29] R. Tweedie. Criteria for classifying general Markov chains , 1976, Advances in Applied Probability.
[30] Leonard Kleinrock,et al. Packet Switching in a Multiaccess Broadcast Channel: Performance Evaluation , 1975, IEEE Trans. Commun..
[31] Carl M. Harris,et al. Fundamentals of queueing theory , 1975 .
[32] Norman M. Abramson,et al. Packet switching with satellites , 1973, AFIPS National Computer Conference.
[33] Paul G. Marlin,et al. On the Ergodic Theory of Markov Chains , 1973, Oper. Res..
[34] A. G. Pakes,et al. Some Conditions for Ergodicity and Recurrence of Markov Chains , 1969, Oper. Res..
[35] W. Rudin. Real and complex analysis , 1968 .
[36] K. Chung. Markov Chains with Stationary Transition Probabilities , 1961 .
[37] F. G. Foster. On the Stochastic Matrices Associated with Certain Queuing Processes , 1953 .