Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Joseph D. Langford

dblp:17/4621 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 78% Storage systems · 22%
Computer networks
1 paper
Network performance modeling · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
queueing models
0.021990
Queuing Analysis of an Optical Disk Jukebox Based Office System · IEEE Trans. Computers 1990
Queueing analysis of an optical disk based office system · INFOCOM 1988
Performance modeling and evaluation › queueing models
priority queueing
0.021990
Queuing Analysis of an Optical Disk Jukebox Based Office System · IEEE Trans. Computers 1990
Queueing analysis of an optical disk based office system · INFOCOM 1988
Storage systems
optical storage
0.021990
Queueing analysis of an optical disk based office system · INFOCOM 1988
Queuing Analysis of an Optical Disk Jukebox Based Office System · IEEE Trans. Computers 1990
Performance modeling and evaluation › queueing models › closed queueing networks
finite-source queueing
0.011988
Queueing analysis of an optical disk based office system · INFOCOM 1988
Network performance modeling
markov chain model
0.011986
Models for analysis of packet voice communications systems · IEEE J. Sel. Areas Commun. 1986
Network performance modeling
queueing analysis
0.011986
Models for analysis of packet voice communications systems · IEEE J. Sel. Areas Commun. 1986
Network performance modeling › markov chain model
semi-markov model
0.011986
Models for analysis of packet voice communications systems · IEEE J. Sel. Areas Commun. 1986
Network performance modeling › network simulation
discrete-event simulation
0.011986
Models for analysis of packet voice communications systems · IEEE J. Sel. Areas Commun. 1986

Methods — techniques the papers use, named apart from their topics

queueing analysis · 0.0throughput analysis · 0.0m/d/1 analysis · 0.0continuous-time markov chain · 0.0
YearPublicationVenuePosition
1990 Queuing Analysis of an Optical Disk Jukebox Based Office System
abstract
The system is modeled as a single-server queueing system having a finite number of each of two types of worker: document user and document entry operator. Worker think times are assumed to be exponentially distributed while job service times are drawn from general distributions; worker think times and job service times are dependent upon worker type. Throughput and waiting times as a function of the number of users of each type are analyzed under a nonpreemptive rule in which document use has priority over document entry.>
John N. Daigle, Robert B. Kuehl, Joseph D. Langford
IEEE Trans. Computers3
1988 Queueing analysis of an optical disk based office system
abstract
The authors consider worker waiting times and throughput for an optical-disk-based document storage and retrieval system in an office environment. They model the system as a single-server queuing system having a finite number of each of two types of worker: document user and document entry. Worker think times are assumed to be exponentially distributed while job service times are drawn from general distributions; worker think times and job service times are dependent on worker type. Throughput and waiting time as a function of the number of users of each type are analyzed under a nonpreemptive rule in which document use has priority over document entry. The methodology developed to assess average delays in finite-source queuing systems with priority appears to be novel.>
John N. Daigle, Robert B. Kuehl, Joseph D. Langford
INFOCOM3
1986 Models for analysis of packet voice communications systems
abstract
In a packet voice communication system, packets are fed to a common queue by a number of independent voice sources and are removed from this queue on a first-come-first-serve basis for transmission over a communication link of finite capacity. Each voice source alternates between active periods, during which packets are generated at regular intervals, and inactive periods, during which no packets are generated. In this paper, we discuss three models, a semi-Markov process model, a continuous-time Markov chain model, and a uniform arrival and service model, to assess the queueing behavior of such systems. Numerical results obtained from each of the three models are compared to each other, to results obtained from a discrete event simulation program, and to results obtained from anM/D/1analysis. Parameters of the model are the average duration of active and inactive periods, the packet generation rate, the communication link capacity, and the total number of voice sources. Conclusions are drawn regarding which models appear to be most appropriate in the parameter ranges investigated.
John N. Daigle, Joseph D. Langford
IEEE J. Sel. Areas Commun.2