A Pricing-Based Algorithm Of Routing And Resource Allocation For Satellite Networks

With the increasing traffic flow and the diverse applications in satellite communication network, network resources, especially the limited bandwidth, is becoming scarce. In the background of military communication, pricing-based resource allocation is aiming at providing differentiated services in resource allocation for different users. It is of great significance in enhancing users’satisfaction and optimizing system performance.This dissertation studies the bandwidth allocation strategy of Converged Satellite and Terrestrial Networks (CSTNs), which is based on pricing scheme. The main contributions of this dissertation are as followed:1. This dissertation gives a brief introduction of the research status and presents the purpose of this research. It also explains the necessity of introducing the pricing scheme to the bandwidth allocation in CSTNs.2. We introduce the concept of resource allocation and the problems in communication network resource allocation at this stage. Afterwards, two allocation schemes that widely used for resource allocation are summarized, one of them is based on pricing scheme, and the other one is based on game theories respectively. Then we give a comparison of the two resource allocation schemes.3. Combined with the characteristics of military communication, a model of CSTNs is put forward with a detailed introduction of node function, and then three priorities are set for the services in this system. On the basis of this effort, a routing and resource allocation algorithm is proposed, which is based on pricing scheme. In this algorithm, the price and the bandwidth utilization of each link are associated and the price is regarded as the weight for selecting the shortest path in routing algorithm. In the scenario of dynamic services, we set up a path for each service according to the link weights which are refreshed dynamically in the routing table, minimizing the blocking probability and increasing network throughput. Additionally, this algorithm has the ability to allocate bandwidth accordingly based on both the priority of the services and the bandwidth utilization of each link.4. The topology with the detailed parameter settings of nodes and links used in CSTNs is constructed, and then the performance of the proposed algorithm is tested in this topology via Matlab 7.1. The result shows that this algorithm can ensure the Quality of Service (QoS) for high priority services. Meanwhile, it can reduce the traffic blocking ratio, compared to those of other resource allocation algorithms.The last part is the summary and conclusions of the whole dissertation. Then we point out some issues to be discussed in detail in the future.