QTCP: Improving Throughput Performance Evaluation with High-Speed Networks

Qureshi, B.; Othman, Mohamed; Subramaniam, Shamala; Wati, Nor Asila

doi:10.1007/s13369-012-0483-z

Cited by 11 publications

(7 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Fu et al (2007), Mohamed A. Alrshah and Mohamed Othman (2009), Qureshi et al (2012) and Mohamed A. Alrshah and Mohamed Othman (2013) confirmed that, the single-based TCP with an appropriate modification can overcome and well replace the parallel-based TCP and it may be able to fully utilize the high-speed bandwidths.…”

Section: Latest Issuesmentioning

confidence: 96%

Comparative study of high-speed Linux TCP variants over high-BDP networks

Alrshah¹,

Othman²,

Ali³

et al. 2014

Journal of Network and Computer Applications

Self Cite

View full text Add to dashboard Cite

Transmission Control Protocol (TCP) has been profusely used by most of internet applications. Since 1970s, several TCP variants have been developed in order to cope with the fast increasing of network capacities especially in high Bandwidth Delay Product (high-BDP) networks. In these TCP variants, several approaches have been used, some of these approaches have the ability to estimate available bandwidths and some react based on network loss and/or delay changes. This variety of the used approaches arises many consequent problems with different levels of dependability and accuracy. Indeed, a particular TCP variant which is proper for wireless networks, may not fit for high-BDP wired networks and vice versa. Therefore, it is necessary to conduct a comparison between the high-speed TCP variants that have a high level of importance especially after the fast growth of networks bandwidths. In this paper, high-speed TCP variants, that are implemented in Linux and available for research, have been evaluated using NS2 network simulator. This performance evaluation presents the advantages and disadvantages of these TCP variants in terms of throughput, loss-ratio and fairness over high-BDP networks. The results reveal that, CUBIC and YeAH overcome the other highspeed TCP variants in different cases of buffer size. However, they still require more improvement to extend their ability to fully utilize the high-speed bandwidths, especially when the applied buffer is near − zero or less than the BDP of the link.

show abstract

Section: Latest Issuesmentioning

confidence: 96%

Comparative study of high-speed Linux TCP variants over high-BDP networks

Alrshah¹,

Othman²,

Ali³

et al. 2014

Journal of Network and Computer Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…(1) procedure SENDER WINDOW (parameters) (2) INITIALIZE (variables) (3) cwnd � Measure the current cwnd size (4) rwnd � received ack with advertised window size (5) targetlimit high � 10000, targetlimit low � 3000 (6) if rwnd ≤ 100 and rwnd < cwnd then (7) rwnd � (rwnd/100) (8) cwnd � cwnd − (cwnd × rwnd) (9) if cwnd < targetlimit low then (10) cwnd � targetlimit low (11) end if (12) else if rwnd ≤ 120 and rwnd < cwnd then (13) if cwnd > targetlimit high then (14) rwnd � (rwnd − 100)/200 (15) else (16) rwnd � (rwnd − 100)/100 (17) end if (18) cwnd � cwnd + (cwnd × rwnd) (19) else (20) cwnd � min(rwnd, cwnd) (21) end if (22) end procedure ALGORITHM 2: Adaptive congestion control.…”

Section: Adaptive Packet Generation Processmentioning

confidence: 99%

“…us, there is overflow of RLC queues due to the large volume of traffic in a short period of time leading to high delay resulting in poor performance. To guarantee high throughput and low delay during congestion, the researchers have proposed various methods such as buffer-aware scheduling [5][6][7][8], active queue management (AQM) techniques [9][10][11][12], receiver window control [13][14][15], loss-based congestion control [16][17][18], delay-based congestion control [16,19,20], rate-based congestion control [4,20,21], admission and congestion control [22][23][24][25], and resource starvation [26][27][28].…”

Section: Introductionmentioning

confidence: 99%

Adaptive Receiver-Window Adjustment for Delay Reduction in LTE Networks

Adesh

Renuka

2019

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

The cellular network keeps the vast capacity of queue space at eNodeBs (base stations) to reduce the queue overflow during the burst in data traffic. However, this adversely affects the delay sensitive applications and user quality of experience. Recently, few researchers have focused on reducing the packet delay, but it has a negative impact on the utilization of network resource by the users. Further, it fails to maintain fairness among the users, when competing for a shared resource in coexistence with conventional TCP or UDP users. Therefore, in this paper, the adaptive receiver-window adjustment (ARWA) algorithm is proposed to efficiently utilize the network resources and ensure fairness among the users in resource competitive environment, which requires slight modification of TCP at both the sender and receiver. The proposed mechanism dynamically varies the receiver window size based on the data rate and delay information of the packets, to enhance the performance of the system. Based on extensive experiments, the results illustrate that the ARWA algorithm reduces the delay of TCP packet and increases fairness among the users. In addition to that, it enhances the packet delivery fraction (PDF) and maintains the throughput of the system. Moreover, it competes with other conventional TCP users for the shared network resources in a fair manner.

show abstract

“…Many research works on congestion control mechanism have considered other variants of TCP. For example, [9] devised an adaptive congestion control strategy for high-speed TCP (HSTCP).…”

Section: Tcp Congestion Control Mechanismmentioning

confidence: 99%

Rated Window and Packet Size Differentiation Methods for Per-Rate TCP Fairness Over IEEE 802.11

2015

Self Cite

View full text Add to dashboard Cite

In WLANs, with the existence of multi-rate capability, the Distributed Coordination Function (DCF) of MAC layer protocol equalizes the throughput of all the stations regardless of their own link rate. This equalization leads to the Performance Anomaly of IEEE 802.11 where the throughput of the station with the higher data transmission rate is decreased as much as that of the lower rate station. The objective of this study was to provide fair proportional throughput for TCP flows of competing stations in multi-rate IEEE 802.11 WLANs infrastructure. This research considers the scenarios when there are other kinds of unfairness along with per-rate unfairness. In this work, Rated Window and Packet Size Differentiation schemes are proposed by adjusting window and packet size according to the availability of buffer size in the access point and transmission rates of each flow. We validate the proposed methods by means of simulation and compare the results of the total throughput and fairness index with previous methods. The results show that the proposed methods generate fair service in terms of proportional throughput among wireless stations having different numbers and directions of flow with various data transmission rates. By getting appropriate fairness among stations in WLAN infrastructure, a Wireless Internet Service Provider (WISP) can significantly increase its revenue by providing various appropriate service plans.

show abstract

QTCP: Improving Throughput Performance Evaluation with High-Speed Networks

Cited by 11 publications

References 22 publications

Comparative study of high-speed Linux TCP variants over high-BDP networks

Comparative study of high-speed Linux TCP variants over high-BDP networks

Adaptive Receiver-Window Adjustment for Delay Reduction in LTE Networks

Rated Window and Packet Size Differentiation Methods for Per-Rate TCP Fairness Over IEEE 802.11

Contact Info

Product

Resources

About