Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks
Today’s data centers host a variety of different applications that impose specific requirements for their flows. Applications that generate short flows are usually latency sensitive; they require their flows to be completed as fast as possible. Short flows suffer to quickly increase their...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-05-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/11/5/646 |
| _version_ | 1811306183194050560 |
|---|---|
| author | Hasnain Ahmed Muhammad Junaid Arshad |
| author_facet | Hasnain Ahmed Muhammad Junaid Arshad |
| author_sort | Hasnain Ahmed |
| collection | DOAJ |
| description | Today’s data centers host a variety of different applications that impose specific requirements for their flows. Applications that generate short flows are usually latency sensitive; they require their flows to be completed as fast as possible. Short flows suffer to quickly increase their sending rate due to the existing long flows occupying most of the available capacity. This problem is caused due to the slow convergence of the current data center transport protocols. In this paper, we present a buffer occupancy-based transport protocol (BOTCP) to reduce flow completion time of short flows. BOTCP consists of two parts: (i) A novel buffer occupancy-based congestion signal, and (ii) a congestion control scheme that uses the congestion signal to reduce flow completion time of short flows. The proposed buffer occupancy-based congestion signal gives a precise measure of congestion. The congestion control scheme makes a differentiated treatment of short and long flows to reduce flow completion time of short flows. The results show that BOTCP significantly improves flow completion time of short flows over the existing transport protocols in data center networks. |
| first_indexed | 2024-04-13T08:39:50Z |
| format | Article |
| id | doaj.art-473409852f324006ab9dc066a061cb0a |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-04-13T08:39:50Z |
| publishDate | 2019-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-473409852f324006ab9dc066a061cb0a2022-12-22T02:53:55ZengMDPI AGSymmetry2073-89942019-05-0111564610.3390/sym11050646sym11050646Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center NetworksHasnain Ahmed0Muhammad Junaid Arshad1Department of Computer Science & Engineering, University of Engineering and Technology, Lahore 54890, PakistanDepartment of Computer Science & Engineering, University of Engineering and Technology, Lahore 54890, PakistanToday’s data centers host a variety of different applications that impose specific requirements for their flows. Applications that generate short flows are usually latency sensitive; they require their flows to be completed as fast as possible. Short flows suffer to quickly increase their sending rate due to the existing long flows occupying most of the available capacity. This problem is caused due to the slow convergence of the current data center transport protocols. In this paper, we present a buffer occupancy-based transport protocol (BOTCP) to reduce flow completion time of short flows. BOTCP consists of two parts: (i) A novel buffer occupancy-based congestion signal, and (ii) a congestion control scheme that uses the congestion signal to reduce flow completion time of short flows. The proposed buffer occupancy-based congestion signal gives a precise measure of congestion. The congestion control scheme makes a differentiated treatment of short and long flows to reduce flow completion time of short flows. The results show that BOTCP significantly improves flow completion time of short flows over the existing transport protocols in data center networks.https://www.mdpi.com/2073-8994/11/5/646data center networkscloud computingflow completion timecongestion signalbuffer occupancyqueue lengthminimizing packet drops |
| spellingShingle | Hasnain Ahmed Muhammad Junaid Arshad Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks Symmetry data center networks cloud computing flow completion time congestion signal buffer occupancy queue length minimizing packet drops |
| title | Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks |
| title_full | Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks |
| title_fullStr | Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks |
| title_full_unstemmed | Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks |
| title_short | Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks |
| title_sort | buffer occupancy based transport to reduce flow completion time of short flows in data center networks |
| topic | data center networks cloud computing flow completion time congestion signal buffer occupancy queue length minimizing packet drops |
| url | https://www.mdpi.com/2073-8994/11/5/646 |
| work_keys_str_mv | AT hasnainahmed bufferoccupancybasedtransporttoreduceflowcompletiontimeofshortflowsindatacenternetworks AT muhammadjunaidarshad bufferoccupancybasedtransporttoreduceflowcompletiontimeofshortflowsindatacenternetworks |