#### Filter Results:

- Full text PDF available (49)

#### Publication Year

1993

2017

- This year (2)
- Last 5 years (12)
- Last 10 years (30)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- J. G. Dai, Balaji Prabhakar
- INFOCOM
- 2000

In this paper we use fluid model techniques to establish two results concerning the throughput of data switches. For an input-queued switch (with no speedup) we show that a maximum weight algorithm for connecting inputs and outputs delivers a throughput of 100%, and for combined inputand output-queued switches that run at a speedup of 2 we show that any… (More)

- J. G. Dai, Gideon Weiss
- Math. Oper. Res.
- 1996

Reentrant lines can be used to model complex manufacturing systems such as wafer fabrication facilities. As the first step to the optimal or near-optimal scheduling of such lines, we investigate their stability. In light of a recent theorem of Dai (1995) which states that a scheduling policy is stable if the corresponding fluid model is stable, we study the… (More)

Complex systems like semiconductor wafer fabrication facilities (fabs), networks of data switches, and large-scale call centers all demand efficient resource allocation. Deterministic models like linear programs (LP) have been used for capacity planning at both the design and expansion stages of such systems. LP-based planning is critical in setting a… (More)

We consider the problem of existence and uniqueness of semimartingale reflecting Brownian motions (SRBM’s) in convex polyhedrons. Loosely speaking, such a process has a semimartingale decomposition such that in the interior of the polyhedron the process behaves like a Brownian motion with a constant drift and covariance matrix, and at each of the… (More)

- Tolga Tezcan, J. G. Dai
- Operations Research
- 2010

We consider a class of parallel server systems that are known as N-systems. In an N-system, there are two customer classes that are catered by servers in two pools. Servers in one of the pools are cross-trained and can serve customers from both classes whereas all the servers in the other pool can only serve one of the customer classes. A customer reneges… (More)

- J. G. Dai, Wanyang Dai
- Queueing Syst.
- 1999

We consider a queueing network of d single server stations. Each station has a finite capacity waiting buffer, and all customers served at a station are homogeneous in terms of service requirements and routing. The routing is assumed to be deterministic and hence feedforward. A server stops working when the downstream buffer is full. We show that a properly… (More)

- J. G. Dai, John J. Hasenbein, Bara Kim
- Queueing Syst.
- 2007

This paper investigates stability behavior in a variant of a generalized Jackson queueing network. In our network, some customers use a join-the-shortest-queue policy when entering the network or moving to the next station. Furthermore, we allow interarrival and service times to have general distributions. For networks with two stations we derive necessary… (More)

- J. G. Dai, Tolga Tezcan
- Math. Oper. Res.
- 2011

We consider a class of queueing systems that consist of server pools in parallel and multiple customer classes. Customer service times are assumed to be exponentially distributed. We study the asymptotic behavior of these queueing systems in a heavy traffic regime that is known as the Halfin and Whitt many-server asymptotic regime. Our main contribution is… (More)

- J. G. Dai, Shuangchi He
- Math. Oper. Res.
- 2010

We study G/G/n+GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer’s waiting time in queue exceeds his patience time, the customer abandons the system without service. For the performance of such a system, we focus on the abandonment process and the queue-length process. We… (More)

- J. G. Dai, John H. Vande Vate
- Operations Research
- 2000

This paper studies the uid models of two-station multiclass queueing networks with deterministic routing. A uid model is globally stable if the uid network eventually empties under each nonidling dispatch policy. We explicitly characterize the global stability region in terms of the arrival and service rates. We show that the global stability region is… (More)