We consider the problem of task assignment in a distributed server system, where short jobs are separated from long jobs, but short jobs may be run in the long job partition if it is idle (cycle stealing). Jobs are assumed to be nonpreemptible, where short and long jobs have generallydistributed service requirements, and arrivals are Poisson. We consider two variants of this problem: a central ...

In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...

This paper studies a generic model for cooperative cognitive radio networks where the secondary user is equipped with a finite length relaying queue as well as a finite length battery queue. Our prime objective is to characterize the stable throughput region. Nevertheless, the complete characterization of stable throughput region is notoriously difficult, since the computation of the steady sta...

Today’s market share of Intelligent Network (IN) service is growing rapidly in wireless networks due to the rapid advances in wireless telecommunication and IN technology. To guarantee network independent IN services, mobility of IN service subscribers has to be taken into account. This paper proposes new designs of Global Service Logic for the IN service enhancement, which increase call comple...

Congestion pricing imposes a usage fee on a public resource during times of high demand. Road pricing involves cordoning off a section of the city and imposing a fee on vehicles that enter it. Parking pricing increases the costs of on-street and perhaps off-street parking. Following an historical review, we develop a new queueing model of the parking pricing problem, recognizing that many urban...

Efficient operation of multipath routing is considered as one of the most important aspects for the success of MPLS traffic engineering. Multipath routing has an advantage over the traffic routing based on single shortest paths because single path routing may lead to unbalanced traffic situations and degraded QoS (Quality of Service). This paper proposes a novel analytical queueing model for th...

We consider queuing systems with coupled processors, where the service rate at each queue varies depending on the set of queues in the system with non-zero queue lengths. In general, such queuing systems are very difficult to analyze and steady state queue length distributions are known only for two-queue systems. The coupled-processors model arises naturally in the study of several systems whe...

We consider a setting where qubits are processed sequentially, and derive fundamental limits on the rate at which classical information can be transmitted using quantum states that decohere in time. Specifically, we model the sequential processing of qubits using a single server queue, and derive explicit expressions for the capacity of such a ‘queue-channel.’ We also demonstrate a sweet-spot p...

Join the Shortest Queue (JSQ) is a popular routing policy for server farms. However, until now all analysis of JSQ has been limited to First-Come-First-Serve (FCFS) server farms, whereas it is known that web server farms are better modeled as Processor Sharing (PS) server farms. We provide the first approximate analysis of JSQ in the PS server farm model for general job size distributions, obta...