Efficient routing method under distributed domain-division network

A distributed and routing technology, applied in the direction of data exchange network, digital transmission system, electrical components, etc., can solve the problems of low complexity, unable to meet the complex and different QoS requirements of diversified services, and fast convergence speed

Active Publication Date: 2020-04-10
CHINA ELECTRONICS TECH GRP NO 7 RES INST
View PDF6 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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 distr

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Efficient routing method under distributed domain-division network
  • Efficient routing method under distributed domain-division network
  • Efficient routing method under distributed domain-division network

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0088] Example 1

[0089] A high-efficiency routing method under a distributed domain-divided network. The efficient routing method is based on a distributed domain-divided network architecture. Each backbone network area is composed of member nodes and cluster head nodes in the cluster, and all member nodes can pass through One-hop or multi-hop way to connect to the cluster head node. For service requests with different QoS requirements and different types, the regional cluster head makes a judgment based on the current network resource status, and returns one or more routing paths that meet the service requirements. When the source node and the target node are in the same area, the routing decision is independently completed by the cluster head node of the area. When the source node and the target node are in different areas, the routing decision is completed by the cluster head of the relevant area.

[0090] like figure 2 As shown, specifically, the steps of the efficien...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L12/721H04L12/715H04L12/709H04L45/243
CPCH04L45/44H04L45/46H04L45/04H04L45/124H04L45/14H04L45/245
Inventor 罗涛李泽旭刘颖李勇杨灿
Owner CHINA ELECTRONICS TECH GRP NO 7 RES INST
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products