Using a queuing approach to describe a shared memory parallel computer system, it can be considered as a parallel computer system with a shared single ready queue. This can depict a single queue parallel server queuing model. Some models that are based on probability density function have been used to model the performance of the queuing system. This paper uses recursive models to evaluate the ...

Output Queuing (OQ) and Input Queuing (IQ) are the two basic queuing strategies implemented in routers. IQ has been identified as the simplest and the most scalable. However, IQ achieves only 58.6% throughput due to the Head Of Line (HOL) blocking effect. The Virtual Output Queuing (VOQ) strategy is a proffered solution to the HOL blocking. It has been shown that VOQ can achieve a 100% throughp...

There are many situations in daily life when a queue is formed. Queuing theory is the mathematical study of waiting lines and it is very useful for analyzing the procedure of queuing of daily life of human being. Queuing theory applies not only in day to day life but also in sequence of computer programming, networks, medical field, banking sectors etc. In this paper, we analyze the basic featu...

in this paper, analysis and simulation of media gateway controller (megaco) based cops (common open policy server) which is a protocol defined in ietf (internet engineering task force) to transport configuration requests and deliver the policies is presented. for this scenario, three queuing models include m/m/1, m/m/c and m/d/c were applied . then, some of the key performance benchmarks look l...

Most of the real queuing systems include special properties and constraints, which can not be analyzed directly by using the results of solved classical queuing models. Lack of Markov chains features, unexponential patterns and service constraints, are the mentioned conditions. This paper represents an applied general algorithm for analysis and optimizing the queuing systems. The algorithm stag...

The paper is devoted on computer simulation of rare event probability, which is a critical issue in areas such as reliabilities, telecommunications, aircraft management, etc. This means that it is necessary to evaluate probabilityties less than 10, which is unreasonable to be simulated with standard Monte Carlo approach. M/M/1/N queuing system and tandem queuing system are under investigation w...

Queuing theory strives to provide analytical solutions to a number of queuing problems. Unfortunately, closed analytical expressions can not be derived for every type of queuing system. Discrete event simulation on the other hand can find solutions to any kind of queuing problem, but the results are stochastic and only specific to a single parameterization. Proxel simulation can bridge the gap ...

Distributed Denial of Service (DDoS) attack is one of the biggest threats now days. This paper aims at providing the simulation results of buffer size and attack intensities effect on various queuing algorithms such as DropTail, Fair Queuing (FQ), Stochastic Fair Queuing (SFQ), Deficit Round Robin (DRR) and Random Early Detection (RED) using ns-2 as a simulation environment. The results in this...

Queuing theory is the branch of Operations research in applied mathematics and deals with phenomenon of waiting lines. Queuing theory is concerned with the mathematical modeling and analysis of systems which provides service to random demands. In this paper, we have focused the applications of queuing theory in the field of healthcare (hospital) i.e. one of the biological paradigm. The health s...