Hostname: page-component-84b7d79bbc-x5cpj Total loading time: 0 Render date: 2024-07-25T14:41:56.288Z Has data issue: false hasContentIssue false
  • English
  • Français

Obituary: Jacob Willem Cohen

Published online by Cambridge University Press:  14 July 2016

Onno J. Boxma  and
Ryszard Syski
Onno J. Boxma
Affiliation:
Eindhoven University of Technology, Eindhoven, University of Maryland, College Park
Ryszard Syski
Affiliation:
Eindhoven University of Technology, Eindhoven, University of Maryland, College Park
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Short Communications
Information
Journal of Applied Probability , Volume 38 , Issue 2 , June 2001 , pp. 604 - 608
Copyright
Copyright © Applied Probability Trust 2001 

References

Beukelman, B. J., and Cohen, J. W. (1957). Call congestion of transposed multiples. Philips Telecommun. Rev. 17, 145–154.Google Scholar
Boxma, O. J., and Syski, R. (eds) (1988). Queueing Theory and its Applications. Liber Amicorum for J. W. Cohen (CWI Monographs 7). North-Holland, Amsterdam.Google Scholar
Callaert, H., and Cohen, J. W. (1972). A lemma on regular variation of a transient renewal function. Z. Wahrscheinlichkeitsth. 24, 275–278.CrossRefGoogle Scholar
Cohen, J. W. (1955). On stress calculations in helicoidal shells and propeller blades. Doctoral Thesis, Delft University of Technology.Google Scholar
Cohen, J. W. (1957). A survey of queueing problems occurring in telephone and telegraph traffic theory. In Proc. 1st Int. Conf. Operat. Res., Oxford. English Universities Press, London, pp. 138–146.Google Scholar
Cohen, J. W. (1957). Basic problems of telephone traffic theory and the influence of repeated calls. Philips Telecommun. Rev. 18, 49–100.Google Scholar
Cohen, J. W. (1957). The full availability group of trunks with an arbitrary distribution of the inter-arrival times and a negative exponential holding time distribution. Simon Stevin 26, 169–181.Google Scholar
Cohen, J. W. (1957). The generalized Engset formulae. Philips Telecommun. Rev. 18, 158–170.Google Scholar
Cohen, J. W. (1969). The Single Server Queue. North-Holland, Amsterdam.Google Scholar
Cohen, J. W. (1973). Some results on regular variation for distributions in queueing and fluctuation theory. J. Appl. Prob. 10, 343–353.CrossRefGoogle Scholar
Cohen, J. W. (1976). On Regenerative Processes in Queueing Theory (Lecture Notes Econom. Math. Systems 121). Springer, Berlin.Google Scholar
Cohen, J. W. (1979). On networks with generalized processor sharing and a new property of the Erlang B-formula. In Proc. 9th Int. Teletraffic Cong., Torremolinos, Spain.Google Scholar
Cohen, J. W. (1979). The multiple phase service network with generalized processor sharing. Acta Informatica 12, 245–284.CrossRefGoogle Scholar
Cohen, J. W., and Boxma, O. J. (1983). Boundary Value Problems in Queuing System Analysis. North-Holland, Amsterdam.Google Scholar
Cohen, J. W., and Jung, M. M. (1957). Calculations on a method for signal setting. Philips Telecommun. Rev. 17, 81–89.Google Scholar
Boxma, O. J., Cohen, J. W., and Tijms, H. C. (eds) (1986). Teletraffic Analysis and Computer Performance Evaluation. North-Holland, Amsterdam.Google Scholar
Cohen, J. W. (1988). Boundary value problems in queueing theory. Queueing Systems 3, 97–128.CrossRefGoogle Scholar
Cohen, J. W. (1988). On entrance times of a homogeneous N-dimensional random walk: an identity. In A Celebration of Applied Probability (J. Appl. Prob. 25A), ed. Gani, J. Applied Probability Trust, Sheffield, pp. 321–333.Google Scholar
Cohen, J. W., and Pack, C. D. (eds) (1991). Queueing, Performance and Control in ATM (Proc. 13th Int. Teletraffic Cong. Workshop). North-Holland, Amsterdam.Google Scholar
Boxma, O. J., and Cohen, J. W. (1991). The M/G/1 queue with permanent customers. IEEE J. Sel. Areas Commun. 9, 179–184.CrossRefGoogle Scholar
Cohen, J. W. (1991). On the attained waiting time. Adv. Appl. Prob. 23, 660–661.CrossRefGoogle Scholar
Cohen, J. W. (1991). On two teletraffic congress programs: roots and scope. In Teletraffic and Datatraffic in a Period of Change (Proc. 13th Int. Teletraffic Cong.), eds Jensen, A. and Iversen, V. B. North-Holland, Amsterdam, pp. 1059–1065.Google Scholar
Cohen, J. W. (1992). Analysis of Random Walks. IOS Press, Amsterdam.Google Scholar
Cohen, J. W. (1992). On the random walk with zero drifts in the first quadrant of R_2. Stoch. Models 8, 359–374.CrossRefGoogle Scholar
Cohen, J. W. (1993). Complex functions in queueing theory. AEU 47, 300–310.Google Scholar
Cohen, J. W. (1995). On a class of two-dimensional nearest-neighbour random walks. In Studies in Applied Probability (J. Appl. Prob. 31A), eds Galambos, J. and Gani, J. Applied Probability Trust, Sheffield, pp. 207–237.Google Scholar
Cohen, J. W. (1995). Two-dimensional nearest-neighbour queueing models, a review and an example. In Quantitative Models in Parallel Systems, eds Baccelli, F., Jean-Marie, A. and Mitrani, I. Springer, Berlin, pp. 141–152.CrossRefGoogle Scholar
Cohen, J. W. (1996). On periodic Pollaczek waiting time processes. In Athens Conference on Applied Probability and Time Series Analysis, Vol. I. Applied Probability (Lecture Notes Statist. 114), eds Heyde, C. C., Prohorov, Yu. V., Pyke, R. and Rachev, S. T. Springer, New York, pp. 361–378.CrossRefGoogle Scholar
Cohen, J. W., and Down, D. G. (1996). On the role of Rouché's theorem in queueing analysis. Queueing Systems 23, 281–291.CrossRefGoogle Scholar
On periodic Pollaczek waiting time processes. Heyde, C.C., Prohorov, Yu.V., Pyke, R., Rachev, S.T. (eds.). Athens Conference on Applied Probability and Time Series Analysis, Vol. I Applied Probability. In honor of J. Gani. (Lecture Notes in Statistics 114, Springer, New York, 1996) 361–378.Google Scholar
Cohen, J. W. (1997). On the determination of the stationary distribution of a symmetric clocked buffered switch. In Teletraffic Contributions for the Information Age (Proc. 15th Int. Teletraffic Cong.), eds Ramaswami, V. and Wirth, P. E. North-Holland, Amsterdam, pp. 297–308.Google Scholar
Boxma, O. J., and Cohen, J. W. (1998). The M/G/1 queue with heavy-tailed service time distribution. IEEE J. Sel. Areas Commun. 16, 749–763.CrossRefGoogle Scholar
Cohen, J. W. (1998). Analysis of the asymmetrical shortest two-server queueing model. J. Appl. Math. Stoch. Anal. 11, 115–162.CrossRefGoogle Scholar
Cohen, J. W. (1998). On Ryszard Syski. J. Appl. Math. Stoch. Anal. 11, 223–224.CrossRefGoogle Scholar
Cohen, J. W. (1998). A heavy-traffic limit theorem for the GI/G/1 queue with a Pareto-type service time distribution. J. Appl. Math. Stoch. Anal. 11, 247–254.CrossRefGoogle Scholar
Cohen, J. W. (1998). On the asymmetric clocked buffered switch. Queueing Systems 30, 385–404.CrossRefGoogle Scholar
Boxma, O. J., and Cohen, J. W. (1999). Heavy-traffic analysis for the GI/G/1 queue with heavy-tailed distributions. Queueing Systems 33, 177–204.CrossRefGoogle Scholar
Boxma, O. J., Cohen, J. W., and Deng, Q. (1999). Heavy-traffic analysis of the M/G/1 queue with priority classes. In Teletraffic Engineering in a Competitive World (Proc. 16th Int. Teletraffic Cong.), eds Key, P. and Smith, D. North-Holland, Amsterdam, pp. 1157–1167.Google Scholar
Boxma, O. J., and Cohen, J. W. (2000). The single server queue: heavy tails and heavy traffic. In Self-similar Network Traffic and Performance Evaluation, eds Park, K. and Willinger, W. John Wiley, New York, pp. 143–169.CrossRefGoogle Scholar
Cohen, J. W. (1994). On the effective bandwidth in buffer design for the multi-server channels. Res. Rept BS-R9406.Google Scholar
Cohen, J. W. (1994). On the analysis of the symmetrical shortest queue. Res. Rept BS-R9420.Google Scholar
Cohen, J. W. (1994). Analysis of a two-dimensional algebraic nearest-neighbour random walk (queue with paired services). Res. Rept BS-R9437.Google Scholar
Cohen, J. W. (1995). On the symmetrical shortest queue and the compensation approach. Res. Rept BS-R9519. Revised as Res. Rept BS-R9602 (1996).Google Scholar
Cohen, J. W. (1996). On a zero-drift nearest-neighbour random walk. Res. Rept BS-R9615.Google Scholar
Cohen, J. W. (1997). On the M/G/1 queue with heavy-tailed service time distributions. Res. Rept PNA-R9702.Google Scholar
Cohen, J. W. (1997). The M/G/1 fluid model with heavy-tailed message length distributions. Res. Rept PNA-R9714.Google Scholar
Cohen, J. W. (1997). Heavy-traffic limit theorems for the heavy-tailed GI/G/1 queue. Res. Rept PNA-R9719.Google Scholar
Cohen, J. W. (1998). Heavy-traffic theory for the heavy-tailed M/G/1 queue and ν-stable Lévy noise traffic. Res. Rept PNA-R9805.Google Scholar
Cohen, J. W. (1998). The ν-stable Lévy motion in heavy-traffic analysis of queueing models with heavy-tailed distributions. Res. Rept PNA-R9808.Google Scholar
Cohen, J. W. (2000). Random walk with a heavy-tailed jump distribution. Res. Rept PNA-R0010, to appear in Queueing Systems.Google Scholar