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

Allyn Romanow

dblp:01/5000 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none

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

Computer networks · 3 · 2 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
2 papers
Transport protocols and congestion control · 66% Network performance modeling · 14% Routing and switching · 12%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › TCP
TCP over ATM
0.021995
Dynamics of TCP Traffic over ATM Networks · IEEE J. Sel. Areas Commun. 1995
Dynamics of TCP Traffic Over ATM Networks · SIGCOMM 1994
Transport protocols and congestion control › queue management
packet discarding
0.011995
Dynamics of TCP Traffic over ATM Networks · IEEE J. Sel. Areas Commun. 1995
Transport protocols and congestion control › TCP performance
TCP throughput
0.011995
Dynamics of TCP Traffic over ATM Networks · IEEE J. Sel. Areas Commun. 1995
Network performance modeling
throughput analysis
0.011995
Dynamics of TCP Traffic over ATM Networks · IEEE J. Sel. Areas Commun. 1995
Transport protocols and congestion control › TCP congestion control
congestion avoidance
0.011994
Dynamics of TCP Traffic Over ATM Networks · SIGCOMM 1994
Routing and switching › switch buffer management
early packet discard
0.011994
Dynamics of TCP Traffic Over ATM Networks · SIGCOMM 1994
Internet architecture and protocols
ATM networks
0.021995
Dynamics of TCP Traffic over ATM Networks · IEEE J. Sel. Areas Commun. 1995
Dynamics of TCP Traffic Over ATM Networks · SIGCOMM 1994

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

simulation · 0.0
YearPublicationVenuePosition
1995 Dynamics of TCP Traffic over ATM Networks
abstract
Investigates the performance of transport control protocol (TCP) connections over ATM networks without ATM-level congestion control and compares it to the performance of TCP over packet-based networks. For simulations of congested networks, the effective throughput of TCP over ATM can be quite low when cells are dropped at the congested ATM switch. The low throughput is due to wasted bandwidth as the congested link transmits cells from "corrupted" packets, i.e., packets in which at least one cell is dropped by the switch. The authors investigate two packet-discard strategies that alleviate the effects of fragmentation. Partial packet discard, in which remaining cells are discarded after one cell has been dropped from a packet, somewhat improves throughput. They introduce early packet discard, a strategy in which the switch drops whole packets prior to buffer overflow. This mechanism prevents fragmentation and restores throughput to maximal levels.>
Allyn Romanow, Sally Floyd
IEEE J. Sel. Areas Commun.1
1994 Dynamics of TCP Traffic Over ATM Networks
abstract
We investigate the performance of TCP connections over ATM networks without ATM-level congestion control, and compare it to the performance of TCP over packet-based networks. For simulations of congested networks, the effective throughput of TCP over ATM can be quite low when cells are dropped at the congested ATM switch. The low throughput is due to wasted bandwidth as the congested link transmits cells from “corrupted” packets, i.e., packets in which at least one cell is dropped by the switch. This fragmentation effect can be corrected and high throughput can be achieved if the switch drops whole packets prior to buffer overflow; we call this strategy Early Packet Discard. We also discuss general issues of congestion avoidance for best-effort traffic in ATM networks.
Allyn Romanow, Sally Floyd
SIGCOMM1
1992 Analysis of a Resequencer Model for Multicast over ATM Networks
Liming Wei, FongChing Liaw, Deborah Estrin, Allyn Romanow, Thomas L. Lyon
NOSSDAV4