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.
? Tutorial for this page

Todd D. Morris

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

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

Computer networks · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-author

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 networks
1 paper
Network performance modeling · 77% Internet architecture and protocols · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 77% Performance modeling and evaluation · 23%

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

TopicWeightPapersLastEvidence papers
Network performance modeling
switch performance analysis
0.011994
Performance modelling of a multi-buffered banyan switch under bursty traffic · IEEE Trans. Commun. 1994
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
banyan network
0.011992
Performance Modelling of a Multi-Buffered Banyan Switch Under Bursty Traffic · INFOCOM 1992
Internet architecture and protocols › ATM networks
ATM switching
0.011994
Performance modelling of a multi-buffered banyan switch under bursty traffic · IEEE Trans. Commun. 1994
Performance modeling and evaluation
analytical modeling
0.011992
Performance Modelling of a Multi-Buffered Banyan Switch Under Bursty Traffic · INFOCOM 1992

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

queueing analysis · 0.0approximation algorithm · 0.0simulation · 0.0
YearPublicationVenuePosition
1994 Performance modelling of a multi-buffered banyan switch under bursty traffic
abstract
Presents an approximation algorithm for the analysis of a buffered banyan ATM switch which allows complex (input and output buffering) switching elements, bursty traffic, non-uniform destination distribution and permits the analysis of large scale switches.>
Todd D. Morris, Harry G. Perros
IEEE Trans. Commun.1
1993 Approximate Analysis of a Discrete-Time Tandem Network of Cut-Through Queues with Blocking and Bursty Traffic
Todd D. Morris, Harry G. Perros
Perform. Evaluation1
1992 Performance Modelling of a Multi-Buffered Banyan Switch Under Bursty Traffic
abstract
The authors present an analytical model of a buffered banyan asynchronous transfer mode (ATM) switch which allows complex switching elements, bursty traffic, and nonuniform destination distributions and permits the analysis of large-scale switches. The ATM switch is analyzed by decomposing it into individual switching elements. Each switching element is then analyzed numerically in isolation assuming that its arrival and service processes are known. The parameters of the arrival and service processes of the switching elements are obtained using an iterative scheme. The results obtained are approximate and validation tests have shown that they have good accuracy. Using this model, the cell loss, throughput, and the mean time to traverse the switch were obtained for different traffic parameters and buffer sizes within a switching element.>
Todd D. Morris, Harry G. Perros
INFOCOM1