Queuing model based on scheduling strategies affect local network services

• Authors: Zakaria Suliman Zubi;Ismaeel H. Al-Dubar
• Venue: CIS'09 Proceedings of the international conference on Computational and information science 2009
• Year: 2009

This paper is a comprehensive study of some queuing scheduling strategies that operates on a local network. The study addresses the most convenient strategies used in operating systems. It indicates a new queue model based on some scheduling strategies that affect a local network services. The model was propose by us and entitled as Queuing Model Based on Scheduling Strategies in Local Network Services (QMBSSLNS). The aim of this model is to accelerate the arriving jobs in a local queue. Jobs sent through a local network suffers always from delays caused by several reasons, one of these reasons we believe is the scheduling strategies used. We are going to investigate the most common strategies used in queuing jobs on local network and some interesting properties including the arrival theorem, exact aggregation and insensitivity. This will motivate us to represent a particular system features such as batch arrivals and departures and finite capacity queues in a visual mode. Some scheduling strategies such as first come first serve (FCFS), last come first serve (LCFS), overall throughput, resource path, average queue length and average waiting times will be indicating as well. Average Performance measures will be evaluating based on Generic Cell Rate Algorithm (GCRA) algorithm and Markov process. A framework form will be implemented to improve the model, this framework will simulate the job priority, the queue length distribute, average responding, job state, resource path and throughput. Performance evaluation often involves the use of queuing network models. QMBSSLNS has been also proposing to analyze and schedule queuing job on a local network structure in a comfortable and easy-to-use environment.