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
Demo Data from VLDB 2026 / reviewers in the wild / expert

Gerald W. Shapiro

dblp:32/6696 · DBLP profile ↗
← Back
1ranked-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 · 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 networks
1 paper
Internet architecture and protocols · 30% Transport protocols and congestion control · 30% Network performance modeling · 30%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network architecture design › layered architecture
protocol layering		 0.011993
Nested sliding window protocols with packet fragmentation · IEEE Trans. Commun. 1993
Network performance modeling
queueing analysis		 0.011993
Nested sliding window protocols with packet fragmentation · IEEE Trans. Commun. 1993
Transport protocols and congestion control › flow control
sliding window flow control		 0.011993
Nested sliding window protocols with packet fragmentation · IEEE Trans. Commun. 1993
Wireless networking
packet fragmentation		 0.011993
Nested sliding window protocols with packet fragmentation · IEEE Trans. Commun. 1993

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

erlang distribution · 0.0approximation algorithm · 0.0
YearPublicationVenuePosition
1993 Nested sliding window protocols with packet fragmentation
abstract
A single-hop OSI structured network with multiple layers of sliding window flow control and packet fragmentation between layers is analyzed. An approximation algorithm is presented to hierarchically reduce the network to a single queue whose performance characteristics represent the original network. Network transmission characteristics are restricted to Erlang distributions. Validation against exact and simulation results showed that the approximation algorithm has a satisfactory error level.>
Gerald W. Shapiro, Harry G. Perros
 IEEE Trans. Commun.1