Routing Strategies for Isochronal-Evolution Random Matching Network

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.