ArticleEntropy (Basel, Switzerland)2023
Routing Strategies for Isochronal-Evolution Random Matching Network.
Article in Entropy (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
Abstract
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.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.