2015
DOI: 10.1007/978-3-319-26925-2_12
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms for Theoretical Investigation of Fairness in Multipath Transport

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…If the developed models provide the ideal fair allocation for any scenario, then the models can be confirmed as the optimum fair solution. As an alternative solution which complements the linear programing approach, algorithms which provide an ideal solution for a network scenario for different fair allocation methods have been proposed in [1]. These algorithms resemble the way how one would solve the problem "manually" when looking at it.…”
Section: Scenario 21mentioning
confidence: 99%
See 2 more Smart Citations
“…If the developed models provide the ideal fair allocation for any scenario, then the models can be confirmed as the optimum fair solution. As an alternative solution which complements the linear programing approach, algorithms which provide an ideal solution for a network scenario for different fair allocation methods have been proposed in [1]. These algorithms resemble the way how one would solve the problem "manually" when looking at it.…”
Section: Scenario 21mentioning
confidence: 99%
“…The most commonly used transport protocol in today's Internet is the Transmission Control Protocol (TCP) [1]. It is not only used by "classical" applications which rely on reliable transmissions-such as web, e-mail or file transfer-but also by some soft-real-time applications where delay is less critical, such as video streaming.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation