Efficient priority queueing routing strategy on mobile networks

TL;DR

This paper introduces a priority queueing routing strategy for mobile networks that significantly enhances throughput and reduces delays by prioritizing packets based on shortest distance, outperforming traditional FIFO methods.

Contribution

It applies priority queueing discipline to shortest distance routing in mobile networks, demonstrating notable improvements over existing strategies.

Findings

Increased network throughput and packet arriving rate.

Reduced average end-to-end delay.

Lower queueing delay rate.

Abstract

Mobile networks are intriguing in recent years due to their practical implications. Previous routing strategies for improving transport efficiency have little attention what order should the packets be forwarded, just simply used first-in-first-out queue discipline. Here we apply priority queueing discipline to shortest distance routing strategy on mobile networks. Numerical experiments show it not only remarkably improves network throughput and the packet arriving rate, but also reduces average end-to-end delay and the rate of queueing delay. Our work may be helpful in routing strategy designing on mobile networks.