default search action
Daniel P. Heyman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
- [j41]Daniel P. Heyman:
Sizing Backbone Internet Links. Oper. Res. 53(4): 575-585 (2005) - 2003
- [j40]Daniel P. Heyman, T. V. Lakshman, Arnold L. Neidhardt:
A new method for analyzing feedback-based protocols with applications to engineering Web traffic over the Internet. Comput. Commun. 26(8): 785-803 (2003) - [j39]Daniel P. Heyman, David Lucantoni:
Modeling multiple IP traffic streams with rate limits. IEEE/ACM Trans. Netw. 11(6): 948-958 (2003) - 2001
- [j38]Robert D. van der Mei, Daniel P. Heyman:
Performance and control of network systems. Perform. Evaluation 43(4): 201-202 (2001) - 2000
- [j37]Daniel P. Heyman:
Performance implications of very large service-time variances. Perform. Evaluation 40(1-3): 47-70 (2000)
1990 – 1999
- 1998
- [j36]Daniel P. Heyman:
Some Issues in Performance Modeling of Data Teletraffic. Perform. Evaluation 34(4): 227-247 (1998) - [j35]Daniel P. Heyman, Dianne P. O'Leary:
Overcoming Instability In Computing The Fundamental Matrix For A Markov Chain. SIAM J. Matrix Anal. Appl. 19(2): 534-540 (1998) - [j34]Tamra Carpenter, Daniel P. Heyman, Iraj Saniee:
Studies of random demands on network costs. Telecommun. Syst. 10(3-4): 409-421 (1998) - 1997
- [j33]David M. Cohen, Daniel P. Heyman, Asya Rabinovitch, Danit Brown:
A Parallel Implementation of the GTH Algorithm. INFORMS J. Comput. 9(2): 218-223 (1997) - [j32]Daniel P. Heyman:
The GBAR source model for VBR videoconferences. IEEE/ACM Trans. Netw. 5(4): 554-560 (1997) - [c8]Daniel P. Heyman, T. V. Lakshman, Arnold L. Neidhardt:
A New Method for Analysing Feedback-Based Protocols with Applications to Engineering Web Traffic over the Internet. SIGMETRICS 1997: 24-38 - 1996
- [j31]Daniel P. Heyman, T. V. Lakshman:
Source models for VBR broadcast-video traffic. IEEE/ACM Trans. Netw. 4(1): 40-48 (1996) - [j30]Daniel P. Heyman, T. V. Lakshman:
What are the implications of long-range dependence for VBR-video traffic engineering?. IEEE/ACM Trans. Netw. 4(3): 301-317 (1996) - 1995
- [j29]Daniel P. Heyman, Meredith J. Goldsmith:
Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain. INFORMS J. Comput. 7(1): 101-108 (1995) - [j28]Sigrún Andradóttir, Daniel P. Heyman, Teunis J. Ott:
On the Choice of Alternative Measures in Importance Sampling with Markov Chains. Oper. Res. 43(3): 509-519 (1995) - [j27]Anwar Elwalid, Daniel P. Heyman, T. V. Lakshman, Debasis Mitra, Alan Weiss:
Fundamental Bounds and Approximations for ATM Multiplexers with Applications to Video Teleconferencing. IEEE J. Sel. Areas Commun. 13(6): 1004-1016 (1995) - [j26]Daniel P. Heyman:
Accurate Computation of the Fundamental Matrix of a Markov Chain. SIAM J. Matrix Anal. Appl. 16(3): 954-963 (1995) - [c7]Anwar Elwalid, Daniel P. Heyman, T. V. Lakshman, Debasis Mitra, Alan Weiss:
Fundamental Results on the Performance of ATM Multiplexers with Applications to Video Teleconferencing. SIGMETRICS 1995: 86-97 - [c6]Ashok Erramilli, Walter Willinger, T. V. Lakshman, Daniel P. Heyman, Amarnath Mukherjee, San-qi Li, Onuttom Narayan:
Performance Impacts of Self-Similarity in Traffic (Panel). SIGMETRICS 1995: 265-266 - 1994
- [j25]Brian A. Coan, Daniel P. Heyman:
Reliable software and communication III: congestion control and network reliability. IEEE J. Sel. Areas Commun. 12(1): 40-45 (1994) - [c5]Daniel P. Heyman, T. V. Lakshman:
Statistical analysis and simulation study of VBR broadcast-video traffic. CAMAD 1994 - [c4]T. V. Lakshman, Daniel P. Heyman:
Source Models for VBR Broadcast-Video Traffic. INFOCOM 1994: 664-671 - 1993
- [j24]Winfried K. Grassmann, Daniel P. Heyman:
Computation of Steady-State Probabilities for Infinite-State Markov Chains with Repeating Rows. INFORMS J. Comput. 5(3): 292-303 (1993) - [j23]Daniel P. Heyman:
Stochastic Models in Queueing Theory (J. Medhi). SIAM Rev. 35(2): 320-321 (1993) - [j22]David M. Cohen, Daniel P. Heyman:
Performance modeling of video teleconferencing in ATM networks. IEEE Trans. Circuits Syst. Video Technol. 3(6): 408-420 (1993) - [j21]Sigrún Andradóttir, Daniel P. Heyman, Teunis J. Ott:
Variance Reduction Through Smoothing and Control Variates for Markov Chain Simulations. ACM Trans. Model. Comput. Simul. 3(3): 167-189 (1993) - [c3]David M. Cohen, Daniel P. Heyman:
A Simulation Study of Video Teleconferencing Traffic in ATM Networks. INFOCOM 1993: 894-901 - [c2]David M. Cohen, Daniel P. Heyman:
An almost regenerative simulation of video teleconferencing traffic. WSC 1993: 489-497 - 1992
- [j20]Daniel P. Heyman:
A Performance Model of the Credit Manager Algorithm. Comput. Networks ISDN Syst. 24(1): 81-91 (1992) - [j19]Daniel P. Heyman, Ali J. Tabatabai, T. V. Lakshman:
Statistical analysis and simulation study of video teleconference traffic in ATM networks. IEEE Trans. Circuits Syst. Video Technol. 2(1): 49-59 (1992) - [c1]Sigrún Andradóttir, Daniel P. Heyman, Teunis J. Ott:
Smoothing Methods for Variance Reduction in Simulation of Markov Chains. WSC 1992: 453-457 - 1990
- [j18]Daniel P. Heyman:
Another Way to Solve Complex Chemical Equilibria. Oper. Res. 38(2): 355-358 (1990)
1980 – 1989
- 1989
- [j17]Daniel P. Heyman, Alyson Reeves:
Numerical Solution of Linear Equations Arising in Markov Chain Models. INFORMS J. Comput. 1(1): 52-60 (1989) - [j16]Daniel P. Heyman, Ward Whitt:
Limits for Queues as the Waiting Room Grows. Queueing Syst. Theory Appl. 5(4): 381-392 (1989) - [j15]Daniel P. Heyman:
Traffic Processes in Queueing Networks: A Markov Renewal Approach (Ralph L. Disney and Peter C. Kiessler). SIAM Rev. 31(3): 506-507 (1989) - 1986
- [j14]Daniel P. Heyman:
The Effects of Random Message Sizes on the Performance of the CSMA/CD Protocol. IEEE Trans. Commun. 34(6): 547-553 (1986) - 1985
- [j13]Daniel P. Heyman:
The Push-Out-Priority Queue Discipline. Oper. Res. 33(2): 397-403 (1985) - [j12]Winfried K. Grassmann
, Michael I. Taksar, Daniel P. Heyman:
Regenerative Analysis and Steady State Distributions for Markov Chains. Oper. Res. 33(5): 1107-1116 (1985) - 1984
- [j11]Daniel P. Heyman, Nozer D. Singpurwalla:
Preface - Reliability and Maintainability. Oper. Res. 32(3): 477 (1984) - [j10]Daniel P. Heyman, Shalom Tsur:
Disk Performance in a Transaction-Oriented System. SIAM J. Comput. 13(4): 669-681 (1984) - 1982
- [j9]Daniel P. Heyman:
Mathematical Models of Database Degradation. ACM Trans. Database Syst. 7(4): 615-631 (1982) - 1980
- [j8]Daniel P. Heyman, Shaler Stidham Jr.:
The Relation between Customer and Time Averages in Queues. Oper. Res. 28(4): 983-994 (1980)
1970 – 1979
- 1977
- [j7]Daniel P. Heyman:
Queueing Systems, Volume 2: Computer applications. by Leonard Kleinrock John Wiley & Sons, Inc., New York 1976, 549 Pages, $24.95. Networks 7(3): 285-286 (1977) - 1976
- [j6]Daniel P. Heyman:
QUEUEING SYSTEMS, VOLUME 1: THEORY by Leonard Kleinrock John Wiley & Sons, Inc., New York, 1975, $19.95, 417 pages. Networks 6(2): 189-190 (1976) - 1975
- [j5]Daniel P. Heyman:
A diffusion model approximation for the GI/G/1 queue in heavy traffic. Bell Syst. Tech. J. 54(9): 1637-1646 (1975) - 1974
- [j4]Daniel P. Heyman, M. Segal:
Technical Note - Conditional Delays Measured in Events for the M/M/c Queue. Oper. Res. 22(3): 575-581 (1974) - 1973
- [j3]Benjamin Avi-Itzhak, Daniel P. Heyman:
Approximate Queuing Models for Multiprogramming Computer Systems. Oper. Res. 21(6): 1212-1230 (1973)
1960 – 1969
- 1968
- [j2]Daniel P. Heyman:
Optimal Operating Policies for M/G/1 Queuing Systems. Oper. Res. 16(2): 362-382 (1968) - [j1]Daniel P. Heyman, Kneale T. Marshall:
Bounds on the Optimal Operating Policy for a Class of Single-Server Queues. Oper. Res. 16(6): 1138-1146 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: