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

Raif O. Onvural

dblp:67/432 · DBLP profile ↗
← Back
10ranked-venue papers
7as first author
0since 2021 · last 1997
0000-0003-0558-9996ORCID · reported

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

Systems, architecture and hardware · 5 · 4 first-authorComputer networks · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing analysis
blocking
0.011989
Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers · IEEE Trans. Software Eng. 1989
Performance modeling and evaluation
queueing models
0.011989
Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers · IEEE Trans. Software Eng. 1989
Performance modeling and evaluation › queueing models
queueing network analysis
0.011989
Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers · IEEE Trans. Software Eng. 1989

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

approximation · 0.0
YearPublicationVenuePosition
1997 Algorithm for efficient generation of link-state updates in ATM networks
Mohammad Peyravian, Raif O. Onvural
Comput. Networks ISDN Syst.2
1996 Structure and Use of Signaling in B-ISDNs
Raif O. Onvural, Haldon J. Sandick, Rao Cherukuri
Comput. Networks ISDN Syst.1
1996 Enabling ATM networks
Mohammad Peyravian, Raif O. Onvural
Comput. Commun.2
1996 Diffusion Based Statistical Call Admission Control in ATM
Erol Gelenbe, Xiaowen Mang, Raif O. Onvural
Perform. Evaluation3
1991 On performance characteristics of LAN interfaces with PING/PONG buffers
abstract
The authors consider a front end system consisting of a number of source stations generating LAN traffic; a queue to accommodate the transmission delays; and a number of ping/pong buffers, one for each LAN connection, served by the internal bus of the front-end processor. An incoming frame segment at a front end interface is assumed to be lost if there is no buffer available to store the segment. An algorithm is developed and used to investigate the performance characteristics of the ping/pong buffering scheme.>
Raif O. Onvural
LCN1
1990 Approximate Analysis of Multiclass Tandem Queueing Networks with Coxian Parameters and Finite Buffers
Raif O. Onvural, Harry G. Perros
Performance1
1989 A Note on the Product Form Solutions of Multiclass Closed Queueing Networks with Blocking
Raif O. Onvural
Perform. Evaluation1
1989 Some Equivalencies Between Closed Queueing Networks with Blocking
Raif O. Onvural, Harry G. Perros
Perform. Evaluation1
1989 Equivalencies Between Open and Closed Queueing Networks with Finite Buffers
Raif O. Onvural, Harry G. Perros
Perform. Evaluation1
1989 Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers
abstract
An approximation method for obtaining the throughput of cyclic queueing networks with blocking as a function of the number of customers in it is presented. The approximation method was developed for two different blocking mechanisms. It was also extended to the case of the central server model with blocking. Validation tests show that the algorithm is fairly accurate.>
Raif O. Onvural, Harry G. Perros
IEEE Trans. Software Eng.1