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

Hans Kröner

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

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

Computer networks · 4 · 3 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
3 papers
Internet architecture and protocols · 58% Network performance modeling · 32% Network measurement and analytics · 10%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
ATM networks
0.031992
Approximate Analysis of the End-to-End Delay in ATM Networks · INFOCOM 1992
Priority Management in ATM Switching Nodes · IEEE J. Sel. Areas Commun. 1991
Comparative Performance Study of Space Priority Mechanisms for ATM Networks · INFOCOM 1990
Network performance modeling
queueing analysis
0.021992
Approximate Analysis of the End-to-End Delay in ATM Networks · INFOCOM 1992
Comparative Performance Study of Space Priority Mechanisms for ATM Networks · INFOCOM 1990
Internet architecture and protocols
buffer management
0.021991
Priority Management in ATM Switching Nodes · IEEE J. Sel. Areas Commun. 1991
Comparative Performance Study of Space Priority Mechanisms for ATM Networks · INFOCOM 1990
Network performance modeling › packet loss
cell loss probability
0.031992
Priority Management in ATM Switching Nodes · IEEE J. Sel. Areas Commun. 1991
Approximate Analysis of the End-to-End Delay in ATM Networks · INFOCOM 1992
Comparative Performance Study of Space Priority Mechanisms for ATM Networks · INFOCOM 1990
Internet architecture and protocols › ATM networks
space priority mechanisms
0.021991
Comparative Performance Study of Space Priority Mechanisms for ATM Networks · INFOCOM 1990
Priority Management in ATM Switching Nodes · IEEE J. Sel. Areas Commun. 1991
Network measurement and analytics
traffic characterization
0.011992
Approximate Analysis of the End-to-End Delay in ATM Networks · INFOCOM 1992
Internet architecture and protocols
quality of service
0.021992
Approximate Analysis of the End-to-End Delay in ATM Networks · INFOCOM 1992
Comparative Performance Study of Space Priority Mechanisms for ATM Networks · INFOCOM 1990

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

simulation · 0.0performance evaluation · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1993 Bandwidth allocation mechanism for LAN/MAN interworking with an ATM network
Wolfgang Schödl, Uwe Briem, Hans Kröner, Thomas Theimer
Comput. Commun.3
1992 Approximate Analysis of the End-to-End Delay in ATM Networks
abstract
A very general approach for an approximate analysis of end-to-end delay jitter in asynchronous transfer mode (ATM) networks for bursty input traffic is presented. Since the cell loss requirements within ATM networks are very restrictive, interest is in the tail of the complementary probability distribution function of the end-to-end delay to estimate the cell loss probability at the reassembly buffer. An analytical approach for an isolated network node as well as for a whole reference connection is presented. The approximation results are in good agreement with simulation results and indicate that the end-to-end delay jitter is in the range of the maximum transfer delay of one queuing node, if the bursty input traffic is controlled by adequate traffic control mechanisms.>
Hans Kröner, Markus Eberspächer, Thomas Theimer, Paul Julius Kühn, Uwe Briem
INFOCOM1
1991 Priority Management in ATM Switching Nodes
abstract
Various space priority mechanisms and their detailed performance evaluation are described. A comparative performance study is given, indicating the excellent performance characteristics of a simple buffer management scheme called partial buffer sharing. The introduction of a second bearer capability provides a 10/sup -6/ cell loss rate instead of 10/sup -10/.>
Hans Kröner, Gérard Hébuterne, Pierre E. Boyer, Annie Gravey
IEEE J. Sel. Areas Commun.1
1990 Comparative Performance Study of Space Priority Mechanisms for ATM Networks
abstract
Priorities for buffer access, also called space priorities, are discussed in connection with the asynchronous transfer mode (ATM), which is widely accepted as the basis for the future broadband ISDN. The introduction of priorities enables the ATM layer to adapt the quality of the cell transfer to the quality of service requirements of the specific broadband ISDN services in order to improve the utilization of the network resources. A description is given of different space priority mechanisms and their performance evaluation. A comparative performance study of these concepts is given, indicating the good performance characteristics of a simple buffering scheme called partial buffer sharing.>
Hans Kröner
INFOCOM1