Efficient routing method under distributed domain-division network

Abstract

The invention discloses an efficient routing method under a distributed domain-division network, which comprises the following steps that: a source node sends a service request packet to a cluster head node of a region, and the cluster head node judges whether the source node and a target node are positioned in the same region or not; if the source node and the target node are in the same area, the cluster head node calls area resource pool information and returns one or more routing paths meeting the QoS (Quality of Service) requirement of the service based on a routing decision algorithm ofreinforcement learning, and end-to-end routing establishment of the service is completed; if the source node and the target node are in different regions, the cluster head node calls global resource pool information, judges the region through which the service needs to pass based on a routing decision algorithm of reinforcement learning, and splits the service request by adopting a cross-region service request splitting method; and the split service requests are sent to the cluster head nodes of the passing areas, then area resource pool information is called, and finally end-to-end routing decision is completed by multi-area cooperation based on a routing decision algorithm of reinforcement learning to obtain a routing path from a source node to a target node.

Description

technical field [0001] The present invention relates to the technical field of wireless communication, and more specifically, relates to an efficient routing method under a distributed sub-area network. Background technique [0002] With the increasing maturity of various wireless communication technologies and the emergence of a large number of diversified mobile services, the future wireless network will present a development trend of intensive deployment, dynamic access, and coexistence of heterogeneous networks. High dynamic changes, explosive growth of network resource dimensions and other issues make it difficult for the traditional network management architecture to adapt to the management requirements of future communication networks. [0003] On the other hand, with the development and upgrading of information and communication technology, people have more expectations for the form of information transmission, such as various types of services such as text, voice, a...

AI Technical Summary

Problems solved by technology

[0008] In order to solve the problem that traditional Dijkstra and other routing algorithms based on the minimum hop cannot meet the complex and different QoS requirements of diversified services under the distributed domain management framework, the present invention proposes an efficient routing method under the distributed domain network , which uses a routing decision algorithm based on reinforcement learning, which has the advantages of low complexity and fast convergence speed, can effectively support the delay-sensitive service's demand for delay attributes, and can meet the differentiated QoS requirements of different services

Images