2023
DOI: 10.1016/j.comnet.2023.109632
|View full text |Cite
|
Sign up to set email alerts
|

Packet rank-aware active queue management for programmable flow scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…Another line of work focuses on reducing latency by avoiding large queuing delays, especially those caused by the phenomenon known as bufferbloat [32], where large unmanaged packet buffers fill up, causing large and unnecessary delays for all traffic. Several works [33][34][35] attempt to rectify this problem by utilizing various Active Queue Management (AQM) algorithms on nodes inside the network to prevent large queues from building up. Other research instead attempts to minimize the queuing latency by developing better congestion control algorithms [36,37] at the end hosts, preventing packets that cause queue buildups from being sent in the first place.…”
Section: Introductionmentioning
confidence: 99%
“…Another line of work focuses on reducing latency by avoiding large queuing delays, especially those caused by the phenomenon known as bufferbloat [32], where large unmanaged packet buffers fill up, causing large and unnecessary delays for all traffic. Several works [33][34][35] attempt to rectify this problem by utilizing various Active Queue Management (AQM) algorithms on nodes inside the network to prevent large queues from building up. Other research instead attempts to minimize the queuing latency by developing better congestion control algorithms [36,37] at the end hosts, preventing packets that cause queue buildups from being sent in the first place.…”
Section: Introductionmentioning
confidence: 99%