Computer Communications Network Design and Analysis
Computer Communications Network Design and Analysis
Measures of congestion for computer communication networks.
Measures of congestion for computer communication networks.
Performance Evaluation of the Computer Network Dynamic Congestion Table Algorthm
IEEE Transactions on Computers
Buffer Behavior for Poisson Arrivals and Multiple Synchronous Constant Outputs
IEEE Transactions on Computers
Buffer overflow in a store-and-forward network node
IBM Journal of Research and Development
IEEE Transactions on Computers
Performance Evaluation of the Computer Network Dynamic Congestion Table Algorthm
IEEE Transactions on Computers
Techniques: Computer networking capacity in robotic neural systems
Computer Communications
Computer networking for the robotic neural and sensory systems
Computer Communications
| Hi-index | 14.99 |
A new approximation model for the analysis of a finite buffer GI/G/1 system is presented. The approach consists of formulating the computer node mean waiting time from a discrete time marginal overflow customer per time slot solution of a continuous marginal overflow time per customer solution. The key to the model solution is the quantization of the distribution (fu(u)) of the difference between customer service time and customer interarrival time to obtain areas of sections (quantiles) of this probability density function. These quantiles represent the entries of the probability transition matrix of the change in the number of customers allowed in the queue. Irreducible Markov chains represent these uniform quantization lower and upper bound steady state buffer occupancy solutions for the number of customers in the queue at time slot j. A guideline for selecting the optimal quantization interval width is the numerical relation observed between the optimal range of Peak Measurement Accuracy and Peak Measurement Complexity for finite areas of fu(u).