Previous covering models for emergency service consider all the calls to be of the same importance and impose the same waiting time constraints independently of the service's priority. This type of constraint is clearly inappropriate in many contexts. For example, in urban medical emergency services, calls that involve danger to human life deserve higher priority over calls for more routine inc...

The application of Queuing Theory to quantify the relationships between trajectory uncertainties due to aviation operations, precision of navigation and control, and traffic flow efficiency in the National Airspace System is discussed. This work builds on a previous research effort on Markovian queuing network models of the NAS. While the Markovian network model provides closed-form analytical ...

Recently it has been reported that variable bit rate (VBR) video traffic exhibits long-range dependence (LRD). Various processes have been proposed for modeling traffic with LRD and analyzing its effects on network performance. However, in the previous models it is not possible to identify the effects of shortand long-term correlation of video traffic on queuing performance, and thus many seemi...

Network Simulator 3 (ns-3) is a powerful tool for modeling the behavior of computer networks using simulation. We have developed three well known differentiated service packet queuing methods: strict priority queuing, weighted fair queuing, and weighted round robin queuing, in the simulation framework. In this paper, we present the implementation details of the three modules as well as their us...

In this paper, we are going to present the simulation results of comparison of five queuing algorithms (Drop Tail, Fair Queuing, Stochastic Fair Queuing, Deficit Round Robin and Random Early Detection) using ns-2 as simulation environment. Comparison of the queuing algorithms is based on attack-intensity. We are checking the performance of each queuing algorithm on a particular queue limit agai...

In this paper we are concerned with the problem of determining the potential for load balancing in a distributed computing system. We define a precise measure, called the number of sharable jobs, of this potential in terms of the number of jobs that can usefully be transferred across sites in the system. Properties of this measure are derived, including a general formula for its probability dis...

A set of simple queuing theory models which can model the average response of a network of computers to a given traffic load has been implemented. The impact of variations in traffic patterns and intensities, channel capacities, and message protocols can be assessed using them because of the lack of fine detail in the network traffic rates, traffic patterns, and the hardware used to implement t...

of dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy PARALLEL DISCRETE EVENT SIMULATION OF QUEUING NETWORKS USING GPU-BASED HARDWARE ACCELERATION By Hyungwook Park December 2009 Chair: Paul A. Fishwick Major: Computer Engineering Queuing networks are used widely in computer simulation stud...

We develop a simple multiscale model for the analysis and synthesis of nonGaus-sian, long-range-dependent (LRD) network traac loads. The wavelet transform eeec-tively decorrelates LRD signals and hence is well-suited to model such data. However, traditional wavelet-based models are Gaussian in nature and so can at best match second-order statistics of inherently nonGaussian traac loads. Using a...

This paper uses a queuing model to evaluate completion times in accident and emergency (A&E) departments in the light of the UK Government’s target of completing and discharging 98% of patients inside 4 hours. It illustrates how flows though an A&E can be very accurately represented as a queuing process, how the outputs of a queuing model can be used to visualise and interpret the 4-hour hour G...