In this paper, we study how rational agents infer the quality of a good (a product or a service) by observing the queue that is formed by other rational agents to obtain the good. Agents also observe privately the realization of a signal that is imperfectly correlated with the true quality of the good. Based on the queue length information and the signal realization, agents decide whether to jo...

—In today's computer architectures, the con guration of the storage system as well as the distribution of blocks within them have a big impact on the system's performance. Different RAIDs levels can have a signi cant in uence on cost, reliability, scalability as well as performance. In this paper, we propose a basic fuzzy queueing model (M/M/1) to evaluate the fuzzy arrival rate as well as the ...

This paper presents a novel methodology for approximating the queue length (the number of customers in the system) distributions of time-varying non-Markovian manyserver queues (e.g., Gt/Gt/nt queues), where the number of servers (nt) is large. Our methodology consists of two steps. The first step uses phase-type distributions to approximate the general inter-arrival and service times, thus gen...

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

Delay or queue length information has the potential to influence the decision of a customer to join a queue. Thus, it is imperative for managers of queueing systems to understand how the information that they provide will affect the performance of the system. To this end, we construct and analyze two two-dimensional deterministic fluid models that incorporate customer choice behavior based on d...

Consider a number of parallel queues, each with an arbitrary capacity and multiple identical exponential servers. The service discipline in each queue is firstcome-first-served (FCFS). Customers arrive according to a state-dependent Poisson process. Upon arrival, a customer joins a queue according to a state-dependent policy or leaves the system immediately if it is full. No jockeying among que...

In stack and queue layouts the vertices of a graph are linearly ordered from left to right, where each edge corresponds to an item and the left and right end vertex of each edge represents the addition and removal of the item to the used data structure. A graph admitting a stack or queue layout is a stack or queue graph, respectively. Typical stack and queue layouts are rainbows and twists visu...

Switches in interconnection networks for highly parallel shared memory computer systems may be implemented with different internal buffer structures. For a 2×2 synchronous switch, previous studies have often assumed a switch composed of two queues, one at each output, each of which has unbounded size and may accept two inputs every clock cycle. Hardware implementations may actually use simpler ...

A Bernoulli schedule is random service discipline for a multi-class priority queueing system which operates as follows: If queue i(l :s i :s N) is not empty just after servicing a message in its queue, a message in queue i is served again with probability Pi, and the highest class message present in the system is served with probability 1-Pi, where 0 :s Pi :s 1. This paper presents an analysis ...

In this paper, we consider a single-server queue with stationary input, where each job joining the queue has an associated deadline. The deadline is a time constraint on job sojourn time and may be finite or infinite. If the job does not complete service before its deadline expires, it abandons the queue and the partial service it may have received up to that point is wasted. When the queue ope...