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

Karl Kümmerle

dblp:35/5231 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 1983
—ORCID · none

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

Computer networks · 8 · 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
5 papers
Internet architecture and protocols · 58% Routing and switching · 18% Network management and operations · 12%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Parallel and multicore computing · 69% Processor architecture and microarchitecture · 31%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
local area network
0.021983
Architecture and Design of a Reliable Token-Ring Network · IEEE J. Sel. Areas Commun. 1983
Establishment communication systems: LAN's or PABX's - which is better? · SIGCOMM 1983
Network management and operations › fault management
fault detection and isolation
0.011983
Architecture and Design of a Reliable Token-Ring Network · IEEE J. Sel. Areas Commun. 1983
Internet architecture and protocols › local area network › ring network
token ring
0.011983
Architecture and Design of a Reliable Token-Ring Network · IEEE J. Sel. Areas Commun. 1983
Routing and switching
packet switching
0.021979
Throughput Considerations in a Multi-Processor Packet-Switching Node · IEEE Trans. Commun. 1979
Distributed Processing Within an Integrated Circuit/Packet-Switching Node · IEEE Trans. Commun. 1976
Internet architecture and protocols › layered network architecture
data link layer
0.011980
Balanced HDLC Procedures: A Performance Analysis · IEEE Trans. Commun. 1980
Internet architecture and protocols › link-layer protocols
HDLC
0.011980
Balanced HDLC Procedures: A Performance Analysis · IEEE Trans. Commun. 1980
Network performance modeling
protocol performance analysis
0.011980
Balanced HDLC Procedures: A Performance Analysis · IEEE Trans. Commun. 1980
Routing and switching › switching
integrated circuit and packet switching
0.011976
Distributed Processing Within an Integrated Circuit/Packet-Switching Node · IEEE Trans. Commun. 1976
Routing and switching
switching
0.011976
Distributed Processing Within an Integrated Circuit/Packet-Switching Node · IEEE Trans. Commun. 1976
Parallel and multicore computing
multiprocessor system
0.011976
Distributed Processing Within an Integrated Circuit/Packet-Switching Node · IEEE Trans. Commun. 1976
Internet architecture and protocols › voice/data integration
integrated voice/data networks
0.011983
Establishment communication systems: LAN's or PABX's - which is better? · SIGCOMM 1983
Network performance modeling
throughput and delay analysis
0.011983
Architecture and Design of a Reliable Token-Ring Network · IEEE J. Sel. Areas Commun. 1983
Processor architecture and microarchitecture
multiprocessor architecture
0.011979
Throughput Considerations in a Multi-Processor Packet-Switching Node · IEEE Trans. Commun. 1979

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

queueing analysis · 0.0token-access protocol · 0.0monitor function · 0.0throughput analysis · 0.0simulation · 0.0analytic modeling · 0.0
YearPublicationVenuePosition
1983 Establishment communication systems: LAN's or PABX's - which is better?
abstract
In the sixties and early seventies, major activities in networking were focused on private and public data networks using either circuit and packet-switching technology or integrating both switching methods into a single network. In this time frame, manufacturers of main frames defined and implemented network architectures, ISO started work on the reference model of the Open-System Interconnect Architecture, and CCITT recommended the X-series of interfaces.Local-area communication networks (LAN's) represent a comparatively new field of activity which can be viewed as an extension to data networks for making high-speed packet-switching services available to the in-house domain. Currently, much research and development work is being pursued in this field, both at universities and in industry. The term local refers to communication on the users' premises, i.e., within a building or among a cluster of buildings.Local data and voice communication are not new. A typical example of a system widely used today for local data communication between hosts and display terminals is a star configuration where the terminals are attached to control units tightly coupled to a processor via I/O channels. The necessary terminal control functions are provided in the control unit and shared among a set of terminals. The most widely used local communication system is the Private Automatic Branch Exchange (PABX). Most PABX's installed today are optimised for real-time voice, and use analog technology.
Karl Kümmerle
SIGCOMM1
1983 Architecture and Design of a Reliable Token-Ring Network
abstract
Architecture, performance, transmission system, and wiring strategy of a token-ring local area network implemented at the IBM Zurich Research Laboratory are described. In the design of the system, particular emphasis was placed on high reliability, availability, and serviceability. To ensure robustness of the token-access protocol, we employ the concept of a monitor function which is responsible for fast recovery from access-related errors. Our protocol supports asynchronous transmission of data frames concurrently with full-duplex synchronous channels, e.g., for voice services or other applications requiring guaranteed delay. The delay-throughput performance of the token ring is shown to depend very little on data rate and distance. The transmission system of the ring is fully bit synchronous and allows insertion/removal of stations in/from the ring at any time. A mixed ring/star wiring strategy is used which provides the means for both fault detection and isolation, and system reconfiguration, and allows wiring of a building systematically.
Werner Bux, Felix Closs, Karl Kümmerle, Heinz J. Keller, Hans R. Müller
IEEE J. Sel. Areas Commun.3
1983 Foreword: Introduction and Issue Overview
Karl Kümmerle, Bart W. Stuck, Fouad A. Tobagi
IEEE J. Sel. Areas Commun.1
1982 Data Link-Control Performance: Results Comparing HDLC Operational Modes
Werner Bux, Karl Kümmerle, Hong Linh Truong 0003
Comput. Networks2
1980 Balanced HDLC Procedures: A Performance Analysis
abstract
The prime objective of the present paper is to analyze the performance of HDLC Balanced Class of Procedures, i.e., to quantitatively study the interaction among a multiplicity of parameters which are procedure specific, characterize the properties of the transmission medium, and identify the operational characteristics and requirements. The approach taken is to consider two kinds of operation: a saturated case characterized by maximum throughput as the most suitable measure of performance, and a nonsaturated situation for which waiting and transfer times are the appropriate measures. The analysis is performed by means of both simulation and analytic techniques. Within the simulation model, the information transfer phase of the HDLC procedure was implemented in full detail. The key idea of the analytic approach is to use a so-called virtual transmission time, a quantity comprising both the real constant transmission time of a message and the duration of recovery actions in case of transmission errors. It allows the performance measures to be represented by explicit and easily-computable expressions. The results provide a fundamental insight into how the most relevant parameters interact and determine performance.
Werner Bux, Karl Kümmerle, Hong Linh Truong 0003
IEEE Trans. Commun.2
1979 Throughput Considerations in a Multi-Processor Packet-Switching Node
abstract
The prime objective of the present paper is to analyze the throughput characteristics of a multi-processor configuration for packet switching-suggested in the context of an integrated network for circuit and packet switching-and to identify the major parameters on which it depends. The results provide a fundamental insight into how the most relevant system and traffic parameters determine throughput as a function of the number of packet-handling modules. In particular, it is shown that the proposed partitioning of the packet-handling function does indeed permit high throughput before saturation is encountered.
Werner Bux, Paul Julius Kühn, Karl Kümmerle
IEEE Trans. Commun.3
1978 Packet and Circuit Switching: Cost/Performance Boundaries
Karl Kümmerle, Harry Rudin
Comput. Networks1
1976 Distributed Processing Within an Integrated Circuit/Packet-Switching Node
abstract
Based on the premise that flexibility is a primary objective for future data networks, it is proposed to integrate circuit switching (CS) and packet switching (PS) in a single network. This paper addresses the switching node in such a network. A novel node concept is presented, imposing PS on a CS structure. Connection management and node control functions on the one hand and packet processing/storing on the other are performed by two groups of modules. The modularity requirement leads to very small, simple processors built into storage modules for packet handling. Considering the high throughput requirement of about 1200 packets/s/node, configurations may exceed 30 packet-handling modules. The wellknown saturation effect of multiprocessor systems, i.e., decreasing incremental throughput with increasing number of processor modules, is overcome by a new concept of intermodule communications, taking advantage of the particular data-communications environment. Intermodule communications-and therefore overhead-have been significantly reduced. As a result, systems throughput for fixed processor module utilization is nearly a linear function of the number of modules, the deviation from linearity being less than 10 percent over the range considered.
Christian J. Jenny, Karl Kümmerle
IEEE Trans. Commun.2