A congestion avoidance scheme allows a network to operate in the region of low delay and high throughput. Such scheme prevent a network from entering in to congested state. RED(Random Early Detection), is one such congestion avoidance mechanism used for effectively control of congestion. In RED, router uses only the average queue size, as a congestion indicator and the average queue length is i...

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

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

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

In this paper we analyze the average queue lengths in a combined input-output queued switch using a maximal size matching scheduling algorithm. We compare these average queue lengths to the average queue lengths achieved by an optimal switch. We model the cell arrival process as independent and identically distributed between time slots and uniformly distributed among input and output ports. Fo...

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 rate1 service at each queue. When the service at queues is exponentia...

In this paper, a state feedback H¥ controller is proposed in order to design an active queue management (AQM) system based on congestion control algorithm for networks supporting TCP protocols. In this approach, the available link bandwidth is modeled as a time-variant disturbance. The purpose of this paper is to design a controller which is capable of achieving the queue size and can guarantee...