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

Jamshid Mahdavi

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

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

Computer networks · 2

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% Wireless networking · 34%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › TCP performance enhancement
TCP buffer tuning
0.011998
Automatic TCP Buffer Tuning · SIGCOMM 1998
Wireless networking › wireless network optimization
throughput optimization
0.011998
Automatic TCP Buffer Tuning · SIGCOMM 1998
Transport protocols and congestion control
TCP congestion control
0.011996
Forward Acknowledgement: Refining TCP Congestion Control · SIGCOMM 1996
Operating systems › network stack
socket buffer management
0.011998
Automatic TCP Buffer Tuning · SIGCOMM 1998
Transport protocols and congestion control
selective acknowledgment
0.011996
Forward Acknowledgement: Refining TCP Congestion Control · SIGCOMM 1996

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

simulation · 0.0
YearPublicationVenuePosition
1998 Automatic TCP Buffer Tuning
abstract
With the growth of high performance networking, a single host may have simultaneous connections that vary in bandwidth by as many as six orders of magnitude. We identify requirements for an automatically-tuning TCP to achieve maximum throughput across all connections simultaneously within the resource limits of the sender. Our auto-tuning TCP implementation makes use of several existing technologies and adds dynamically adjusting socket buffers to achieve maximum transfer rates on each connection without manual configuration.Our implementation involved slight modifications to a BSD-based socket interface and TCP stack. With these modifications, we achieved drastic improvements in performance over large bandwidth delay paths compared to the default system configuration, and significant reductions in memory usage compared to hand-tuned connections, allowing servers to support at least twice as many simultaneous connections.
Jeffrey Semke, Jamshid Mahdavi, Matthew Mathis
SIGCOMM2
1996 Forward Acknowledgement: Refining TCP Congestion Control
abstract
We have developed a Forward Acknowledgment (FACK) congestion control algorithm which addresses many of the performance problems recently observed in the Internet. The FACK algorithm is based on first principles of congestion control and is designed to be used with the proposed TCP SACK option. By decoupling congestion control from other algorithms such as data recovery, it attains more precise control over the data flow in the network. We introduce two additional algorithms to improve the behavior in specific situations. Through simulations we compare FACK to both Reno and Reno with SACK. Finally, we consider the potential performance and impact of FACK in the Internet.
Matthew Mathis, Jamshid Mahdavi
SIGCOMM2