In this work, we propose a new active queue management mechanism called MFQ (Multicast Fair Queuing) for multicast flows. MFQ is independent of the inter-multicast fairness policy and it interacts with a multicast bandwidth allocation module that can implement either a multicast fairness policy or a multicast pricing model and tries using a single FIFO queue to achieve the expected allocation w...

Present investigation deals with optimal management policy for Markovian queue with server breakdowns, vacations and setup. The customers arrive in Poisson fashion to get the service. The server may breakdown during the service and goes for repair immediately. By applying probability generating function technique queue length distribution is obtain for different states of the server. Further we...

Modern computer systems are based on a wide variety of software servers, such as web servers, application servers, database servers, and mail servers. The typical software architecture of such servers includes a set of processes or threads that serve requests submitted to the server. Requests that arrive at the server and find all threads busy, are placed in a queue. Threads that are busy execu...

Considering impatient users in space information networks, a preliminary queue congestion control model was presented. It balanced the network loads and make up for the resource lost from the impatient leaving users. To describe the competition among nodes, the model used queuing game theory. The introduced congestion control platform, which consisted of service nodes, calculated user’s gain to...

active queue management (aqm) plays an important role in the internet congestion control. it tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. random early detection (red) is the most popular active queue management algorithm that has been implemented in the in internet routers and is trying to supply low delay and low packet loss. red algori...

Although the lost profit from lost business is quite difficult to estimate for the queuing systems with cyclic demands, this paper presents a creative and effective approach to formulate waiting cost including balking loss and reneging loss. The balking probability is defined as the balking index θ1 multiplying by the expected queue length Lq and the reneging probability is defined as the reneg...

Current superscalar architectures inherently depend on an instruction issue queue to achieve multiple instruction issue and out-oforder execution. However, the issue queue is implemented as a centralized structure and mainly causes globally broadcasting operations to wake up and select the instructions. Therefore, a large issue queue ultimately results in a low clock rate along with a high circ...

In join the shortest queue networks, incoming jobs are assigned to the shortest queue from among a randomly chosen subset of D queues, in a system of N queues; after completion of service at its queue, a job leaves the network. We also assume that jobs arrive into the system according to a rateαN Poisson process, α < 1, with rate-1 service at each queue. When the service at queues is exponentia...

In join the shortest queue networks, incoming jobs are assigned to the shortest queue from among a randomly chosen subset of D queues, in a system of N queues; after completion of service at its queue, a job leaves the network. We also assume that jobs arrive into the system according to a rateαN Poisson process, α < 1, with rate-1 service at each queue. When the service at queues is exponentia...

We consider an M/G/1 queue with feedback, in which customers, after receiving service, either return to the tail of the queue or depart the system, according to some feedback policy. We derive simple expressions for the expected response time for feedback policies that include Bernoulli feedback and feeding back a xed number of times. Our results reveal some interesting and non-intuitive proper...