Abstract
The authors establish the notion of strong stochastic convexity (SSCX), which implies stochastic convexity. They demonstrate that SSCX is a property exhibited by a wide range of random variables. They also show that SSCX is preserved under random mixture, random summation, and any increasing and convex operations that are applied to a set of independent random variables. Making use of the closure property of SSCX, the authors study GI/G/1 queues and tandem queues with general interarrival and service times and finite intermediate buffers. Applications of the SSCX property in the parametric optimization of such systems are also discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 657-662 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| DOIs | |
| Publication status | Published - Dec 1988 |
| Externally published | Yes |
| Event | Proceedings of the 27th IEEE Conference on Decision and Control - Austin, TX, USA Duration: 7 Dec 1988 → 9 Dec 1988 |
Fingerprint
Dive into the research topics of 'Strong stochastic convexity and its applications in parametric optimization of queueing systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver