Marty Reiman - Publications

  1. Reflected Brownian Motion on an Orthant, J. M. Harrison and M. I. Reiman, Ann. Prob., 9:2 (April 1981), pp. 302-308.
  2. On the Distribution of Multidimensional Reflected Brownian Motion, J. M. Harrison and M. I. Reiman, SIAM J. Appl. Math., 41:2 (October 1981), pp. 345-361.
  3. The Heavy Traffic Diffusion Approximation for Sojourn Times in Jackson Networks, M. I. Reiman, Applied Probability-Computer Science, The Interface, R. L. Disney and T. J. Ott (editors), Birkhauser, Boston, II (1982), pp. 409-422.
  4. Diffusion Approximations for Storage Processes in Computer Systems, E. G. Coffman, Jr. and M. I. Reiman, Proc. ACM SIGMETRICS Conf., 1983, pp. 93-117.
  5. Diffusion Approximations for Computer-Communication Systems, E. G. Coffman, Jr. and M. I. Reiman, Mathematical Computer Performance and Reliability, G. Iazeolla, P. J. Courtois and A. Hordijk (editors), Elsevier, North-Holland, 1984, pp. 33-53.
  6. Some Diffusion Approximations with State Space Collapse, M. I. Reiman, Modelling and Performance Evaluation Methodology, F. Baccelli and G. Fayolle (editors), Springer-Verlag, 1984, pp. 209-240.
  7. Open Queueing Networks in Heavy Traffic, M. I. Reiman, Mathematics of Operations Research, 9:3 (August 1984), pp. 441-458.
  8. Sensitivity Analysis Via Likelihood Ratios, M. I. Reiman and A. Weiss, Proceedings of the 1986 Winter Simulation Conference, IEEE, 1986, pp. 285-289.
  9. Stability of a Queueing System with Concurrent Service and Locking, C. A. Courcoubetis, M. I. Reiman and B. Simon, SIAM Journal on Computing, 16:1 (February 1987), pp. 169-178.
  10. The Forwarding Index of Communication Networks, F. R. K. Chung, E. G. Coffman, Jr., M. I. Reiman and B. Simon, IEEE Transactions on Information Theory, 33:2 (March 1987), pp. 224-232.
  11. Optimal Control of a Queueing System with Simultaneous Service Requirements, C. A. Courcoubetis and M. I. Reiman, IEEE Transactions on Automatic Control, 32:8 (August 1987), pp. 717-727.
  12. Construction of the Stationary Regime of Queues with Locking, F. Baccelli, C. A. Courcoubetis and M. I. Reiman, Stoch. Proc. Appl., 26:2 (November 1987), pp. 257-265.
  13. Optimal Buffer Allocation in Light Traffic, M. I. Reiman, Proceedings of 26th Conference on Decision and Control, IEEE, 1987, pp. 1499-1503.
  14. Simterpolations: Estimating an Entire Queueing Function from a Single Sample Path, M. I. Reiman, B. Simon and J. S. Willie, Proceedings of the 1987 Winter Simulation Conference, IEEE, 1987, pp. 358-363.
  15. A Multiclass Feedback Queue in Heavy Traffic, M. I. Reiman, Advances in Applied Probability, 20:1 (March 1988), pp. 179-207.
  16. An Interpolation Approximation for Queueing Systems with Poisson Input, M. I. Reiman and B. Simon, Operations Research, 36:3 (May-June 1988), pp. 454-469.
  17. A Boundary Property of Semimartingale Reflecting Brownian Motions, M. I. Reiman and R J. Williams, Prob. Th. and Rel. Fields, 77:1 (1988), pp. 87-97.
  18. Light Traffic Limits of Sojourn Time Distributions in Markovian Queueing Networks, M. I. Reiman and B. Simon, Commun. Statist.-Stochastic Models, 4:2 (1988), pp. 191-233.
  19. The Application of Likelihood Ratio Based Derivative Estimates in Interpolation Approximations for Queueing Systems, M. I. Reiman, B. Simon, A. Weiss and J. S. Willie, Analysis and Optimization of Systems, A. Bensousson and John Lions (editors), Springer-Verlag, 1988, pp. 919-924.
  20. Optimal Dynamic Allocation of Heterogeneous Servers Under the Condition of Total Overload: The Discounted Case, C. A. Courcoubetis and M. I. Reiman, Proceedings of 27th Conference on Decision and Control, IEEE, 1988, pp. 634-639.
  21. Open Queueing Systems in Light Traffic, M. I. Reiman and B. Simon, Mathematics of Operations Research, 14:1 (February 1989), pp. 26-59.
  22. Light Traffic Derivatives Via Likelihood Ratios, M. I. Reiman and A. Weiss, IEEE Transactions on Information Theory, 35:3 (May 1989).
  23. Sensitivity Analysis for Simulations Via Likelihood Ratios, M. I. Reiman and A. Weiss, Oper. Res., 37:5 (September-October 1989).
  24. Asymptotically Optimal Trunk Reservation for Large Trunk Groups, M. I. Reiman, Proceedings of 28th Conference on Decision and Control, IEEE, 1989, pp. 2536-2541.
  25. A Network of Priority Queues in Heavy Traffic: One Bottleneck Station, M. I. Reiman and B.Simon, Queueing Systems, 6:1 (1990), pp. 33-58.
  26. Asymptotically Exact Decomposition Approximations for Open Queueing Networks, M. I. Reiman, Operations Research Letters, 6, November 1990, pp. 363-370.
  27. Optimal Control of a Heterogeneous Two Server Queue in Light Traffic, M. I. Reiman, Proc. of 1990 Conf. on Inf. Sciences and Systems, Princeton University, 1990, pp. 497-500.
  28. Asymptotic Properties of a Recursive Procedure for Simultaneous Estimation, M. I. Reiman, Probability in the Engineering and Information Sciences, 4:4 (1990), pp. 461-475.
  29. Some Allocation Problems for Critically Loaded Loss Systems with Independent Links, M. I. Reiman, Proceedings of Performance '90, P. J. B. King, I. Mitrani and R. J. Pooley (editors), North Holland, 1990, pp. 145-158.
  30. Performance Analysis of Concurrent-Read Exclusive-Write, M. I. Reiman and P. E. Wright, Proceedings ACM Sigmetrics Conference, 1991, pp. 168-177.
  31. Optimal Trunk Reservation for a Critically Loaded Link, M. I. Reiman, Teletraffic and Datatraffic: In a Period of Change, A. Jensen and V. B. Iverson (editors), North Holland, 1991, pp. 247-252.
  32. Storage Limited Queues in Heavy Traffic, E. G. Coffman, Jr., A. A. Puhalskii and M. I. Reiman, Probability in the Engineering and Information Sciences, 5:4 (1991), pp. 499-522.
  33. A Critically Loaded Multiclass Erlang Loss System, M. I. Reiman, Queueing Systems, 9 (1991), pp. 65-82.
  34. Simterpolation: A Simulation Based Interpolation Approximation for Queueing Systems, M. I. Reiman, B. Simon and J. S. Willie, Operations Research, 40:4 (1992), pp. 706-723.
  35. Variance Reduction for Sensitivity Estimates Obtained from Regenerative Simulation, P. V. Nguyen and M. I. Reiman, Operations Research Letters, 14:1 (1993), pp. 9-18.
  36. Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks, J. G. Dai, V. Nguyen and M. I. Reiman, Operations Research, 42:1 (1994), pp. 119-136.
  37. Processor Shared Buffers with Reneging, E. G. Coffman, A. A. Puhalskii, M. I. Reiman and P. E. Wright, Performance Evaluation, 19 (1994), pp. 25-46.
  38. Performance Models of Multirate Traffic In Various Network Implementations, M. I. Reiman and J. A. Schmitt, The Fundamental Role of Teletraffic in the Evolution of Telecommunication Networks, 1994, pp. 1217-1228, Labetoulle, J. and Roberts, J. W. (editors), Elsevier.
  39. Optimality of Randomized Trunk Reservation, E. A. Feinberg and M. I. Reiman, Probability in the Engineering and Informational Sciences, 8 (1994), pp. 463-489.
  40. Polling Systems with Zero Switchover Times: A Heavy Traffic Averaging Principle, E. G. Coffman, Jr., A. A. Puhalskii and M. I. Reiman, Annals of Applied Probability, 5:3 (1995), pp. 681-719.
  41. Dynamic Scheduling of a Two-Class Queue with Setups, M. I. Reiman and L. M. Wein, Operations Research, 46:4 (July-August 1998), pp. 532-547.
  42. Dynamic Call Admission Control of an ATM Multiplexer with On/Off Sources, M. I. Reiman, J. Wang and D. Mitra, Proceedings of the 34th Conference on Decision and Control, IEEE, 1995, pp. 1382-1388.
  43. The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies, D. M. Markowitz, M. I. Reiman and L. M. Wein, Operations Research, 48:1 (January-February 2000), pp. 136-154.
  44. Polling Systems in Heavy Traffic: A Bessel Process Limit, E. G. Coffman, Jr., A. A. Puhalskii and M. I. Reiman, Mathematics of Operations Research, 23:2 (1998), pp. 257-304.
  45. Heavy Traffic Analysis of Polling Systems in Tandem, M. I. Reiman and L. M. Wein, Operations Research, 47:4 (July-August 1999), pp. 524-534.
  46. Fluid and Diffusion Limits for Queues in Slowly Changing Environments, G. L. Choudhury, A. Mandelbaum, M. I. Reiman and W. Whitt, Commun. Statist.-Stochastic Models, 13:1 (1997), pp. 121-146.
  47. Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem, M. I. Reiman, R. Rubio and L. M. Wein, Transportation Science, 33:4 (November 1999), pp. 361-380.
  48. On Pooling in Queueing Networks, A. Mandelbaum and M. I. Reiman, Management Science, 44:7 (1998), pp. 971-981.
  49. Robust Admission Control for Heterogeneous ATM Systems with Both Cell and Call QoS Requirements, D. Mitra, M. I. Reiman and J. Wang, Teletraffic Contributions for the Information Age, V. Ramaswami and P. Wirth (editors), Elsevier, 1997, pp. 1421-1432.
  50. A Critically Loaded Multirate Link with Trunk Reservation, A. A. Puhalskii and M. I. Reiman, Queueing Systems, 28 (1998), pp. 157-190.
  51. Robust Dynamic Admission Control for Unified Cell and Call QoS in Statistical Multiplexers, D. Mitra, M. I. Reiman and J. Wang, IEEE J. Sel. Areas in Commun., 16:5 (1998), pp. 692-707.
  52. Strong Approximations for Markovian Service Networks, A. Mandelbaum, W. A. Massey and M. I. Reiman, Queueing Systems, 30 (1998), pp. 149-201.
  53. Call Admission: A New Approach to Quality of Service, M. I. Reiman and A. Shwartz, Queueing Systems, 38 (2001), pp. 125-148.
  54. Time Varying Multiserver Queues with Abandonment and Retrials, A. Mandelbaum, W. A. Massey, M. I. Reiman, and B. Rider, Teletraffic Engineering in a Competitive World, P. Key and D. Smith (editors), Elsevier, 1999, pp. 355-364.
  55. Pricing in a Large Single Link Loss System, C. A. Courcoubetis and M. I. Reiman, Teletraffic Engineering in a Competitive World, P. Key and D. Smith (editors), Elsevier, 1999, pp. 737-746.
  56. Designing a Call Center with Impatient Customers, O. Garnett, A. Mandelbaum, and M. I. Reiman, Manufacturing and Service Operations Management, 4 (2002), pp. 208-227.
  57. The Multiclass GI/PH/N Queue in the Halfin-Whitt Regime, A. A. Puhalskii and M. I. Reiman, Advances in Applied Probability, 32 (2000), pp. 564-595.
  58. Waiting Time Asymptotics for Time Varying Multiserver Queues with Abandonment and Retrials, A. Mandelbaum, W.A. Massey, M.I. Reiman, and A.L. Stolyar, Thirty-seventh Annual Allerton Conference, 1999, pp.1095-1104.
  59. Queue Lengths and Waiting Times for Multiserver Queues with Abandonment and Retrials, A. Mandelbaum, W.A. Massey, M.I. Reiman, B. Rider, and A.L. Stolyar, Telecommunications Systems, 21 (2002), pp. 149-171.
  60. Dimensioning Large Call Centers, S. Borst, A. Mandelbaum, and M.I. Reiman, Operations Research, 52 (2004), pp. 17-34.
  61. Providing Bandwidth Guarantees Over a Best-effort Network: Call Admission and Pricing, C.A. Courcoubetis, A. Dimakis, and M.I. Reiman, IEEE INFOCOM 2001, 2001.
  62. Fluid and Heavy Traffic Diffusion Limits for a Generalized Processor Sharing Model, K. Ramanan and M.I. Reiman, Annals of Applied Probability, 13 (2003), pp. 100-139.
  63. A Brownian Control Problem for a Simple Queueing System in the Halfin-Whitt Regime, R. Atar, A. Mandelbaum, and M.I. Reiman, Systems and Control Letters, 51 (2004), pp. 269-275.
  64. Scheduling a Multi-Class Queue with Many Exponential Servers: Asymptotic Optimality in Heavy-Traffic, R. Atar, A. Mandelbaum, and M.I. Reiman, Annals of Applied Probability, 14 (2004), pp.1084-1134.
  65. A New and Simple Policy for the Continuous Review Lost Sales Inventory Model, M.I. Reiman, submitted.
  66. An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem, M.I. Reiman and Q. Wang, Mathematics of Operations Research, to appear.
  67. The Heavy Traffic Limit of an Unbalanced Generalized Processor Sharing Model, K. Ramanan and M.I. Reiman, Annals of Applied Probability, to appear.