On the throughput analysis of rate-based and window-based congestion control schemes

Akan, Özgür B.

doi:10.1016/j.comnet.2003.07.001

Cited by 13 publications

(7 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This observation also conforms to the correlation between latency and throughput in TCP [19]. In practice, the exact achievable transmission rate between peers varies quite significantly but the above general trend still holds by using the correlation between latency and available bandwidth [20].…”

Section: Sharestorm Frameworksupporting

confidence: 76%

See 1 more Smart Citation

ShareStorm: A High-Performance and ISP-Friendly P2P Content Distribution Protocol

Lei

Yang

Gong

et al. 2011

2011 International Conference on Parallel Processing

View full text Add to dashboard Cite

P2P content distribution has been an important Internet application in recent years. Its popularity draws attentions of Internet Service Providers (ISPs) for traffic management even throttling. This paper presents a new P2P content distribution protocol named ShareStorm that is efficient and ISP friendly. The key is our receiver-driven distance centric heuristics with probabilistic randomization. Compared with BitTorrent, ShareStorm accelerates the content distribution greatly and reduces the operating cost of the ISPs. In addition, it allows the ISPs to adjust the traffic distribution of specified areas dynamically. We conducted both emulation and Internet experiments to demonstrate ShareStorm's performance. Particularly, ShareStorm outperforms BitTorrent by more than 60% in our Internet experiments in terms of download time.

show abstract

Section: Sharestorm Frameworksupporting

confidence: 76%

“…Utilizing the existing correlation between TCP transmission throughput and the average RTT between peers [19], we simulate the TCP transmission throughput in the inverse proportion to the distance between peers.…”

Section: A Experiments Environment Setup and Designmentioning

confidence: 99%

ShareStorm: A High-Performance and ISP-Friendly P2P Content Distribution Protocol

Lei

Yang

Gong

et al. 2011

2011 International Conference on Parallel Processing

View full text Add to dashboard Cite

show abstract

“…A natural choice for CVIHIS, and traditionally a more commonly used approach with multimedia streaming, is the ratebased approach. (Akan, 2004) says that the windowbased approach is not suitable for continuous multimedia streaming since its ACK-controlled packet injection method does not maintain smooth rate variation.…”

Section: Basic Functionsmentioning

confidence: 99%

Delay-based Congestion Control Mechanism for Video Services - Mechanism including Backward Loading and Real-time Modes

Vihervaara

Loula

2014

Proceedings of the 10th International Conference on Web Information Systems and Technologies

View full text Add to dashboard Cite

Currently the congestion control of the Internet is implemented through overprovisioning and TCP protocol. Unfortunately, TCP is not completely suitable for the use of video services. However, recent studies have shown that these video services represent over half of Internet traffic, with a growing trend. There are also arguments against massive overprovisioning. Due to these factors, there is a need to equip video services with proper congestion control. Unfortunately, most of the congestion control mechanisms developed for the use of video services can only offer low priority services or TCP-friendly real-time services. This paper provides a study in which a new delay-based congestion control mechanism is presented. This mechanism can offer congestion control services for both of these service types.

show abstract

“…To the best of our knowledge, there is no modeling of stochastic delay and backlog bounds of rate-based congestion control schemes for CRSNs based on SNC in the current literature. Among the rate-based schemes, we focus on the popular one, i.e., generic additive increase multiplicative decrease (AIMD) [25]. In this paper, the stochastic backlog and delay bounds of rate-based generic AIMD congestion control scheme are modeled in CRSNs.…”

Section: Introductionmentioning

confidence: 99%

Stochastic backlog and delay bounds of generic rate-based AIMD congestion control scheme in cognitive radio sensor networks

Esmaeelzadeh

Berangi

Hosseini

et al. 2015

Pervasive and Mobile Computing

View full text Add to dashboard Cite

Performance guarantees for congestion control schemes in cognitive radio sensor networks (CRSNs) can be helpful in order to satisfy the quality of service (QoS) in different applications. Because of the high dynamicity of available bandwidth and network resources in CRSNs, it is more effective to use the stochastic guarantees. In this paper, the stochastic backlog and delay bounds of generic rate-based additive increase and multiplicative decrease (AIMD) congestion control scheme are modeled based on stochastic network calculus (SNC). Particularly, the probabilistic bounds are modeled through moment generating function (MGF)-based SNC with regard to the sending rate distribution of CR source sensors. The proposed stochastic bounds are verified through NS2-based simulations.

show abstract

On the throughput analysis of rate-based and window-based congestion control schemes

Cited by 13 publications

References 15 publications

ShareStorm: A High-Performance and ISP-Friendly P2P Content Distribution Protocol

ShareStorm: A High-Performance and ISP-Friendly P2P Content Distribution Protocol

Delay-based Congestion Control Mechanism for Video Services - Mechanism including Backward Loading and Real-time Modes

Stochastic backlog and delay bounds of generic rate-based AIMD congestion control scheme in cognitive radio sensor networks

Contact Info

Product

Resources

About