Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies

By Baris Ata, S. Sushanth Kumar. 2005

100 citations recorded by the source corpus.

We consider a class of open stochastic processing networks, with feedback routing and overlapping server capabilities, in heavy traffic. The networks we consider satisfy the so-called complete resource pooling condition and therefore have one-dimensional approximating Brownian control problems. We propose a simple discrete review policy for controlling such networks. Assuming 2+ɛ moments on the interarrival times and processing times, we provide a conceptually simple proof of asymptotic optimality of the proposed policy.

Subfields: Computer Networks and Communications, Management Information Systems, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/4f42e57528e744bc9965fe89d0ee39b3631574f3

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Jim G. Dai
  2. Amy R. Ward
  3. Arka P. Ghosh
  4. Dacheng Yao
  5. Ananda P. Weerasinghe
  6. Itai Gurvich

In Management Information Systems

  1. Jim G. Dai
  2. Amy R. Ward
  3. Arka P. Ghosh
  4. Dacheng Yao
  5. Ananda P. Weerasinghe
  6. Itai Gurvich
  7. Anton Braverman
  8. Jiekun Feng

In Statistics and Probability

  1. Jim G. Dai
  2. Dacheng Yao
  3. Itai Gurvich
  4. Anton Braverman
  5. Jiekun Feng
  6. Lihu Xu

Citations in the corpus