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

Yael Lapid

dblp:71/2683 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none

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

Computer networks · 2 · 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 · 54% Network performance modeling · 32% Internet architecture and protocols · 14%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › queue management
packet discarding
0.021998
Analysis of discarding policies in high-speed networks · IEEE J. Sel. Areas Commun. 1998
Analysis of Packet Discarding Policies in High-Speed Networks · INFOCOM 1997
Network performance modeling › throughput analysis
goodput analysis
0.011998
Analysis of discarding policies in high-speed networks · IEEE J. Sel. Areas Commun. 1998
Internet architecture and protocols
high-speed networks
0.021998
Analysis of discarding policies in high-speed networks · IEEE J. Sel. Areas Commun. 1998
Analysis of Packet Discarding Policies in High-Speed Networks · INFOCOM 1997
Transport protocols and congestion control › TCP congestion control
congestion avoidance
0.011997
Analysis of Packet Discarding Policies in High-Speed Networks · INFOCOM 1997
Network performance modeling › queueing analysis
queueing models of computer systems
0.011997
Analysis of Packet Discarding Policies in High-Speed Networks · INFOCOM 1997

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

simulation · 0.0queueing analysis · 0.0analytic modeling · 0.0
YearPublicationVenuePosition
1998 Analysis of discarding policies in high-speed networks
abstract
Networked applications generate messages that are segmented into smaller, fixed or variable size packets, before they are sent through the network. In high-speed networks, acknowledging individual packets is impractical; so when congestion builds up and packets have to be dropped, entire messages are lost. For a message to be useful, all packets comprising it must arrive successfully at the destination. The problem is therefore which packets to discard so that as many complete messages are delivered, and so that congestion is alleviated or avoided altogether. Selective discarding policies, as a means for congestion avoidance, are studied and compared to nondiscarding policies. The partial message discard policy discards packets of tails of corrupted messages. An improvement to this policy is the early message discard that drops entire messages and not just message tails. A common performance measure of network elements is the effective throughput which measures the utilization of the network links but which ignores the application altogether. We adopt a new performance measure-goodput-which reflects the utilization of the network from the application's point of view and thus better describes network behavior. We develop and analyze a model for systems which employ discarding policies. The analysis shows a remarkable performance improvement when any message-based discarding policy is applied, and that the early message discard policy performs better than the others, especially under high load. We compute the optimal parameter setting for maximum goodput at different input loads, and investigate the performance sensitivity to these parameters.
Yael Lapid, Raphael Rom, Moshe Sidi
IEEE J. Sel. Areas Commun.1
1997 Analysis of Packet Discarding Policies in High-Speed Networks
abstract
Selective discarding policies, as a means for congestion avoidance, are studied and compared to non-discarding policies. The partial message discard policy discards the packets of the tails of corrupted messages. An improvement to this policy is the early message discard that drops entire messages and not just message-tails. A common performance measure of the network elements is the effective throughput which measures the utilization of the network links but which neglects the application altogether. We adopt a new performance measure, goodput, which reflects the utilization of the network from the application's point of view and thus better describes the network behavior. We develop and analyze a model for systems which employ discarding policies. The analysis shows a remarkable performance improvement when any message-based discarding policy is applied, and that the early message discard policy performs better, especially under high loads. We compute the optimal parameter setting for maximum goodput at different input loads and investigate the performance sensitivity to these parameters.
Yael Lapid, Raphael Rom, Moshe Sidi
INFOCOM1