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

Frans J. M. Panken

dblp:63/1353 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2023
—ORCID · none

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

Computer networks · 2 · 1 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 architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Computer networks
1 paper
Network performance modeling · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing models
blocking probability
0.011993
Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements · IEEE/ACM Trans. Netw. 1993
Performance modeling and evaluation › queueing models › finite buffer queue
loss system
0.011993
Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements · IEEE/ACM Trans. Netw. 1993
Performance modeling and evaluation
queueing models
0.011993
Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements · IEEE/ACM Trans. Netw. 1993
YearPublicationVenuePosition
2023 What is needed for campus networks to embrace 5G?
abstract
High insulation of building structures for energy efficiency cause that outdoor mobile network signals do not easily penetrate through walls and windows, resulting in inadequate indoor cellular services. Today this is solved by placing active components (baseband units and/or remote radio units) within the building and connect them with the nearest outdoor cell tower via fibers. This paper describes an alternative solution, especially suited for educational and research campuses, that scales better and is more cost-effective: using the infrastructure of the national research and education network (NREN) to connect the active equipment directly with the mobile cores of communications service providers. By converting the electric signal output from the radio unit to an optical signal, the signal can be transported over the existing campus network to each individual building. By adding the output of two small cells that use private spectrum, a small private mobile network that supports multiple-input and multiple-output is created. This paper describes the setup and our accompanied search to use it to support the ICT demands of the research and education community.
Frans J. M. Panken, Maurice van den Akker
CCNC1
2009 Multi-service traffic profiles to realise and maintain QoS guarantees in wireless LANs
Frans J. M. Panken, Geert Jan Hoekstra
Comput. Commun.1
1999 The Interdeparture Time Distribution for Each Class in the Sigma Mi[X]/Gi/1 Queue with Set-up Times and Repeated Server Vacations
Frans J. M. Panken
Perform. Evaluation1
1993 Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements
abstract
The authors analyze a generalization of the classical Erlang loss model. Customers of several types contend for access to a service facility consisting of a finite number of servers. Each customer requires a fixed number of servers simultaneously during an exponentially distributed service time, and is blocked on arrival if this requirement cannot be met. Customers of each type arrive in geometrically distributed batches, while the arrival of batches of each type is governed by a Poisson process. All relevant parameters may be type-dependent. The authors obtain the steady-state distribution of the number of customers of each type in the system (which turns out to have product form) and the blocking probabilities experienced by each customer type. In addition, the authors bring to light the connection between the model at hand and a method is proposed by L.E.N. Delbrouck (1983) for estimating blocking probabilities in an incompletely specified setting.>
Erik A. van Doorn, Frans J. M. Panken
IEEE/ACM Trans. Netw.2