Modeling the Throughput of the Linux-Based Agile-SD Transmission Control Protocol
Agile-SD is one of the latest versions of loss-based congestion control algorithm (CCA), which has been proposed to improve the total performance of transmission control protocol (TCP) over highspeed and short-distance networks. It has introduced a new mechanism, called agility factor mechanism, whi...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2016-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/7803537/ |
| _version_ | 1819168480322125824 |
|---|---|
| author | Mohamed A. Alrshah Mohamed Othman Borhanuddin Mohd. Ali Zurina Binti Mohd Hanapi |
| author_facet | Mohamed A. Alrshah Mohamed Othman Borhanuddin Mohd. Ali Zurina Binti Mohd Hanapi |
| author_sort | Mohamed A. Alrshah |
| collection | DOAJ |
| description | Agile-SD is one of the latest versions of loss-based congestion control algorithm (CCA), which has been proposed to improve the total performance of transmission control protocol (TCP) over highspeed and short-distance networks. It has introduced a new mechanism, called agility factor mechanism, which shortens the epoch time to reduce the sensitivity to packet losses and in turn to increase the average throughput. Agile-SD has only been tested via simulation; however, it has not been mathematically proven or evaluated. The contribution of this paper is twofold. First, a new mathematical model for the throughput of NewReno and Agile-SD is proposed. This model is designed using the well-known Markov chains to validate the correctness of Agile-SD and to show the impact of buffer size, multiplicative decrease factor, and maximum limit of agility factor (λ<sub>max</sub>) on the total performance. Second, an automated algorithm configuration and parameter tuning (AACPT) technique is employed to optimize and automate the configuration of λmax. Furthermore, the numerical results for both NewReno and Agile-SD are compared with the simulation results, in which the validity of the proposed model is confirmed. Moreover, the output of the AACPT is exploited to formulate a new equation, which calculates the optimal λmax from a given β in order to conserve the standard interface of the TCP. This equation increases the scalability of Agile-SD and improves its total performance. |
| first_indexed | 2024-12-22T19:04:16Z |
| format | Article |
| id | doaj.art-5e6cd238413a4744813cb5fc6f667f10 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-22T19:04:16Z |
| publishDate | 2016-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-5e6cd238413a4744813cb5fc6f667f102022-12-21T18:15:51ZengIEEEIEEE Access2169-35362016-01-0149724973210.1109/ACCESS.2016.26472377803537Modeling the Throughput of the Linux-Based Agile-SD Transmission Control ProtocolMohamed A. Alrshah0https://orcid.org/0000-0003-2385-3287Mohamed Othman1Borhanuddin Mohd. Ali2Zurina Binti Mohd Hanapi3Department of Communication Technology and Network, Universiti Putra Malaysia, Serdang, MalaysiaDepartment of Communication Technology and Network, Universiti Putra Malaysia, Serdang, MalaysiaDepartment of Computer and Communication Systems Engineering, Universiti Putra Malaysia, Serdang, MalaysiaDepartment of Communication Technology and Network, Universiti Putra Malaysia, Serdang, MalaysiaAgile-SD is one of the latest versions of loss-based congestion control algorithm (CCA), which has been proposed to improve the total performance of transmission control protocol (TCP) over highspeed and short-distance networks. It has introduced a new mechanism, called agility factor mechanism, which shortens the epoch time to reduce the sensitivity to packet losses and in turn to increase the average throughput. Agile-SD has only been tested via simulation; however, it has not been mathematically proven or evaluated. The contribution of this paper is twofold. First, a new mathematical model for the throughput of NewReno and Agile-SD is proposed. This model is designed using the well-known Markov chains to validate the correctness of Agile-SD and to show the impact of buffer size, multiplicative decrease factor, and maximum limit of agility factor (λ<sub>max</sub>) on the total performance. Second, an automated algorithm configuration and parameter tuning (AACPT) technique is employed to optimize and automate the configuration of λmax. Furthermore, the numerical results for both NewReno and Agile-SD are compared with the simulation results, in which the validity of the proposed model is confirmed. Moreover, the output of the AACPT is exploited to formulate a new equation, which calculates the optimal λmax from a given β in order to conserve the standard interface of the TCP. This equation increases the scalability of Agile-SD and improves its total performance.https://ieeexplore.ieee.org/document/7803537/Agile-SDtransmission control protocolcongestion controlMarkov chainsaverage throughput |
| spellingShingle | Mohamed A. Alrshah Mohamed Othman Borhanuddin Mohd. Ali Zurina Binti Mohd Hanapi Modeling the Throughput of the Linux-Based Agile-SD Transmission Control Protocol IEEE Access Agile-SD transmission control protocol congestion control Markov chains average throughput |
| title | Modeling the Throughput of the Linux-Based Agile-SD Transmission Control Protocol |
| title_full | Modeling the Throughput of the Linux-Based Agile-SD Transmission Control Protocol |
| title_fullStr | Modeling the Throughput of the Linux-Based Agile-SD Transmission Control Protocol |
| title_full_unstemmed | Modeling the Throughput of the Linux-Based Agile-SD Transmission Control Protocol |
| title_short | Modeling the Throughput of the Linux-Based Agile-SD Transmission Control Protocol |
| title_sort | modeling the throughput of the linux based agile sd transmission control protocol |
| topic | Agile-SD transmission control protocol congestion control Markov chains average throughput |
| url | https://ieeexplore.ieee.org/document/7803537/ |
| work_keys_str_mv | AT mohamedaalrshah modelingthethroughputofthelinuxbasedagilesdtransmissioncontrolprotocol AT mohamedothman modelingthethroughputofthelinuxbasedagilesdtransmissioncontrolprotocol AT borhanuddinmohdali modelingthethroughputofthelinuxbasedagilesdtransmissioncontrolprotocol AT zurinabintimohdhanapi modelingthethroughputofthelinuxbasedagilesdtransmissioncontrolprotocol |