Routing Strategies for Isochronal-Evolution Random Matching Network.

Area of Science:

• Computer Science
• Network Science
• Telecommunications

Background:

• Real-world networks like satellite and mobile call systems require abstract models.
• Dynamic network evolution and traffic dynamics are critical research areas.
• Packet transmission efficiency is a key performance indicator in communication networks.

Purpose of the Study:

• To propose a novel dynamic network model, the Isochronal-Evolution Random Matching Network (IERMN).
• To investigate traffic dynamics and packet transmission within IERMNs.
• To develop and evaluate efficient routing strategies for IERMNs.

Main Methods:

• Introduced the Isochronal-Evolution Random Matching Network (IERMN) model with pairwise disjoint edges.
• Developed a replanning-based routing decision-making algorithm allowing packet sending delays.
• Designed and implemented two routing strategies: Least Delay Path with Minimum Hop (LDPMH) and Least Hop Path with Minimum Delay (LHPMD).

Main Results:

• The Least Hop Path with Minimum Delay (LHPMD) strategy demonstrated superior performance over the Least Delay Path with Minimum Hop (LDPMH) strategy.
• LHPMD achieved better results in critical packet generation rate, delivered packet count, and packet delivery ratio.
• LHPMD also showed improved average posterior path lengths compared to LDPMH.

Conclusions:

• The proposed IERMN model provides an effective abstraction for dynamic real-world networks.
• The LHPMD routing strategy is more efficient for packet transmission in IERMNs than LDPMH.
• IERMNs and the LHPMD strategy offer potential improvements for navigation and mobile communication networks.