Queuing Game Theory Based Optimal Routing Scheme for Heterogeneous Users over Space Information Networks

Abstract EN

An optimal routing scheme in space information networks was presented to balance network loads for heterogeneous users.

According to the competition among the nodes, the model was built based on queuing game theory.

The virtual routing platform was in charge of resources allocation and route selection.

It got user’s gain to decide which node the user joined in.

Owning to the existing of heterogeneous users, an optimal admission fee needed to be obtained to avoid congestion.

In our model, firstly, the whole welfare of the system was formulated.

Then the optimal admission fee was calculated through maximizing the whole welfare.

Meanwhile, the average maximum queue length was generated to set the buffer space of the node.

At last, a routing factor was introduced into the route algorithm in order that the optimal routing could be selected by heterogeneous users.

As a result, the system welfare reaches the maximum.