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

Dragana Damjanovic

dblp:98/3512 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2011
—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
1 paper
Transport protocols and congestion control · 100%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › TCP
parallel TCP
0.112011
An Extension of the TCP Steady-State Throughput Equation for Parallel Flows and Its Application in MulTFRC · IEEE/ACM Trans. Netw. 2011
Transport protocols and congestion control › equation-based rate control
TCP-friendly rate control
0.112011
An Extension of the TCP Steady-State Throughput Equation for Parallel Flows and Its Application in MulTFRC · IEEE/ACM Trans. Netw. 2011

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

simulation · 0.1measurement · 0.1
YearPublicationVenuePosition
2011 An Extension of the TCP Steady-State Throughput Equation for Parallel Flows and Its Application in MulTFRC
abstract
In the first part of this paper, we present a simple extension of the well-known TCP steady-state throughput equation that can be used to calculate the throughput of several flows that share an end-to-end path. The value of this extension, which we show to work well with simulations as well as real-life measurements, is its practical applicability. Thus, in the second part of this paper, we present its application in MulTFRC, a TCP-friendly rate control (TFRC)-based congestion control mechanism that is fair to a number of parallel TCP flows while maintaining a smoother sending rate than multiple real TFRC flows do. MulTFRC enables its users to prioritize transfers by controlling the fairness among them in an almost arbitrary fashion.
Dragana Damjanovic, Michael Welzl
IEEE/ACM Trans. Netw.1
2009 Why Is This Web Page Coming Up so Slow? Investigating the Loss of SYN Packets
Dragana Damjanovic, Philipp Gschwandtner, Michael Welzl
Networking1