Daniel P. Heyman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 49 from 49

2005

Sizing Backbone Internet LinksDaniel P. Heyman. ior, 53(4):575-585, 2005. [doi]

2003

Modeling multiple IP traffic streams with rate limitsDaniel P. Heyman, David Lucantoni. ton, 11(6):948-958, 2003. [doi]

A new method for analyzing feedback-based protocols with applications to engineering Web traffic over the InternetDaniel P. Heyman, T. V. Lakshman, Arnold L. Neidhardt. comcom, 26(8):785-803, 2003. [doi]

2001

Performance and control of network systemsRobert D. van der Mei, Daniel P. Heyman. pe, 43(4):201-202, 2001.

2000

Performance implications of very large service-time variancesDaniel P. Heyman. pe, 40(1-3):47-70, 2000.

1998

Studies of random demands on network costsTamra Carpenter, Daniel P. Heyman, Iraj Saniee. telsys, 10(3-4):409-421, 1998.

Some Issues in Performance Modeling of Data TeletrafficDaniel P. Heyman. pe, 34(4):227-247, 1998.

Overcoming Instability In Computing The Fundamental Matrix For A Markov ChainDaniel P. Heyman, Dianne P. O'Leary. siammax, 19(2):534-540, April 1998. [doi]

1997

A Parallel Implementation of the GTH AlgorithmDavid M. Cohen, Daniel P. Heyman, Asya Rabinovitch, Danit Brown. informs, 9(2):218-223, 1997. [doi]

The GBAR source model for VBR videoconferencesDaniel P. Heyman. ton, 5(4):554-560, 1997. [doi]

A New Method for Analysing Feedback-Based Protocols with Applications to Engineering Web Traffic over the InternetDaniel P. Heyman, T. V. Lakshman, Arnold L. Neidhardt. sigmetrics 1997: 24-38

1996

Source models for VBR broadcast-video trafficDaniel P. Heyman, T. V. Lakshman. ton, 4(1):40-48, 1996. [doi]

What are the implications of long-range dependence for VBR-video traffic engineering?Daniel P. Heyman, T. V. Lakshman. ton, 4(3):301-317, 1996. [doi]

1995

On the Choice of Alternative Measures in Importance Sampling with Markov ChainsSigrún Andradóttir, Daniel P. Heyman, Teunis J. Ott. ior, 43(3):509-519, 1995. [doi]

Fundamental Results on the Performance of ATM Multiplexers with Applications to Video TeleconferencingAnwar Elwalid, Daniel P. Heyman, T. V. Lakshman, Debasis Mitra, Alan Weiss. sigmetrics 1995: 86-97

Fundamental Bounds and Approximations for ATM Multiplexers with Applications to Video TeleconferencingAnwar Elwalid, Daniel P. Heyman, T. V. Lakshman, Debasis Mitra, Alan Weiss. jsac, 13(6):1004-1016, 1995.

Performance Impacts of Self-Similarity in Traffic (Panel)Ashok Erramilli, Walter Willinger, T. V. Lakshman, Daniel P. Heyman, Amarnath Mukherjee, San-qi Li, Onuttom Narayan. sigmetrics 1995: 265-266

Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov ChainDaniel P. Heyman, Meredith J. Goldsmith. informs, 7(1):101-108, 1995. [doi]

Accurate Computation of the Fundamental Matrix of a Markov ChainDaniel P. Heyman. siammax, 16(3):954-963, 1995. [doi]

1994

Reliable software and communication III: congestion control and network reliabilityBrian A. Coan, Daniel P. Heyman. jsac, 12(1):40-45, 1994. [doi]

Statistical analysis and simulation study of VBR broadcast-video trafficDaniel P. Heyman, T. V. Lakshman. camad 1994: [doi]

Source Models for VBR Broadcast-Video TrafficT. V. Lakshman, Daniel P. Heyman. infocom 1994: 664-671

1993

1992

Smoothing Methods for Variance Reduction in Simulation of Markov ChainsSigrún Andradóttir, Daniel P. Heyman, Teunis J. Ott. wsc 1992: 453-457 [doi]

A Performance Model of the Credit Manager AlgorithmDaniel P. Heyman. cn, 24(1):81-91, 1992.

Statistical analysis and simulation study of video teleconference traffic in ATM networksDaniel P. Heyman, Ali J. Tabatabai, T. V. Lakshman. tcsv, 2(1):49-59, 1992. [doi]

1990

Another Way to Solve Complex Chemical EquilibriaDaniel P. Heyman. ior, 38(2):355-358, 1990. [doi]

1989

Numerical Solution of Linear Equations Arising in Markov Chain ModelsDaniel P. Heyman, Alyson Reeves. informs, 1(1):52-60, 1989. [doi]

Traffic Processes in Queueing Networks: A Markov Renewal Approach (Ralph L. Disney and Peter C. Kiessler)Daniel P. Heyman. siamrev, 31(3):506-507, 1989. [doi]

Limits for Queues as the Waiting Room GrowsDaniel P. Heyman, Ward Whitt. questa, 5(4):381-392, 1989.

1986

The Effects of Random Message Sizes on the Performance of the CSMA/CD ProtocolDaniel P. Heyman. tcom, 34(6):547-553, 1986. [doi]

1985

Regenerative Analysis and Steady State Distributions for Markov ChainsWinfried K. Grassmann, Michael I. Taksar, Daniel P. Heyman. ior, 33(5):1107-1116, 1985. [doi]

The Push-Out-Priority Queue DisciplineDaniel P. Heyman. ior, 33(2):397-403, 1985. [doi]

1984

Disk Performance in a Transaction-Oriented SystemDaniel P. Heyman, Shalom Tsur. SICOMP, 13(4):669-681, 1984.

Preface - Reliability and MaintainabilityDaniel P. Heyman, Nozer D. Singpurwalla. ior, 32(3):477, 1984. [doi]

1982

Mathematical Models of Database DegradationDaniel P. Heyman. TODS, 7(4):615-631, 1982. [doi]

1980

The Relation between Customer and Time Averages in QueuesDaniel P. Heyman, Shaler Stidham Jr.. ior, 28(4):983-994, 1980. [doi]

1977

Queueing Systems, Volume 2: Computer applications. by Leonard Kleinrock John Wiley & Sons, Inc., New York 1976, 549 Pages, $24.95Daniel P. Heyman. networks, 7(3):285-286, 1977. [doi]

1976

QUEUEING SYSTEMS, VOLUME 1: THEORY by Leonard Kleinrock John Wiley & Sons, Inc., New York, 1975, $19.95, 417 pagesDaniel P. Heyman. networks, 6(2):189-190, 1976. [doi]

1975

A diffusion model approximation for the GI/G/1 queue in heavy trafficDaniel P. Heyman. bstj, 54(9):1637-1646, 1975. [doi]

1974

c QueueDaniel P. Heyman, M. Segal. ior, 22(3):575-581, 1974. [doi]

1973

Approximate Queuing Models for Multiprogramming Computer SystemsBenjamin Avi-Itzhak, Daniel P. Heyman. ior, 21(6):1212-1230, 1973. [doi]

1968

G/1 Queuing SystemsDaniel P. Heyman. ior, 16(2):362-382, 1968. [doi]

Bounds on the Optimal Operating Policy for a Class of Single-Server QueuesDaniel P. Heyman, Kneale T. Marshall. ior, 16(6):1138-1146, 1968. [doi]

Sign in or sign up to see more results.

runs on WebDSL