Cargando…

Routing Strategies for Isochronal-Evolution Random Matching Network

In order to abstract away a network model from some real-world networks, such as navigation satellite networks and mobile call networks, we proposed an Isochronal-Evolution Random Matching Network (IERMN) model. An IERMN is a dynamic network that evolves isochronally and has a collection of edges th...

Descripción completa

Detalles Bibliográficos
Autores principales: Lun, Weicheng, Li, Qun, Zhu, Zhi, Zhang, Can
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9955483/
https://www.ncbi.nlm.nih.gov/pubmed/36832731
http://dx.doi.org/10.3390/e25020363
_version_ 1784894357000683520
author Lun, Weicheng
Li, Qun
Zhu, Zhi
Zhang, Can
author_facet Lun, Weicheng
Li, Qun
Zhu, Zhi
Zhang, Can
author_sort Lun, Weicheng
collection PubMed
description In order to abstract away a network model from some real-world networks, such as navigation satellite networks and mobile call networks, we proposed an Isochronal-Evolution Random Matching Network (IERMN) model. An IERMN is a dynamic network that evolves isochronally and has a collection of edges that are pairwise disjoint at any point in time. We then investigated the traffic dynamics in IERMNs whose main research topic is packet transmission. When a vertex of an IERMN plans a path for a packet, it is permitted to delay the sending of the packet to make the path shorter. We designed a routing decision-making algorithm for vertices based on replanning. Since the IERMN has a specific topology, we developed two suitable routing strategies: the Least Delay Path with Minimum Hop (LDPMH) routing strategy and the Least Hop Path with Minimum Delay (LHPMD) routing strategy. An LDPMH is planned by a binary search tree and an LHPMD is planned by an ordered tree. The simulation results show that the LHPMD routing strategy outperformed the LDPMH routing strategy in terms of the critical packet generation rate, number of delivered packets, packet delivery ratio, and average posterior path lengths.
format Online
Article
Text
id pubmed-9955483
institution National Center for Biotechnology Information
language English
publishDate 2023
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-99554832023-02-25 Routing Strategies for Isochronal-Evolution Random Matching Network Lun, Weicheng Li, Qun Zhu, Zhi Zhang, Can Entropy (Basel) Article In order to abstract away a network model from some real-world networks, such as navigation satellite networks and mobile call networks, we proposed an Isochronal-Evolution Random Matching Network (IERMN) model. An IERMN is a dynamic network that evolves isochronally and has a collection of edges that are pairwise disjoint at any point in time. We then investigated the traffic dynamics in IERMNs whose main research topic is packet transmission. When a vertex of an IERMN plans a path for a packet, it is permitted to delay the sending of the packet to make the path shorter. We designed a routing decision-making algorithm for vertices based on replanning. Since the IERMN has a specific topology, we developed two suitable routing strategies: the Least Delay Path with Minimum Hop (LDPMH) routing strategy and the Least Hop Path with Minimum Delay (LHPMD) routing strategy. An LDPMH is planned by a binary search tree and an LHPMD is planned by an ordered tree. The simulation results show that the LHPMD routing strategy outperformed the LDPMH routing strategy in terms of the critical packet generation rate, number of delivered packets, packet delivery ratio, and average posterior path lengths. MDPI 2023-02-16 /pmc/articles/PMC9955483/ /pubmed/36832731 http://dx.doi.org/10.3390/e25020363 Text en © 2023 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Lun, Weicheng
Li, Qun
Zhu, Zhi
Zhang, Can
Routing Strategies for Isochronal-Evolution Random Matching Network
title Routing Strategies for Isochronal-Evolution Random Matching Network
title_full Routing Strategies for Isochronal-Evolution Random Matching Network
title_fullStr Routing Strategies for Isochronal-Evolution Random Matching Network
title_full_unstemmed Routing Strategies for Isochronal-Evolution Random Matching Network
title_short Routing Strategies for Isochronal-Evolution Random Matching Network
title_sort routing strategies for isochronal-evolution random matching network
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9955483/
https://www.ncbi.nlm.nih.gov/pubmed/36832731
http://dx.doi.org/10.3390/e25020363
work_keys_str_mv AT lunweicheng routingstrategiesforisochronalevolutionrandommatchingnetwork
AT liqun routingstrategiesforisochronalevolutionrandommatchingnetwork
AT zhuzhi routingstrategiesforisochronalevolutionrandommatchingnetwork
AT zhangcan routingstrategiesforisochronalevolutionrandommatchingnetwork