Academia.eduAcademia.edu

Figure 3 – uploaded by Karl-Johan Grinnemo

See full PDFdownloadDownload figure
Fig. 3. Placement of end-to-end CCAs for different protocols and in-network solutions that are provided to complement current end-to-end CCA:

Figure 3 Placement of end-to-end CCAs for different protocols and in-network solutions that are provided to complement current end-to-end CCA:

Related Figures (13)

Fig. 1. 5G use cases and spectrum of applications in relation to use case requirements
Fig. 1. 5G use cases and spectrum of applications in relation to use case requirements
Fig. 2. Cellular access networks and common access link and data delivery characteristics.
Fig. 2. Cellular access networks and common access link and data delivery characteristics.
Previous surveys on congestion control solutions. Table 1 throughput with better latency performance compared to loss-based algorithms mainly targeting throughput. This survey distinguishes itself from other surveys conducted on CCAs for wireless or cellular networks by focusing on the recent body of work that is targeted at maintaining low packet delay while achieving high throughput in a bottleneck with highly variable data rate. 3.4. MIMO
Previous surveys on congestion control solutions. Table 1 throughput with better latency performance compared to loss-based algorithms mainly targeting throughput. This survey distinguishes itself from other surveys conducted on CCAs for wireless or cellular networks by focusing on the recent body of work that is targeted at maintaining low packet delay while achieving high throughput in a bottleneck with highly variable data rate. 3.4. MIMO
Fig. 4. CCAs designed for different networks and the target network of the CCAs reviewed in this paper [57-69].
Fig. 4. CCAs designed for different networks and the target network of the CCAs reviewed in this paper [57-69].
Fig. 5. Potential classification schemes for cellular CCAS.
Fig. 5. Potential classification schemes for cellular CCAS.
Fig. 6. Classification of end-to-end cellular CCAs.
Fig. 6. Classification of end-to-end cellular CCAs.
Fig. 7. Generalized process of reactive algorithms.
Fig. 7. Generalized process of reactive algorithms.
Reactive CCAs for cellular networks. for obtaining the variables and parameters used in the algorithm. The algorithm switches between CWND control that is similar to loss-based CCAs and CWND control derived from Fast TCP [115] by comparing the rate achieved with an estimated maximum cellular link throughput. The maximum throughput estimate is computed by taking a moving average of the amount of data delivered over a period of time that is equivalent to a single cellular radio frame (10 ms). In ExLL, the normal Fast TCP control parameters are modified on the basis of how throughput and bandwidth vary in cellular networks. The evaluations of the algorithm were made in real LTE networks and an in-lab LTE testbed. Evaluations over LTE networks for static and mobile environ- ments show EXLL achieving better throughput and latency than popular CCAs like CUBIC and BBR (Bottleneck Bandwidth and minimum RTT). The fairness achieved between competing ExLL flows is also evaluated in [111]. Table 2
Reactive CCAs for cellular networks. for obtaining the variables and parameters used in the algorithm. The algorithm switches between CWND control that is similar to loss-based CCAs and CWND control derived from Fast TCP [115] by comparing the rate achieved with an estimated maximum cellular link throughput. The maximum throughput estimate is computed by taking a moving average of the amount of data delivered over a period of time that is equivalent to a single cellular radio frame (10 ms). In ExLL, the normal Fast TCP control parameters are modified on the basis of how throughput and bandwidth vary in cellular networks. The evaluations of the algorithm were made in real LTE networks and an in-lab LTE testbed. Evaluations over LTE networks for static and mobile environ- ments show EXLL achieving better throughput and latency than popular CCAs like CUBIC and BBR (Bottleneck Bandwidth and minimum RTT). The fairness achieved between competing ExLL flows is also evaluated in [111]. Table 2
Fig. 8. Generalized process of predictive algorithms.
Fig. 8. Generalized process of predictive algorithms.
Table 3
Table 3
Network-assisted CCAs for cellular networks.
Network-assisted CCAs for cellular networks.
Table 5
Table 5
Related topics:
Wireless Networks (Computer Science)Wireless Communications and Networking
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved