#### Filter Results:

#### Publication Year

1992

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Sean Meyn
- 2007

Prerequisites and Co-requisites • Exposure to basic control concepts (e.g., EEL 4657) • Stochastic processes, with an introduction to Markov chains (e.g., EEL5544) • Working knowledge of Matlab Further information to appear at the ccc website, or contact me at meyn@ece. The broad goal is to develop tools for decision-making in complex networked systems.… (More)

The subject of this paper is open multiclass queueing networks, which are common models of communication networks, and complex manufacturing systems such as wafer fabrication facilities. We provide suucient conditions for the existence of bounds on long-run average moments of the queue lengths at the various stations, and we bound the rate of convergence of… (More)

- Vivek S. Borkar, Sean P. Meyn
- SIAM J. Control and Optimization
- 2000

It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated o.d.e. This in turn implies convergence of the algorithm. Several speciic classes of algorithms are considered as applications. It is found that the results provide (i) a simpler derivation of known results for… (More)

- D Down, S P Meyn, R L Tweedie
- 1995

Geometric convergence of Markov chains in discrete time on a general state has been studied in detail in 15]. Here we develop a similar theory for '-irreducible continuous time processes, and consider the following types of criteria for geometric convergence: (a) the existence of exponentially bounded hitting times on one and then all suitably \small" sets;… (More)

- Sean P Meyn
- 1995

This paper treats transience for queueing network models by considering an associated uid model. If starting from any initial condition the uid model explodes at a linear rate, then the associated queueing network with i.i.d. service times and a renewal arrival process explodes faster than any fractional power. There has been much recent i n terest in… (More)

- S. Yuksel, Sean P. Meyn
- IEEE Trans. Automat. Contr.
- 2013

—It is known that state-dependent, multi-step Lya-punov bounds lead to greatly simplified verification theorems for stability for large classes of Markov chain models. This is one component of the " fluid model " approach to stability of stochastic networks. In this paper we extend the general theory to random-ized multi-step Lyapunov theory to obtain… (More)

- P R Kumar, Sean Meyn
- 1996

We consider the problems of performance analysis and stability/instability determination of queueing networks and scheduling policies. We exhibit a strong duality relationship between the performance of a system, and its stability analysis via mean drift. We obtain a variety of linear programs to conduct such stability and performance analyses. A certain… (More)

- Muriel Médard, Jianyi Huang, Andrea J. Goldsmith, Sean P. Meyn, Todd P. Coleman
- IEEE Trans. Wireless Communications
- 2004

—We study different notions of capacity for time-slotted ALOHA systems. In these systems, multiple users synchronously send packets in a bursty manner over a common additive white Gaussian noise (AWGN) channel. The users do not coordinate their transmissions, which may collide at the receiver. For such a system, we define both single-slot capacity and… (More)

- SEAN P. MEYN
- 2008

In Part I we developed stability concepts for discrete chains, together with Foster-Lyapunov criteria for them to hold. Part II was devoted to developing related stability concepts for continuous-time processes. In this paper we develop criteria for these forms of stability for continuous-parameter Markovian processes on general state spaces, based on… (More)

- Sean P. Meyn
- 1997

The average cost optimal control problem is addressed for Markov decision processes with unbounded cost. It is found that the policy iteration algorithm generates a sequence of policies which are c-regular (a strong stability condition), where c is the cost function under consideration. This result only requires the existence of an initial c-regular policy,… (More)