We study a multi-server multi-queue system which is intended to model a local area network with slotted ring protocol. Two special cases of the model are analysed and the results are used to motivate an approach to approximate mean queue lengths in the general model.

Title of Dissertation: MULTIFRACTAL INTERNET TRAFFIC MODEL AND ACTIVE QUEUE MANAGEMENT Jia-Shiang Jou, Doctor of Philosophy, 2003 Dissertation directed by: Professor John S. Baras Department of Electrical and Computer Engineering We propose a multilevel (hierarchical) ON/OFF model to simultaneously capture the mono/multifractal behavior of Internet traffic. Parameter estimation methods are deve...

A long queue of vehicles at the gate of a marine terminal is a common traffic phenomenon in a port-city, which sometimes causes problems in urban traffic. In order to be able to solve this issue, we firstly need accurate models to estimate such a vehicle queue length. In this paper, we compare the existing methods in a case study, and evaluate their advantages and disadvantages. Particularly, w...

In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we introduce a resilient priority queue. The deletemin operation of a resilient priority queue retur...

1 Description of the Model This case study is analog to the one described in [2]. We considered a system consisting of a fixed number of m processors and an infinite queue for storing job requests. The processing speed of a processor is described by the rate γ, while λ describes the incoming rate of new jobs. If a new job arrives while at least one processor is idle, the job will be processed d...

We consider two coupled queues with a generalized processor sharing service discipline. The second queue has a much smaller Poisson arrival rate than the first queue, while the customer service times are of comparable magnitude. The processor sharing server devotes most of its resources to the first queue, except when it is empty. The fraction of resources devoted to the second queue is small, ...

This paper studies virtual machine (VM) scheduling in a queueing cloud computing system with stochastical arrivals of heterogeneous jobs by considering jobs’ delay requirements. The delay-optimal VM such is formulated as multi-resource multi-class problem minimize the average job completion time, which often NP-hard. To solve problem, we first propose model that buffers same type one que...

We consider a system comprised of two connected M/M/•/• type queues, where customers of one queue act as servers for the other queue. One queue, Q1, operates as a limited-buffer M/M/1/N − 1 system. The other queue, Q2, has an unlimited-buffer and receives service from the customers of Q1. Such analytic models may represent applications like SETI@home, where idle computers of users are used to p...