Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Adaptive routing planning method for q-learning optical on-chip network based on dijkstra algorithm

An optical-on-chip network and self-adaptive technology, applied in the direction of data exchange network, multiplexing system selection device, digital transmission system, etc., can solve the problems of low convergence speed, high time complexity, and inability to provide the shortest path, etc. Achieve the effect of fast speed and expanding the scope of application

Active Publication Date: 2021-06-15
XIDIAN UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Dijkstra's algorithm is a well-known algorithm for finding the shortest path. It can quickly give the shortest path, but it can only provide one shortest path for each target point, and cannot provide other alternative shortest paths, and it is only applicable to non-negative weight planning
Compared with the Dijkstra algorithm, the Bellman-Ford algorithm supports the presence of negative weights, and the code implementation is relatively simple, but the Bellman-Ford algorithm has a high time complexity, the convergence speed is lower than the Dijkstra algorithm, and the Bellman-Ford algorithm requires a lot of information Passing, especially when negative weights are encountered, requires multiple iterations

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
  • Adaptive routing planning method for q-learning optical on-chip network based on dijkstra algorithm
  • Adaptive routing planning method for q-learning optical on-chip network based on dijkstra algorithm
  • Adaptive routing planning method for q-learning optical on-chip network based on dijkstra algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0052] Based on the N×N mesh network and the Cygnus router, the Q-learning optical on-chip network adaptive routing planning method based on the Dijkstra algorithm in this embodiment is described in detail. Please refer to figure 1 , figure 1 It is a flowchart of a Q-learning optical on-chip network adaptive routing planning method based on the Dijkstra algorithm provided by the embodiment of the present invention. As shown in the figure, the method of the present invention comprises:

[0053] S1: Build a network model and define network model parameters;

[0054] Specifically, in this embodiment, the network is represented by a weighted directed graph G(V, E), where V represents a router node set, and E represents a router node bidirectional data link set. A coordinate system and a five-input five-output Cygnus router are constructed based on an N×N mesh network, and each node can be identified by coordinates (x, y). A path is defined as an ordered set of points R(v 0 ,v ...

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 present invention relates to a Q-learning optical on-chip network adaptive routing planning method based on Dijkstra algorithm, comprising: S1: constructing a network model, and defining network model parameters; S2: constructing each node to other nodes according to Dijkstra algorithm and network model The shortest path tree of the node, at the same time store several pieces of the node to the target node v in each node according to the preset value d The shortest path of , and get the source node v s to the target node v d The routing hops of the shortest path h(v s ,v d ); S3: According to the Q-learning algorithm, the link selection mechanism based on the ε-greedy strategy is used for path planning, and the source node v s to the target node v d Several planned paths, obtain the reward value of the planned path, and the number of route hops of the planned route does not exceed the route hop number of the shortest path h(v s ,v d ); S4: Get the best path according to the reward value of the planned path. The method of the invention overcomes the shortcoming that each target point of the Dijkstra algorithm can only generate one shortest path.

Description

technical field [0001] The invention belongs to the technical field of dynamic routing planning, and in particular relates to a Q-learning optical on-chip network adaptive routing planning method based on the Dijkstra algorithm. Background technique [0002] With the exponential growth of data traffic and the rapid development of smart devices, the network becomes more complex and more diverse, and more factors need to be considered, including stability, security, bandwidth, delay, load, etc. Now that chip multiprocessor capabilities are increasing, on-chip communication efficiency is critical to overall performance. During the entire information transmission process, the intermediate routers need to select the next hop router according to the current state. However, from an overall and long-term perspective, the lack of global information makes the selected next-hop forwarding node not always optimal, so people pay more attention to using reinforcement learning to solve re...

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
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/721H04L12/733H04L12/751H04Q11/00H04L12/24H04L45/02H04L45/122
CPCH04L45/02H04Q11/0005H04L45/12H04L45/122H04L41/12
Inventor 李慧陈燕怡顾华玺杨银堂王琨
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products