2,752 research outputs found
Spontaneous Resonances and the Coherent States of the Queuing Networks
We present an example of a highly connected closed network of servers, where
the time correlations do not go to zero in the infinite volume limit. This
phenomenon is similar to the continuous symmetry breaking at low temperatures
in statistical mechanics. The role of the inverse temperature is played by the
average load.Comment: 3 figures added, small correction
Geometric Universality of Currents
We discuss a non-equilibrium statistical system on a graph or network.
Identical particles are injected, interact with each other, traverse, and leave
the graph in a stochastic manner described in terms of Poisson rates, possibly
dependent on time and instantaneous occupation numbers at the nodes of the
graph. We show that under the assumption of constancy of the relative rates,
the system demonstrates a profound statistical symmetry, resulting in geometric
universality of the statistics of the particle currents. This phenomenon
applies broadly to many man-made and natural open stochastic systems, such as
queuing of packages over the internet, transport of electrons and
quasi-particles in mesoscopic systems, and chains of reactions in bio-chemical
networks. We illustrate the utility of our general approach using two enabling
examples from the two latter disciplines.Comment: 15 pages, 5 figure
Asymptotic Approximations for TCP Compound
In this paper, we derive an approximation for throughput of TCP Compound
connections under random losses. Throughput expressions for TCP Compound under
a deterministic loss model exist in the literature. These are obtained assuming
the window sizes are continuous, i.e., a fluid behaviour is assumed. We
validate this model theoretically. We show that under the deterministic loss
model, the TCP window evolution for TCP Compound is periodic and is independent
of the initial window size. We then consider the case when packets are lost
randomly and independently of each other. We discuss Markov chain models to
analyze performance of TCP in this scenario. We use insights from the
deterministic loss model to get an appropriate scaling for the window size
process and show that these scaled processes, indexed by p, the packet error
rate, converge to a limit Markov chain process as p goes to 0. We show the
existence and uniqueness of the stationary distribution for this limit process.
Using the stationary distribution for the limit process, we obtain
approximations for throughput, under random losses, for TCP Compound when
packet error rates are small. We compare our results with ns2 simulations which
show a good match.Comment: Longer version for NCC 201
Implementation of The Open Jackson Queuing Network to Reduce Waiting Time
Waiting for service is a common thing in-hospital services. The more patients are waiting, the service delay increases, so waiting time in the queue gets longer. In health care in a hospital, a patient will queue several times in more than one queue in a hospital outpatient installation. The case study in this research is the queue system in the hospital's outpatient treatment, implementing an open Jackson queueing network to minimize waiting time. The workstations examined in this study were the registration, pre-consultation, and cardiology poly consultation, and pharmacy. The data is carried out for six days, counting the number of arrivals and departures with each point at intervals of 5 minutes. Applying the Jackson open queue network model, a recommendation was obtained for the hospital to increase employees' numbers. The registration workstation must have four servers; a poly cardiology workstation had three nurses and four doctors, while for pharmacy, had seven employees. With this personnel's addition, patients' total waiting time in the queuing system is approximately 12 minutes/patient. So, it can reduce waiting times in the queueing system that was initially 108 minutes/patient
Some topics in web performance analysis
This thesis consists of four papers on web performance analysis. In the first paper we investigate the performance of overload control through queue length for two different web server architectures. The simulation result suggests that the benefit of request prioritization is noticeable only when the capacities of the sub-systems match each other. In the second paper we present an M/G/1/K*PS queueing model of a web server. We obtain closed form expressions for web server performance metrics such as average response time, throughput and blocking probability. The model is validated through real measurements. The third paper studies a queueing system with a load balancer and a pool of identical FCFS queues in parallel. By taking the number of servers to infinite, we show that the average waiting time for the system is not always minimized by routing each customer to the expected shortest queue when the information used for decision is stale. In the last paper we consider the problem of admission control to an M/M/1 queue under periodic observations with average cost criterion. The problem is formulated as a discrete time Markov decision process whose states are fully observable. A proof of the existence of the average optimal policy by the vanishing discounted approach is provided. We also show that the optimal policy is nonincreasing with respect to the observed number of customers in the system
Analysis of Multiple Flows using Different High Speed TCP protocols on a General Network
We develop analytical tools for performance analysis of multiple TCP flows
(which could be using TCP CUBIC, TCP Compound, TCP New Reno) passing through a
multi-hop network. We first compute average window size for a single TCP
connection (using CUBIC or Compound TCP) under random losses. We then consider
two techniques to compute steady state throughput for different TCP flows in a
multi-hop network. In the first technique, we approximate the queues as M/G/1
queues. In the second technique, we use an optimization program whose solution
approximates the steady state throughput of the different flows. Our results
match well with ns2 simulations.Comment: Submitted to Performance Evaluatio
- …