BCR: Balanced congestion control after spurious RTO

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

TCP has been used as the standard for reliable transmission of application traffic in the internet. Recently, many kinds of wireless TCP schemes, such as TCP Westwood, have been developed with the emergence of wireless networks. Various algorithms have been suggested that are aimed at improving its performance in wireless networks. In this paper, we focus on the spurious timeouts that occur in such networks. E-RTO efficiently treats delay spikes that come from the retransmission of lost packets by the reliable wireless link layer. Also, it efficiently handles delay spikes with segment losses. However, it does not address the mobility of the user in the network. We tried to give a solution to this problem by proposing an BCR algorithm, and we evaluated the performance of BCR through simulation using NS-2. Through the experiment, we showed that the throughput and goodput of BCR are better than those of E-RTO. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Lee, J., Ahn, S., & Choo, H. (2008). BCR: Balanced congestion control after spurious RTO. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5072 LNCS, pp. 960–971). https://doi.org/10.1007/978-3-540-69839-5_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free