Stochastic Analysis of Computer and Communication SystemsHideaki Takagi Analytical techniques for evaluating the performance of computer and communication systems have evolved hand in hand with the progress in these systems since the late 1960's, and an enormous amount of knowledge has been accumulated in this interplay of applied mathematics and computer science. This book includes nineteen lengthy surveys of the state of the art of performance evaluation techniques, and an extensive bibliography. The topics include stochastic processes and queueing theory applied to performance analysis, and performance models of computer systems and communication networks. Articles have been contributed by leading scientists from five continents. |
From inside the book
Results 1-3 of 83
Page 19
... given cdf and then transforming to the desired distribution using the inverse cdf . Given a random variable X with strictly increasing continuous cdf F1 on some interval [ a , b ) , b≤∞ , F ( X ) is uniformly distributed on [ 0 , 1 ] ...
... given cdf and then transforming to the desired distribution using the inverse cdf . Given a random variable X with strictly increasing continuous cdf F1 on some interval [ a , b ) , b≤∞ , F ( X ) is uniformly distributed on [ 0 , 1 ] ...
Page 705
... given by Na < n . The analysis in [ 11 ] was carried out assuming the more general situation when the number of packets per arriving message was considered to be a geometrically distributed random variable . In addition , the message ...
... given by Na < n . The analysis in [ 11 ] was carried out assuming the more general situation when the number of packets per arriving message was considered to be a geometrically distributed random variable . In addition , the message ...
Page 723
... given position in the polling table . Let us assume that the average time spent switching between the stations per cycle is given by R ( i.e. , R is the average length of a cycle minus the average time that all the stations spend ...
... given position in the polling table . Let us assume that the average time spent switching between the stations per cycle is given by R ( i.e. , R is the average length of a cycle minus the average time that all the stations spend ...
Contents
K W Fendick and W Whitt 3 | 18 |
Synchronization in Queueing Systems | 57 |
Towards Computable Stability Criteria for Some Multidimensional | 131 |
Copyright | |
18 other sections not shown
Common terms and phrases
algorithm ALOHA analyzed applications approximation approximation algorithm arrival process assumed assumption average behavior Boxma buffer capacity channel closed queueing networks computer systems consider customers cycle cyclic decomposition defined delay denote disk equations ergodic exponentially distributed finite function given heavy traffic IEEE IEEE Trans independent interarrival limit local area networks Markov chain messages multiple networks with blocking node normalized mean workload North-Holland obtained offered traffic Operations optimal packet packet switching parameters Performance Evaluation performance measures Poisson Poisson process polling systems priority priority queues PRNET probability problem Proc processor product form protocol queue length queueing model queueing network models queueing networks queueing system Queueing Theory random variables recursion Research resequencing routing scheduling Section sequence service discipline single server slot solution stability station stochastic subnetwork switching switchover Takagi tandem Theorem throughput token passing token ring transmission transmitted users waiting