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...

With a large percentage of total system cost going to system administration tasks, ease of system management remains a difficult and important goal. As a step towards that goal, this dissertation presents a success story on building systems that are self-predicting. Self-predicting systems continuously monitor themselves and provide quantitative answers to What...if questions about hypothetical...

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 ...

—Nowadays distributed computing approach has become very popular due to several advantages over the centralized computing approach as it also offers high performance computing at a very low cost. Each router implements some queuing mechanism for resources allocation in a best possible optimize manner and governs with packet transmission and buffer mechanism. In this paper, different types of qu...

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...

The given paper deals with the problem of structural control (dependability planning) for a wide class of any multi-component standby systems consisting of unreliable renewable elements. Mathematical models for interaction of degradation and its compensation processes in the above mentioned systems are constructed and partially investigated. These models represent open and closed queuing system...

We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. All these languages —matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models— describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, exp...

Service time distributions at computer processing units are often nonexponential. Empirical studies show that different programs may have markedly different processing time requirements. When queuing disciplines are first come, first served, preemptive priority or nonpreemptive priority, models reflecting these characteristics are difficult to analyze exactly. Available approximate techniques a...