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.

Bruno Gréla-M'Poko

dblp:16/593 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1993
—ORCID · none

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

Computer networks · 4 · 2 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
2 papers
Internet architecture and protocols · 38% Network performance modeling · 38% Wireless networking · 25%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network topology
interconnected ring networks
0.011993
An approximate performance analysis of interconnected token-passing rings · IEEE Trans. Commun. 1993
Wireless networking › medium access control › conflict-free multiple access
token passing
0.011993
An approximate performance analysis of interconnected token-passing rings · IEEE Trans. Commun. 1993
Network performance modeling › queueing analysis
priority queueing
0.011991
Approximate analysis of asymmetric single-service prioritized token passing systems · IEEE Trans. Commun. 1991
Network performance modeling
token-passing network
0.011991
Approximate analysis of asymmetric single-service prioritized token passing systems · IEEE Trans. Commun. 1991
Internet architecture and protocols
metropolitan area network
0.011993
An approximate performance analysis of interconnected token-passing rings · IEEE Trans. Commun. 1993
Internet architecture and protocols
local area network
0.011991
Approximate analysis of asymmetric single-service prioritized token passing systems · IEEE Trans. Commun. 1991

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

simulation · 0.0queuing analysis · 0.0
YearPublicationVenuePosition
1993 An approximate performance analysis of interconnected token-passing rings
abstract
An analysis of the performance, in terms of average message delay, is presented for a system of interconnected ring networks. The system is hierarchical, with local rings served by a high-speed backbone ring through gateway queues. In both the local and the backbone rings, the access technique employed is token passing. Service disciplines, with and without priority, have been studied. In the former, priority is given to inter-ring traffic over local traffic. The study makes use of certain results on average delay in systems where the customer initiating a busy period receives special service for the M/G/1 queue with nonpreemptive priority and for the G/G/1 queue. The analysis, which involved several approximations, was verified by simulation.>
Bruno Gréla-M'Poko, Mustafa K. Mehmet Ali, Jeremiah F. Hayes
IEEE Trans. Commun.1
1991 Approximate analysis of asymmetric single-service prioritized token passing systems
abstract
A LAN or MAN (local or metropolitan area network) using token passing to allow stations to access the transmission medium is studied. Ibe and Cheng (1989) recently presented an approximate derivation of message delays for an asymmetric single-service token passing with only one type of message. In the present work, this analysis is extended to an operation with nonpreemptive priority queuing. The number of message priority levels and the walktime vary from one station to another. Moreover, the assumed Poisson message arrival process and the message transmission time vary, not only from one station to another, but also from one class to another. The performance, as measured by the mean delay for any message class at any station, is derived. The simulation results show excellent agreement with the analytical results, even under heavy loading. The results confirm earlier findings that the performance at a station is influenced by its position relative to heavily loaded stations.>
Bruno Gréla-M'Poko, Mustafa K. Mehmet Ali, Jeremiah F. Hayes
IEEE Trans. Commun.1
1990 Comparison of accessing techniques with priority
Mustafa K. Mehmet Ali, Bruno Gréla-M'Poko, Jeremiah F. Hayes
Comput. Commun.2
1986 Analysis of a Hybrid (Demand Assignment TDMA) Protocol for Video Teleconferencing-Voice Data Optical Networks
Ahmed K. Elhakeem, Bruno Gréla-M'Poko, Mustafa K. Mehmet Ali, Jeremiah F. Hayes
Comput. Networks2