The Experts below are selected from a list of 6690 Experts worldwide ranked by ideXlab platform

Youze Cho - One of the best experts on this subject based on the ideXlab platform.

  • Congestion Window scaling method for inter protocol fairness of bbr
    Consumer Communications and Networking Conference, 2020
    Co-Authors: Yeongjun Song, Geonhwan Kim, Youze Cho
    Abstract:

    Unlike the existing loss-based and delay-based Congestion control algorithms, the Bottleneck Bandwidth Round-trip propagation time (BBR) Congestion control algorithm determines the amount of sending data to be transferred at a specific time by calculting BDP (Bandwidth Delay Product). However, when BBR competes with loss-based Congestion control algorithms, such as Reno and CUBIC, most of the bottleneck bandwidth is occupied by specific flows or excessive packet loss occurs. In previous work, we proposed an improved loss recovery mechanism in order to address above problems. Through the previous proposal, the fairness between BBR and loss-based algorithms was improved if the buffer size was larger than 2 BDP. However, if the buffer size was smaller than 2 BDP, the performance imbalance and continuous packet retransmission still occurred. In this paper, we propose a Congestion Window upper scaling method that complements the previously proposed loss recovery mechanism. In addition, we conduct an experiment and evalute its enhanced performance in a Mininet emulator.

  • CCNC - Congestion Window Scaling Method for Inter-protocol Fairness of BBR
    2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC), 2020
    Co-Authors: Yeongjun Song, Geonhwan Kim, Youze Cho
    Abstract:

    Unlike the existing loss-based and delay-based Congestion control algorithms, the Bottleneck Bandwidth Round-trip propagation time (BBR) Congestion control algorithm determines the amount of sending data to be transferred at a specific time by calculting BDP (Bandwidth Delay Product). However, when BBR competes with loss-based Congestion control algorithms, such as Reno and CUBIC, most of the bottleneck bandwidth is occupied by specific flows or excessive packet loss occurs. In previous work, we proposed an improved loss recovery mechanism in order to address above problems. Through the previous proposal, the fairness between BBR and loss-based algorithms was improved if the buffer size was larger than 2 BDP. However, if the buffer size was smaller than 2 BDP, the performance imbalance and continuous packet retransmission still occurred. In this paper, we propose a Congestion Window upper scaling method that complements the previously proposed loss recovery mechanism. In addition, we conduct an experiment and evalute its enhanced performance in a Mininet emulator.

  • ICTC - Dynamic Congestion Control Algorithm for Multipath Transport Protocols
    2018 International Conference on Information and Communication Technology Convergence (ICTC), 2018
    Co-Authors: Tabassum Lubna, Imtiaz Mahmud, Youze Cho
    Abstract:

    Multipath Transmission Control Protocol (MPTCP) aims at the proper utilization of the available bandwidth of multiple paths. Big widow size of Congestion control algorithm ensures more data delivery. Therefore, many recent researches have focused on the Congestion Window increase mechanism to quickly reach to an optimal value. In case of loss events, they halve the Congestion Window following traditional TCP. However, this causes the Congestion Window to wait longer to reach an optimal state wasting network resource. In this work, a dynamic Congestion Window decrease mechanism is presented that determines the decrease factor based on previous Congestion state and current Congestion state. We have evaluated our scheme in network simulator NS-3. The results show that the proposed scheme highly enhances the total throughput and path utilization.

Parimelazhagan Thangaraj - One of the best experts on this subject based on the ideXlab platform.

  • Machine learning based adaptive Congestion Window adjustment for Congestion Aware Routing in Cross Layer Approach Handling of Wireless Mesh Network
    Cluster Computing, 2018
    Co-Authors: N Yuvaraj, Parimelazhagan Thangaraj
    Abstract:

    Among different researches on Wireless Mesh Networks (WMN), the Cross-layer Handling Link Asymmetry (CHLA) scheme has been enhanced with QoS-based Congestion Avoidance using Congestion Aware Routing (QSCACAR) technique. In this approach, QoS requirements were achieved by estimation of signal strength, network capacity, MAC scheduling, link scheduling and slot assignment. In addition, Congestion was controlled based on the bandwidth management mechanism which is according to the Congestion Window on the dynamic traffic conditions. Based on these approaches, Congestion over the network was controlled. However, the Congestion Window size was not precisely adjusted and selected by using these approaches. Therefore in this article, CHLA-QSCACAR is enhanced by including adaptive Congestion Window size based on the machine learning algorithm (CHLA-MQSCACAR). In this approach, Congestion Window size is predicted for adjusting the Congestion in the next transmission. The Support Vector Machine (SVM) algorithm utilizes the Congestion balance status as label and Congestion control parameters as input attributes. Initially, Congestion balance status of different transmissions and their corresponding input Congestion control parameters are gathered. The collected database is trained with aid of SVM classifier. Then by using the trained SVM model, the Congestion status of current transmission with Congestion Window size is predicted. The predicted Congestion Window is utilized for achieving Congestion balance for the consecutive transmissions. Finally, the experimental results show that the performance effectiveness of the proposed CHLA-MQSCACAR compared to the existing CHLA-QSCACAR method in terms of different metrics such as routing overhead, bit error rate, end-to-end delay, throughput and latency.

Kasmiran Jumari - One of the best experts on this subject based on the ideXlab platform.

  • influence of parameters variation of tcp vegas in performance of Congestion Window over large bandwidth delay networks
    Asia-Pacific Conference on Communications, 2011
    Co-Authors: Ghassan A Abed, Mahamod Ismail, Kasmiran Jumari
    Abstract:

    Major challenge for TCP is to keep up the new and modern generation in communications networks such as networks with large bandwidth and long delay because when TCP applies on next generation networks will suffer from degradation in performance. The reason behind this shortcoming in performance is due to the Congestion control mechanisms supported by TCP variants where these mechanisms depending on linear or exponential growth to increasing the transmission Window. In TCP-Vegas, in spite of the performance degrades if applied in large bandwidth-large delay networks, but it can give acceptable performance when TCP receiver support delayed acknowledgment (ACK). Vegas Congestion control algorithm developed in different manner and not support the same techniques used in other TCP source variants, because it minimizes the delay in connection queue and also provides a far less in loss of packets where that increase the throughput of network. This article presents results from a series of simulation experiments designed to study TCP Vegas performance in large bandwidth and large delay network model using NS-2 network simulator. The analysis and observation of Vegas behavior performed using the main two parameters, alpha and beta, to configure the Congestion Window (cwnd) phases. After used multiple values, the behavior of cwnd of TCP Vegas is very sensitive to the variation of the parameters values and then we got a wide variety results corresponding to parameters variation.

  • A comparison and analysis of Congestion Window for HS-TCP, Full-TCP, and TCP-Linux in long term evolution system model
    2011 IEEE Conference on Open Systems, 2011
    Co-Authors: Ghassan A Abed, Mahamod Ismail, Kasmiran Jumari
    Abstract:

    TCP performance over high bandwidth network still represents the major challenge, since the large numbers of data flows through bottleneck, TCP forces a high packet loss rate and that causing delays that users are likely to notice. Congestion Window (cwnd) is maintained, which indicates the number of Transmission Control Protocol (TCP) segments that the existing connection is capable of holding safely. In high bandwidth networks, such as 4th Generation (4G) Long Term Evolution (LTE) systems, we expect a high rate of traffics, and then each TCP variants perform a different behavior of cwnd. In this study, three TCP's variants: TCP-Linux, FullTCP, and High Speed TCP (HSTCP), observed and the cwnd of each variant analyzed and compared with other two variants, over a model of high bandwidth network topology using network simulator (NS-2). All these TCP's tested under high rate of data transferred through a bottleneck. We found that each variant can provide a good cwnd size performance and stability but the differences was in cwnd phases such as slow start threshold (ssthresh), Congestion avoidance, slow-start, and maximum Congestion points.

  • APCC - Influence of parameters variation of TCP-Vegas in performance of Congestion Window over large bandwidth-delay networks
    The 17th Asia Pacific Conference on Communications, 2011
    Co-Authors: Ghassan A Abed, Mahamod Ismail, Kasmiran Jumari
    Abstract:

    Major challenge for TCP is to keep up the new and modern generation in communications networks such as networks with large bandwidth and long delay because when TCP applies on next generation networks will suffer from degradation in performance. The reason behind this shortcoming in performance is due to the Congestion control mechanisms supported by TCP variants where these mechanisms depending on linear or exponential growth to increasing the transmission Window. In TCP-Vegas, in spite of the performance degrades if applied in large bandwidth-large delay networks, but it can give acceptable performance when TCP receiver support delayed acknowledgment (ACK). Vegas Congestion control algorithm developed in different manner and not support the same techniques used in other TCP source variants, because it minimizes the delay in connection queue and also provides a far less in loss of packets where that increase the throughput of network. This article presents results from a series of simulation experiments designed to study TCP Vegas performance in large bandwidth and large delay network model using NS-2 network simulator. The analysis and observation of Vegas behavior performed using the main two parameters, alpha and beta, to configure the Congestion Window (cwnd) phases. After used multiple values, the behavior of cwnd of TCP Vegas is very sensitive to the variation of the parameters values and then we got a wide variety results corresponding to parameters variation.

Minghui Shi - One of the best experts on this subject based on the ideXlab platform.

  • goodput improvement for multipath tcp by Congestion Window adaptation in multi radio devices
    Consumer Communications and Networking Conference, 2013
    Co-Authors: Dizhi Zhou, Wei Song, Minghui Shi
    Abstract:

    Multipath Transport Control Protocol (MPTCP) has been standardized by Internet Engineering Task Force (IETF) to support simultaneous delivery of transport control protocol (TCP) packets over multiple interfaces of multi-radio mobile devices. Although MPTCP provides an efficient solution to aggregate the available bandwidth of multiple paths, the goodput of MPTCP is usually far lower than the aggregate throughput due to out-of-order received packets. One key reason for the out-of-order issue is the large variation of end-to-end delay for multiple paths over wireless channels. In this paper, we propose a Congestion Window adaption algorithm for the MPTCP source (referred to as CWA-MPTCP), which dynamically adjusts the Congestion Window for each TCP subflow so as to mitigate the variation of end-to-end path delay. We consider typical multipath transmission scenarios over wireless links, as well as a cooperative multi-hop wireless network with multiple relays. For wired paths with stable end-to-end delay, we further develop a proactive scheduling algorithm to determine the packet sending sequence to each path. This algorithm effectively reduces the out-of-order packets by predicting the receiving sequence. Experiments are conducted to evaluate the goodput performance of the two enhancements to MPTCP. Significant performance gain is achieved in terms of goodput, while the receive buffer requirement is minimized.

  • CCNC - Goodput improvement for multipath TCP by Congestion Window adaptation in multi-radio devices
    2013 IEEE 10th Consumer Communications and Networking Conference (CCNC), 2013
    Co-Authors: Dizhi Zhou, Wei Song, Minghui Shi
    Abstract:

    Multipath Transport Control Protocol (MPTCP) has been standardized by Internet Engineering Task Force (IETF) to support simultaneous delivery of transport control protocol (TCP) packets over multiple interfaces of multi-radio mobile devices. Although MPTCP provides an efficient solution to aggregate the available bandwidth of multiple paths, the goodput of MPTCP is usually far lower than the aggregate throughput due to out-of-order received packets. One key reason for the out-of-order issue is the large variation of end-to-end delay for multiple paths over wireless channels. In this paper, we propose a Congestion Window adaption algorithm for the MPTCP source (referred to as CWA-MPTCP), which dynamically adjusts the Congestion Window for each TCP subflow so as to mitigate the variation of end-to-end path delay. We consider typical multipath transmission scenarios over wireless links, as well as a cooperative multi-hop wireless network with multiple relays. For wired paths with stable end-to-end delay, we further develop a proactive scheduling algorithm to determine the packet sending sequence to each path. This algorithm effectively reduces the out-of-order packets by predicting the receiving sequence. Experiments are conducted to evaluate the goodput performance of the two enhancements to MPTCP. Significant performance gain is achieved in terms of goodput, while the receive buffer requirement is minimized.

Amitava Mukherjee - One of the best experts on this subject based on the ideXlab platform.

  • TCP throughput enhancement in wired-cum-wireless network
    Computer Communications, 2008
    Co-Authors: Anup K. Ghosh, Amitava Mukherjee, Debashis Saha
    Abstract:

    The key idea proposed in this paper is to determine the optimal Congestion Window for a TCP sender in a particular network scenario (that corresponds to the fair share of that connection) and keep this Congestion Window a constant to a point where the fair share in the network has changed considerably from the instance of the calculation of the size of the last Window. At this point, the TCP Congestion Window is recalculated according to the nature of new scenario. The proposed mechanism is particularly effective over wireless links, which have an inherently loss-prone nature, as modified TCP's Congestion Window being independent of packet losses (be it corruption losses or it Congestion losses), keeps transmitting at the same rate at before. We test this scheme under a simulation setup and show that it is performing better than TCP Reno under wireless loss condition and at least at par under wired condition.

  • PIMRC - Sender Side Intelligence for TCP Throughput Enhancement in Wired-Cum-Wireless Network
    2007 IEEE 18th International Symposium on Personal Indoor and Mobile Radio Communications, 2007
    Co-Authors: Anup K. Ghosh, S. Das, Rajesh Roy, Amitava Mukherjee
    Abstract:

    Performance of the TCP Congestion Control Algorithm has been the focus of research over the last decade. In this paper we propose modifications to TCP Congestion Control to improve its performance in wired-cum-wireless networks. The key idea to determine the Optimal Congestion Window for a TCP Sender, in a particular network scenario (that corresponds to the fair share of that connection) and keep this Congestion Window a constant to a point where the fair share in the network has changed considerably from the instance of the calculation of the size of the last Window. At this point, the TCP Congestion Window is recalculated according to the nature of new scenario. The proposed mechanism is particularly effective over wireless links, which have an inherently loss-prone nature, as Modified TCP's Congestion Window being independent of packet losses (be it corruption losses or it Congestion losses), keeps transmitting at the same rate as before.