Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions

Autores
Piñero, Juan Cruz; Blanc, Alberto; Alvarez Hamelin, José Ignacio; Papadopoulos, Georgios Z.
Año de publicación
2025
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Industrial Internet of Things applications need strict Quality of Service guarantees, including when they use wireless networks. While existing standardization efforts, such as Deterministic Networks (IETF) and Time-Sensitive Networking (TSN), have focused mainly on wired networks, more recent activities address wireless networks, like the Reliable and Available Wireless (RAW) Working Group of the IETF. Duplicating packets over multiple paths can improve availability and reliability, but this can potentially result in more out-of-order packets. Existing reordering algorithms, including two recently standardized by the IETF, are not always well suited to wireless networks. As a result, guaranteeing a bounded end-to-end latency and/or maximum consecutive packet losses is still particularly challenging. We propose a novel packet reordering algorithm for deterministic networking that includes wireless segments to achieve lower end-to-end latency while providing high end-to-end reliability. We simulate a 6TiSCH wireless network to compare its performance with the existing ones. Furthermore, we also extend existing Network Calculus bounds on the reordering timer to obtain path-dependent values that can reduce the average latency. We also introduce a probabilistic model to compute the reordering ratio when there are no retransmissions that fits the simulation results.
Fil: Piñero, Juan Cruz. Centre National de la Recherche Scientifique; Francia
Fil: Blanc, Alberto. Centre National de la Recherche Scientifique; Francia
Fil: Alvarez Hamelin, José Ignacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Tecnologías y Ciencias de la Ingeniería "Hilario Fernández Long". Universidad de Buenos Aires. Facultad de Ingeniería. Instituto de Tecnologías y Ciencias de la Ingeniería "Hilario Fernández Long"; Argentina
Fil: Papadopoulos, Georgios Z.. Universidad de Buenos Aires; Argentina
Materia
Wireless networks
Internet of Things
Deterministic networks
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/282128

id CONICETDig_7b4df582f341eb85c771267804c2f92d
oai_identifier_str oai:ri.conicet.gov.ar:11336/282128
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering FunctionsPiñero, Juan CruzBlanc, AlbertoAlvarez Hamelin, José IgnacioPapadopoulos, Georgios Z.Wireless networksInternet of ThingsDeterministic networkshttps://purl.org/becyt/ford/2.2https://purl.org/becyt/ford/2Industrial Internet of Things applications need strict Quality of Service guarantees, including when they use wireless networks. While existing standardization efforts, such as Deterministic Networks (IETF) and Time-Sensitive Networking (TSN), have focused mainly on wired networks, more recent activities address wireless networks, like the Reliable and Available Wireless (RAW) Working Group of the IETF. Duplicating packets over multiple paths can improve availability and reliability, but this can potentially result in more out-of-order packets. Existing reordering algorithms, including two recently standardized by the IETF, are not always well suited to wireless networks. As a result, guaranteeing a bounded end-to-end latency and/or maximum consecutive packet losses is still particularly challenging. We propose a novel packet reordering algorithm for deterministic networking that includes wireless segments to achieve lower end-to-end latency while providing high end-to-end reliability. We simulate a 6TiSCH wireless network to compare its performance with the existing ones. Furthermore, we also extend existing Network Calculus bounds on the reordering timer to obtain path-dependent values that can reduce the average latency. We also introduce a probabilistic model to compute the reordering ratio when there are no retransmissions that fits the simulation results.Fil: Piñero, Juan Cruz. Centre National de la Recherche Scientifique; FranciaFil: Blanc, Alberto. Centre National de la Recherche Scientifique; FranciaFil: Alvarez Hamelin, José Ignacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Tecnologías y Ciencias de la Ingeniería "Hilario Fernández Long". Universidad de Buenos Aires. Facultad de Ingeniería. Instituto de Tecnologías y Ciencias de la Ingeniería "Hilario Fernández Long"; ArgentinaFil: Papadopoulos, Georgios Z.. Universidad de Buenos Aires; ArgentinaElsevier Science2025-07info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/282128Piñero, Juan Cruz; Blanc, Alberto; Alvarez Hamelin, José Ignacio; Papadopoulos, Georgios Z.; Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions; Elsevier Science; Computer Communications; 239; 7-2025; 1-120140-3664CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://linkinghub.elsevier.com/retrieve/pii/S0140366425001288info:eu-repo/semantics/altIdentifier/doi/10.1016/j.comcom.2025.108171info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2026-03-11T12:56:56Zoai:ri.conicet.gov.ar:11336/282128instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982026-03-11 12:56:56.462CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions
title Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions
spellingShingle Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions
Piñero, Juan Cruz
Wireless networks
Internet of Things
Deterministic networks
title_short Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions
title_full Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions
title_fullStr Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions
title_full_unstemmed Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions
title_sort Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions
dc.creator.none.fl_str_mv Piñero, Juan Cruz
Blanc, Alberto
Alvarez Hamelin, José Ignacio
Papadopoulos, Georgios Z.
author Piñero, Juan Cruz
author_facet Piñero, Juan Cruz
Blanc, Alberto
Alvarez Hamelin, José Ignacio
Papadopoulos, Georgios Z.
author_role author
author2 Blanc, Alberto
Alvarez Hamelin, José Ignacio
Papadopoulos, Georgios Z.
author2_role author
author
author
dc.subject.none.fl_str_mv Wireless networks
Internet of Things
Deterministic networks
topic Wireless networks
Internet of Things
Deterministic networks
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.2
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv Industrial Internet of Things applications need strict Quality of Service guarantees, including when they use wireless networks. While existing standardization efforts, such as Deterministic Networks (IETF) and Time-Sensitive Networking (TSN), have focused mainly on wired networks, more recent activities address wireless networks, like the Reliable and Available Wireless (RAW) Working Group of the IETF. Duplicating packets over multiple paths can improve availability and reliability, but this can potentially result in more out-of-order packets. Existing reordering algorithms, including two recently standardized by the IETF, are not always well suited to wireless networks. As a result, guaranteeing a bounded end-to-end latency and/or maximum consecutive packet losses is still particularly challenging. We propose a novel packet reordering algorithm for deterministic networking that includes wireless segments to achieve lower end-to-end latency while providing high end-to-end reliability. We simulate a 6TiSCH wireless network to compare its performance with the existing ones. Furthermore, we also extend existing Network Calculus bounds on the reordering timer to obtain path-dependent values that can reduce the average latency. We also introduce a probabilistic model to compute the reordering ratio when there are no retransmissions that fits the simulation results.
Fil: Piñero, Juan Cruz. Centre National de la Recherche Scientifique; Francia
Fil: Blanc, Alberto. Centre National de la Recherche Scientifique; Francia
Fil: Alvarez Hamelin, José Ignacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Tecnologías y Ciencias de la Ingeniería "Hilario Fernández Long". Universidad de Buenos Aires. Facultad de Ingeniería. Instituto de Tecnologías y Ciencias de la Ingeniería "Hilario Fernández Long"; Argentina
Fil: Papadopoulos, Georgios Z.. Universidad de Buenos Aires; Argentina
description Industrial Internet of Things applications need strict Quality of Service guarantees, including when they use wireless networks. While existing standardization efforts, such as Deterministic Networks (IETF) and Time-Sensitive Networking (TSN), have focused mainly on wired networks, more recent activities address wireless networks, like the Reliable and Available Wireless (RAW) Working Group of the IETF. Duplicating packets over multiple paths can improve availability and reliability, but this can potentially result in more out-of-order packets. Existing reordering algorithms, including two recently standardized by the IETF, are not always well suited to wireless networks. As a result, guaranteeing a bounded end-to-end latency and/or maximum consecutive packet losses is still particularly challenging. We propose a novel packet reordering algorithm for deterministic networking that includes wireless segments to achieve lower end-to-end latency while providing high end-to-end reliability. We simulate a 6TiSCH wireless network to compare its performance with the existing ones. Furthermore, we also extend existing Network Calculus bounds on the reordering timer to obtain path-dependent values that can reduce the average latency. We also introduce a probabilistic model to compute the reordering ratio when there are no retransmissions that fits the simulation results.
publishDate 2025
dc.date.none.fl_str_mv 2025-07
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/282128
Piñero, Juan Cruz; Blanc, Alberto; Alvarez Hamelin, José Ignacio; Papadopoulos, Georgios Z.; Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions; Elsevier Science; Computer Communications; 239; 7-2025; 1-12
0140-3664
CONICET Digital
CONICET
url http://hdl.handle.net/11336/282128
identifier_str_mv Piñero, Juan Cruz; Blanc, Alberto; Alvarez Hamelin, José Ignacio; Papadopoulos, Georgios Z.; Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions; Elsevier Science; Computer Communications; 239; 7-2025; 1-12
0140-3664
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://linkinghub.elsevier.com/retrieve/pii/S0140366425001288
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.comcom.2025.108171
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1859460913349787648
score 12.977003