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

Matthias Kaiserswerth

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

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

Computer networks · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

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
Transport protocols and congestion control · 52% Internet architecture and protocols · 48%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 77% Performance modeling and evaluation · 23%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
protocol implementation
0.011993
The Parallel Protocol Engine · IEEE/ACM Trans. Netw. 1993
Distributed systems › distributed system architecture
communication architecture
0.011993
The Parallel Protocol Engine · IEEE/ACM Trans. Netw. 1993
Transport protocols and congestion control
flow control
0.011990
A survey of light-weight transport protocols for high-speed networks · IEEE Trans. Commun. 1990
Transport protocols and congestion control
transport protocol design
0.011990
A survey of light-weight transport protocols for high-speed networks · IEEE Trans. Commun. 1990
Performance modeling and evaluation › performance evaluation methodology
end-to-end performance analysis
0.011993
The Parallel Protocol Engine · IEEE/ACM Trans. Netw. 1993
Internet architecture and protocols
high-speed networks
0.011990
A survey of light-weight transport protocols for high-speed networks · IEEE Trans. Commun. 1990

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

performance analysis · 0.0multiprocessor implementation · 0.0comparative survey · 0.0
YearPublicationVenuePosition
1993 The Parallel Protocol Engine
abstract
The design and implementation of a multiprocessor-based communication subsystem called the Parallel Protocol Engine (PPE), for the parallel and pipelined execution of protocols, are described. As an example, an implementation of the ISO 8802-2.2 logical link control on a four-processor version of the PPE is presented and analyzed. The performance of the implementation is more than 16,000 type-2 information protocol data units/s, commensurate with emerging high-speed networks that operate in the 100-Mb/s range. The overall end-to-end performance of an integrated system, where two workstations, each equipped with a PPE, communicate over a high-speed link, is analyzed and the problems concerning the soft- and hardware interface to the PPE are presented.>
Matthias Kaiserswerth
IEEE/ACM Trans. Netw.1
1990 A survey of light-weight transport protocols for high-speed networks
abstract
A comparative survey is presented of techniques used at the transport layer in eight representative protocols, most of which were designed to improve the protocol processing rate. The protocols are the relevant portions of the APPN, Datakit, Delta-t, NETBLT, OSI/TP4, TCP, VMTP, and XTP architectures. The protocols are described, and the functions under consideration are defined. No distinction is made as to whether these functions are carried out in a LAN, MAN, or WAN environment. The objective is to provide reliable, end-to-end transmission of data. The mechanisms required to support connection management, acknowledgements, flow control, and error handling are examined. Suitable techniques for designing light-weight transport protocols are identified. A discussion is presented as to which technique seems the most promising.>
Willibald A. Doeringer, Doug Dykeman, Matthias Kaiserswerth, Bernd Werner Meister, Harry R. Rudin Jr., Robin Williamson
IEEE Trans. Commun.3
1985 Practical Perfect Hashing
abstract
A practical method is presented that permits retrieval from a table in constant time. The method is suitable for large tables and consumes, in practice, O(n) space for n table elements. In addition, the table and the hashing function can be constructed in O(n) expected time. Variations of the method that offer different compromises between storage usage and update time are presented.
Gordon V. Cormack, R. Nigel Horspool, Matthias Kaiserswerth
Comput. J.3