default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdrian E. Conway
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c23]Adrian E. Conway, Era Vuksani, Kevin Wright, M. Patrick Collins:
Transient Modeling of Topology-based Worms in Networks with Link Interference. MILCOM 2023: 548-553
2010 – 2019
- 2019
- [j17]Mary R. Schurgot, Michael Wang, Adrian E. Conway, Lloyd G. Greenwald, P. David Lebling:
A Dispersed Computing Architecture for Resource-Centric Computation and Communication. IEEE Commun. Mag. 57(7): 13-19 (2019) - [c22]Adrian E. Conway, Michael Wang, Emir Ljuca, P. David Lebling:
A Dynamic Transport Overlay System for Mission-Oriented Dispersed Computing Over IoBT. MILCOM 2019: 815-820 - 2016
- [c21]Adrian E. Conway:
A cloud-based service for generating ns-3 network simulation programs. SPECTS 2016: 1-8 - 2011
- [j16]Adrian E. Conway:
Fast simulation of service availability in mesh networks with dynamic path restoration. IEEE/ACM Trans. Netw. 19(1): 92-101 (2011)
2000 – 2009
- 2006
- [c20]Adrian E. Conway:
IP Telephony with a Personal IP-PSTN Gateway: Architecture and PSTN-Line Sharing Application. CCECE 2006: 132-135 - [c19]Adrian E. Conway, Bhumip Khasnabish:
End-to-End Network Reliability Modeling of Enterprise VoIP Services. NOMS 2006: 404-413 - 2004
- [c18]Adrian E. Conway:
Output-based method of applying PESQ to measure the perceptual quality of framed speech signals. WCNC 2004: 2521-2526 - 2003
- [j15]Adrian E. Conway, Yali Zhu:
A simulation-based methodology and tool for automating the modeling and analysis of voice-over-IP perceptual quality. Perform. Evaluation 54(2): 129-147 (2003) - [j14]Adrian E. Conway, Man Li:
Estimating the Traffic Distribution Matrix of a Packet-Switched Network Using Aggregate Traffic Measurements. Telecommun. Syst. 24(1): 9-28 (2003) - 2002
- [c17]Adrian E. Conway, Yali Zhu:
Analyzing Voice-over-IP Subjective Quality as a Function of Network QoS: A Simulation-Based Methodology and Tool. Computer Performance Evaluation / TOOLS 2002: 289-308 - [c16]Adrian E. Conway:
A passive method for monitoring voice-over-IP call quality with ITU-T objective speech quality measurement methods. ICC 2002: 2583-2586 - [c15]Adrian E. Conway, Yali Zhu:
Applying objective perceptual quality assessment methods in network performance modeling. ICCCN 2002: 116-123 - 2000
- [c14]Adrian E. Conway:
Monitoring Application-Level VoIP Grade of Service at a PSTM-IP Network Gateway. Computer Performance Evaluation / TOOLS 2000: 374-377 - [c13]Adrian E. Conway:
A performance monitoring system for VoIP gateways. Workshop on Software and Performance 2000: 38-43
1990 – 1999
- 1999
- [c12]Adrian E. Conway, Catherine Rosenberg:
A simple balanced fair blocking mechanism for discrete-time multiplexing of bursty traffic sources. ICCCN 1999: 36-41 - 1998
- [c11]Adrian E. Conway:
Performance modeling of layered network protocol software implemented with UNIX STREAMS facilities: application to a frame relay access device. WOSP 1998: 101-106 - 1997
- [c10]Adrian E. Conway, Sue B. Moon, Paul Skelly:
Synchronized Two-Way Voice Simulation Tool for Internet Phone Performance Analysis and Evaluation. Computer Performance Evaluation 1997: 108-122 - 1996
- [j13]Eugene Pinsky, Adrian E. Conway:
Mean-Value Analysis of Multi-Facility Blocking Models with State-Dependent Arrivals. Perform. Evaluation 24(4): 303-309 (1996) - [c9]Adrian E. Conway, Catherine Rosenberg:
Weighted Fair Blocking Mechanisms for Discrete-Time Multiplexing. INFOCOM 1996: 1045-1053 - 1995
- [j12]Adrian E. Conway, Julian Keilson:
Analysis of a two-stage finite buffer flow controlled queueing model by a compensation method. Oper. Res. Lett. 18(2): 65-74 (1995) - 1994
- [j11]Adrian E. Conway, Eugene Pinsky, Srinivasan Tridandapani:
Efficient Decomposition Methods for the Analysis of Multi-Facility Blocking Models. J. ACM 41(4): 648-675 (1994) - [j10]Eugene Pinsky, Adrian E. Conway, Wei Liu:
Blocking formulae for the Engset model. IEEE Trans. Commun. 42(6): 2213-2214 (1994) - [j9]Adrian E. Conway, Julian Keilson:
ATM cell multiplexer analysis by a compensation method. IEEE Trans. Commun. 42(234): 1084-1095 (1994) - [c8]Eugene Pinsky, Adrian E. Conway:
Stochastic Modeling and Analysis of WDM Lightwave Networks. INFOCOM 1994: 560-568 - 1993
- [j8]Adrian E. Conway, David E. O'Brien:
Hybrid analysis of response time distributions in queueing networks. IEEE Trans. Commun. 41(7): 1091-1101 (1993) - [c7]Adrian E. Conway, Dragomir D. Dimitrijevic, R. Hwang:
Hierarchical Simulation of Layered Protocol Architectures Using Formal Specifications. Data Communication Networks and their Performance 1993: 309-325 - 1992
- [j7]Eugene Pinsky, Adrian E. Conway:
Computational algorithms for blocking probabilities in circuit-switched networks. Ann. Oper. Res. 35(1): 31-41 (1992) - [j6]Adrian E. Conway, Nicolas D. Georganas:
Queuing Networks - Exact Computational Algorithms: A Unified Theory Based on Decomposition and Aggregation (Book Review). SIGMETRICS Perform. Evaluation Rev. 20(2): 24-26 (1992) - [c6]Adrian E. Conway, Eugene Pinsky:
A Decomposition Method for the Exact Analysis of Circuit-Switched Networks. INFOCOM 1992: 996-1003 - 1991
- [j5]Adrian E. Conway:
A Perspective on the Analytical Performance Evaluation of Multilayered Communication Protocol Architectures. IEEE J. Sel. Areas Commun. 9(1): 4-14 (1991) - [c5]Adrian E. Conway, David E. O'Brien:
Estimating response time distributions in queueing networks. Performance of Distributed Systems and Integrated Communication Networks 1991: 225-244 - [c4]Eugene Pinsky, Adrian E. Conway:
Exact computation of blocking probabilities in state-dependent multi-facility blocking models. Performance of Distributed Systems and Integrated Communication Networks 1991: 383-392 - 1990
- [c3]Adrian E. Conway:
A New Method of Parametric Analysis for Product Form Queueing Networks. Performance 1990: 19-33
1980 – 1989
- 1989
- [b1]Adrian E. Conway, Nicolas D. Georganas:
Queueing networks - exact computational algorithms: a unified theory based on decomposition and aggregation. Computer systems, MIT Press 1989, ISBN 978-0-262-03145-5, pp. I-X, 1-234 - [j4]Adrian E. Conway:
Product-Form and Insensitivity in Circuit-Switched Networks with Failing Links. Perform. Evaluation 9(3): 209-215 (1989) - [j3]Adrian E. Conway, Edmundo de Souza e Silva
, Stephen S. Lavenberg:
Mean Value Analysis by Chain of Product Form Queueing Networks. IEEE Trans. Computers 38(3): 432-442 (1989) - 1986
- [j2]Adrian E. Conway, Nicolas D. Georganas:
RECAL - a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks. J. ACM 33(4): 768-791 (1986) - [j1]Adrian E. Conway, Nicolas D. Georganas:
Decomposition and Aggregation by Class in Closed Queueing Networks. IEEE Trans. Software Eng. 12(10): 1024-1040 (1986) - [c2]Adrian E. Conway, Nicolas D. Georganas:
An Efficient Algorithm for Semi-Homogeneous Queueing Network Models. SIGMETRICS 1986: 92-99 - 1985
- [c1]Adrian E. Conway, Nicolas D. Georganas:
RECAL - A New Efficient Algorithm for the Exact Analysis of Multiple-Chain Closed Queueing Networks. SIGMETRICS 1985: 14
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-24 23:09 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:
