43 results about "Queuing network model" patented technology

A method of distributing load amongst two or more computer system resources. The method includes distributing load to the system resources in accordance with their modeled response times and a predetermined Service level Agreement (SLA) associated with each system resource. By modeling the response time of each resource, load can be distributed with a view to maintaining response times within a predetermined Service level Agreement (SLA). The response time may be modeled by analytical modeling, which uses a queuing network model for predicting the response time, typically along with other parameters such as, utilization, throughput and queue length.

The invention discloses a method for analyzing performances of a single closed fork-join queuing network based on horizontal decomposition. The method is characterized in that a horizontal decomposition method is utilized to decompose a single closed fork-join queuing network model into a plurality of product-form queuing network models, thus an average value analysis method can be used to quickly solve the model, and the horizontal decomposition is only carried out on a queuing network comprising nested fork-joint operations once without recursive decomposition like a layer decomposition method, thereby greatly reducing the computational complexity, improving the efficiency that a computer computes and analyzes the single closed fork-join queuing network model, and promoting the computational performance.

The invention discloses a cargo location allocation method applied in a multi-storey shuttle car automatic storage system. The method includes: firstly, generating the plane layout structure data of the system according to the number of shelves and roadways; Analyze the idle time of the hoist, establish an open-loop queuing network model to describe the system, use the decomposition method to analyze the relationship between the waiting time of the shuttle car, the idle time of the hoist, and the time for entering and leaving the warehouse, and determine that the higher the arrival rate of the tasks served by the shuttle car The goods should be arranged in the bottom cargo space, and the goods with higher correlation should be divided into different layers to ensure that there can be multiple shuttle services at the same time. Finally, the principle of dividing the storage area according to the correlation of the items is proposed, the correlation matrix of the outgoing items is established, and the items are clustered with the ant colony algorithm, and the storage areas are combined in the two-dimensional plane according to the analysis results of the queuing network model Arrangement to realize the storage allocation of goods. Through the implementation of the present invention, the waiting time of the shuttle car and the idle time of the hoist can be effectively reduced, thereby improving the utilization rate of the equipment and the throughput of the distribution center.