A Virtualized Target Queuing Balanced Model Using Vmax/M/G-Load(Min)/Cache-P2λM for Reducing Queuing Time Expectation of Customer Delay Tolerance

Abstract

Queuing theory is a formal mathematical model of late response arrival of customer waiting in various access services, accepting processes management as a whole field. Often multiple server sorting can be used to estimate the number of servers and service rates be high due too lacking of time, with an average delay sequence in the analysis. Using these sequence models to read more than one sequence during execution approximates system sorting performance. To resolve this problem we modulated the distributed process into Virtualized Target Queuing Balanced Model (VTQBM) using Vmax/M/G-Load (Min)/Cache-P2λM for reducing queuing time expectation of customer delay tolerance. The Virtual Resource queuing System is optimized with fork-join queue by creating single to multimodal service performance using target request load balancer in a shared distribution mode. Sorting the request buffer cache is created based on Customer Request Arrival Rate (CRAR) and resource output preferred to check with target rule waiting in the Load balancer. To improve the use of model complex virtual resource sharing shared with customer arrival to Cache Target Load Allocator (CTLA) on queuing distributed resources, This fork joiner target the service performance to reduce the customer waiting time in queuing and produce outputs can achieve a different parameter input transformation on queuing theory.