Review and performance evaluation of FIFO, PQ, CQ, FQ, and WFQ algorithms in multimedia wireless sensor networks

Attar, Hani; Khosravi, Mohammad R.; Igorovich, Shmatkov Sergiy; Georgievan, Kuchuk Nina; Alhihi, Mohammad

doi:10.1177/1550147720913233

Cited by 19 publications

(8 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…When a line is idle, the router scans all queues in turn and sends out the first packet of the queue each time. When a flow's data packets arrive too fast, its queue will quickly fill up, and new data packets belonging to this flow will be discarded [37].…”

Section: Fq Algorithmmentioning

confidence: 99%

Can Multipath TCP Be Robust to Cyber Attacks? A Measuring Study of MPTCP with Active Queue Management Algorithms

Cao

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

With the development of social networks, more and more mobile social network devices have multiple interfaces. Multipath TCP (MPTCP), as an emerging transmission protocol, can fit multiple link bandwidths to improve data transmission performance and improve user experience quality. At the same time, due to the large-scale deployment and application of emerging technologies such as the Internet of Things and cloud computing, cyber attacks against MPTCP have gradually increased. More and more network security research studies point out that low-rate distributed denial of service (LDDoS) attacks are relatively popular and difficult to detect and are recognized as one of the most severe threats to network services. This article introduces six classic queue management algorithms: DropTail, RED, FRED, REM, BLUE, and FQ. In a multihomed network environment, we perform the performance evaluation of MPTCP under LDDoS attacks in terms of throughput, delay, and packet loss rate when using the six algorithms, respectively, by simulations. The results show that in an MPTCP-enabled multihomed network, different queue management algorithms have different throughput, delay, and packet loss rate performance when subjected to LDDoS attacks. Considering these three performance indicators comprehensively, the FRED algorithm has better performance. By adopting an effective active queue management (AQM) algorithm, the MPTCP transmission system can enhance its robustness capability, thus improving transmission performance. We suggest that when designing and improving the queue management algorithm, the antiattack performance of the algorithm should be considered: (1) it can adjust the traffic speed by optimizing the congestion control mechanism; (2) the fairness of different types of data streams sharing bandwidth is taken into consideration; and (3) it has the ability to adjust the parameters of the queue management algorithm in a timely and accurate manner.

show abstract

Section: Fq Algorithmmentioning

confidence: 99%

Can Multipath TCP Be Robust to Cyber Attacks? A Measuring Study of MPTCP with Active Queue Management Algorithms

Cao

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…As a result, the paper claims an outstanding performance of PQ scheduling algorithm for the real-time applications like video and voice compared to the other scheduling algorithms. When comparing the type of applications that benefits most from the PQ, a research claims that videoconferencing has the highest, followed by telephony and IPTV (Attar, et al, 2020).…”

Section: Priority Queueing (Pq) Scheduling Algorithmmentioning

confidence: 99%

A Study of Scheduling Algorithms in LTE -Advanced HetNet

Mohammed

2021

QZJ

View full text Add to dashboard Cite

Long Term Evolution (LTE), known as 4G technology, is considered the choice for Third Generation Partnership Project (3GPP) and 3GPP2 mobile operators. LTE is expected to bring an improved user experience with full mobility support. However, to cope with the increasing number of mobile data subscribers that compete for the limited radio resources, effective network Quality of Service (QoS) mechanisms are necessary. A solution is to introduce small cells by adding low-power base stations to the existing macro-eNBs (Evolved Node B). The result is a Heterogeneous Network (HetNet) with large macro-cells combined with small cells (micro-, pico-and femto-cells) to cover areas not covered by the Macro-cells. Practically, HetNet is introduced in LTE-Advanced which is an extended version of LTE with more advanced features. Introducing HetNet in LTE-A brings challenges especially in terms of physical integration, QoS support and interference management. In this research, an architecture of HetNet integration is proposed. After that, some QoS scheduling algorithms are deployed for different types of on-going applications. Then, through the use of Riverbed Modeler, their performance parameters are studied with extensive simulations. Finally, an intensive comparison is done among the algorithms followed by a detailed discussion.

show abstract

“…In the past, several hardware architectures have been developed for data sorting or prioritizing information, but they are largely limited by their logical resources; especially when multiple such priority queues are required, they may have overly high chip area costs in ASIC and high LUTs consumption in FPGA technologies [2][3][4][5][6][7][8][9][10][11][12][13].…”

Section: Introductionmentioning

confidence: 99%

“…One popular usage is task scheduling in operating systems, especially implementation of EDF algorithm and priority-based scheduling [1][2][3][10][11][12][13][14][15][16][17][18][19]. Another popular usage of priority queues accelerated by hardware (i.e., implemented in ASIC/FPGA) is in the domain of networking, mainly packet scheduling and switching [5][6][7][8]. Priority queues are very popular in CPU designs too, they are needed for instruction scheduling within out-of-order execution logic [20] or in memory management units [21] too.…”

Section: Introductionmentioning

confidence: 99%

Efficiency of Priority Queue Architectures in FPGA

Kohútka

2022

JLPEA

View full text Add to dashboard Cite

This paper presents a novel SRAM-based architecture of a data structure that represents a set of multiple priority queues that can be implemented in FPGA or ASIC. The proposed architecture is based on shift registers, systolic arrays and SRAM memories. Such architecture, called MultiQueue, is optimized for minimum chip area costs, which leads to lower energy consumption too. The MultiQueue architecture has constant time complexity, constant critical path length and constant latency. Therefore, it is highly predictable and very suitable for real-time systems too. The proposed architecture was verified using a simplified version of UVM and applying millions of instructions with randomly generated input values. Achieved FPGA synthesis results are presented and discussed. These results show significant savings in FPGA Look-Up Tables consumption in comparison to existing solutions. More than 63% of Look-Up Tables can be saved using the MultiQueue architecture instead of the existing priority queues.

show abstract

Review and performance evaluation of FIFO, PQ, CQ, FQ, and WFQ algorithms in multimedia wireless sensor networks

Cited by 19 publications

References 23 publications

Can Multipath TCP Be Robust to Cyber Attacks? A Measuring Study of MPTCP with Active Queue Management Algorithms

Can Multipath TCP Be Robust to Cyber Attacks? A Measuring Study of MPTCP with Active Queue Management Algorithms

A Study of Scheduling Algorithms in LTE -Advanced HetNet

Efficiency of Priority Queue Architectures in FPGA

Contact Info

Product

Resources

About