25 results on '"Karl Sigman"'
Search Results
2. Marked point processes in discrete time.
3. Closed-Form Approximations for Optimal (r, q) and (S, T) Policies in a Parallel Processing Environment.
4. Using the M/G/1 queue under processor sharing for exact simulation of queues.
5. On simulating a class of Bernstein polynomials.
6. Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for ρ<c.
7. Heavy-traffic limits for nearly deterministic queues: stationary distributions.
8. Analysis of join-the-shortest-queue routing for web server farms.
9. Stochastic Networks: Admission and Routing Using Penalty Functions.
10. Asymptotic convergence of scheduling policies with respect to slowdown.
11. Heavy-traffic limits for nearly deterministic queues.
12. Steady-State Asymptotics for Tandem, Split-Match and Other Feedforward Queues with Heavy Tailed Service.
13. Appendix: A Primer on Heavy-Tailed Distributions.
14. Stationary remaining service time conditional on queue length.
15. Insensitivity for PS server farms with JSQ routing.
16. Delay Moments for FIFO GI/GI/s Queues.
17. New Bounds for Expected Delay in FIFO GI/GI/c Queues.
18. Understanding the slowdown of large jobs in an M/GI/1 system.
19. A Review of Regenerative Processes.
20. Light traffic for workload in queues.
21. Light traffic heuristic for anM/G/1 queue with limited inventory.
22. Editorial Introduction - Queues with Heavy-Tailed Distributions.
23. One-Dependent Regenerative Processes and Queues in Continuous Time.
24. Moments in Tandem Queues.
25. Queues as Harris Recurrent Markov Chains.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.