The Equivalent Queuing Model by a Partition Algorithm for Tree Connected Servers

摘要

This paper aims at analysis efficiency in estimating the performance of tree connected servers. We use a queuing model to represent their equivalent performance and service quality. The queue types of the connection servers can be classified as serial, parallel and tree connections. We design an algorithm to simplify the equivalent serial-parallel queues. According to the equivalent queues we compute the system response time of tree connected servers. We use a network simulation and an analytical software tool to represent the equivalent performance of the queue. Our simulation uses various different service rates and arrival rates of the queue models and finds the system response time. We also measure the average system response time in comparison with the simulation result to find out the service rates of the actual servers and evaluate the accuracy of the algorithm. We will find that the error margin of measurement, simulation and computing ranges from 1.37%-19.27%.