We consider a two-queue polling model in which customers upon arrival join the shorter of two queues. Customers arrive according to a Poisson process and the service times in both queues are independent and identically distributed random variables having the exponential distribution. The two-dimensional process of the numbers of customers at the queue where the server is and at the other queue ...

We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. A setup at a queue is incurred only if there are customers waiting at the polled queue. We obtain the transforms of the queue length and sojourn time di...

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

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

The purpose of this paper is to analyze the effect of a particular control doctrine applied to the service mechanism of a queuing process with lapse. It is assumed that the service discipline is FCFS (first come, first served), arrival process is Poisson, service time distribution is exponential, service process is one phase and the capacity is infinite. It is also assumed that the customer may...

Two-tier cellular networks provide an enhanced use of the networks' resources for both high and low speed users. However, they cause an increase in the number of handoffs between cells due to having smaller cell sizes in the microcell tier. An effective approach used to prevent the dropping of ongoing calls in a network is delaying these calls in a queue until a channel becomes available. In th...

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

A banyan network analysis technique is presented which more accurately models a congested network than other reported techniques. The analysis is based on the observation that a full queue (within the switching modules making up the network) causes traac to back up. For a short time after becoming full the free space in the queue is limited to no more than one slot. A queue in such a condition ...

Hierarchical Cellular Networks provide an enhanced use of the indoor networks. These two lower layers called picocell and femtocell consist both high and low speed users. To prevent the dropping and blocking probabilities of ongoing calls in a network, cells are spitted into the small sizes. Although, many effective approaches are used but these delaying calls reach in a queue until a channel b...

A method estimating the queue length in city street networks was proposed using the data of roll time occupancy. The key idea of this paper is that when the queue length in front of the queue detector becomes longer, the speeds of the following vehicles to pass through the detector will become smaller, resulting in higher occupancy with constant traffic intensity. Considering the relationship b...