2022
DOI: 10.1109/tnet.2021.3129590
|View full text |Cite
|
Sign up to set email alerts
|

On Packet Reordering in Time-Sensitive Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 31 publications
0
3
0
Order By: Relevance
“…However, this method overlooks the negative impact of reordering on worst-case delay and delay jitter. Mohammadpour et al [ 42 ] investigated the influence of packet reordering on worst-case delay and delay jitter. They demonstrated that, if the flow remains lossless between the source node and the reordering buffer, the buffer itself will not contribute to an increase in worst-case delay and delay jitter.…”
Section: Related Workmentioning
confidence: 99%
“…However, this method overlooks the negative impact of reordering on worst-case delay and delay jitter. Mohammadpour et al [ 42 ] investigated the influence of packet reordering on worst-case delay and delay jitter. They demonstrated that, if the flow remains lossless between the source node and the reordering buffer, the buffer itself will not contribute to an increase in worst-case delay and delay jitter.…”
Section: Related Workmentioning
confidence: 99%
“…Thus, packet reordering sensitive MM makes sure that packet order is retained even under handovers and network changes. However, it has been shown that packet reordering increases the delay and jitter [71]. Smart buffering and packet marking can be utilized to reorder packets that may go out of order during handover using FPMIPv6 to mark end of delivery for new and old paths [72].…”
Section: Packet Reordering (Pr) Sensitivementioning
confidence: 99%
“…This strategy considers the attributes of the entire flow, such as real-time performance of links, load balancing, and ordered packet transmission. Based on this information, a data allocation scheduling model is constructed, and strategies are implemented to improve congestion conditions of subflows, reduce performance differences between concurrent links, minimize packet reordering, and prevent receiver buffer congestion [61]. Strategies at the flow level include Direct Hashing (DH), Table-based Hashing (TH), Highest Random Weight (HRW), etc.…”
Section: Prediction Based On Flow-level Traffic Allocationmentioning
confidence: 99%