CN112003787A - Routing path determining method, device, control equipment and storage medium - Google Patents
Routing path determining method, device, control equipment and storage medium Download PDFInfo
- Publication number
- CN112003787A CN112003787A CN202010820916.7A CN202010820916A CN112003787A CN 112003787 A CN112003787 A CN 112003787A CN 202010820916 A CN202010820916 A CN 202010820916A CN 112003787 A CN112003787 A CN 112003787A
- Authority
- CN
- China
- Prior art keywords
- information
- path
- application
- routing path
- routing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/028—Dynamic adaptation of the update intervals, e.g. event-triggered updates
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method and a device for determining a routing path, control equipment and a storage medium. The method comprises the following steps: acquiring at least two application messages, wherein the transmission time slots included in each application message are the same, and the application messages are used for applying for a routing path in the transmission time slots; determining reply information corresponding to each application information according to each application information and path resource information, wherein the path resource information indicates the occupation state of a routing path in the network; and transmitting each batch of complex information. By the method, the reply information can be determined before the route is congested, and the hysteresis of route optimization is effectively reduced.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a method and a device for determining a routing path, control equipment and a storage medium.
Background
In today's high performance networks, optimization of routes is required to improve network quality. Routing refers to the network-wide process of determining an end-to-end path as a packet travels from a source to a destination. When data is transmitted in a network, local routing is often congested excessively, so that partial data transmission time is long, and due to the influence of a barrel effect, next calculation operation can be performed after all data transmission is finished, so that the network quality is influenced.
The traditional static route optimization technology can realize the accurate control of route resources through methods such as precompilation and the like, but cannot process the situation of dynamic data. Most of the dynamic routing technologies adopt a post-scheduling mechanism, that is, measures are taken only after the route is congested, so that the route optimization has hysteresis and an optimal path cannot be obtained.
Disclosure of Invention
The embodiment of the invention provides a method, a device, a control device and a storage medium for determining a routing path, which can determine reply information before routing congestion and effectively reduce the hysteresis of routing optimization.
In a first aspect, an embodiment of the present invention provides a method for determining a routing path, including:
acquiring at least two application messages, wherein the transmission time slots included in each application message are the same, and the application messages are used for applying for a routing path in the transmission time slots;
determining reply information corresponding to each application information according to each application information and path resource information, wherein the path resource information indicates the occupation state of a routing path in the network;
and transmitting each batch of complex information.
In a second aspect, an embodiment of the present invention provides a routing path determining apparatus, including:
an obtaining module, configured to obtain at least two application messages, where transmission time slots included in each of the application messages are the same, and the application messages are used to apply for a routing path in the transmission time slots;
the determining module is used for determining reply information corresponding to each application information according to each application information and path resource information, and the path resource information indicates the occupation state of a routing path in a network;
and the transmission module is used for transmitting each batch of complex information.
In a third aspect, an embodiment of the present invention provides a control apparatus, including:
one or more processors;
storage means for storing one or more programs;
when the one or more programs are executed by the one or more processors, the one or more processors implement the routing path determination method described in any embodiment of the present invention.
In a fourth aspect, the present invention also provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the method for determining a routing path according to any of the embodiments of the present invention.
The embodiment of the invention provides a method, a device, a control device and a storage medium for determining a routing path, which are used for firstly acquiring at least two pieces of application information, wherein transmission time slots included in each piece of application information are the same, the application information is used for applying for a routing path in the transmission time slots, then determining reply information corresponding to each piece of application information according to each piece of application information and path resource information, the path resource information indicates the occupation state of the routing path in a network, and finally transmitting each piece of reply information. By using the technical scheme, the reply information can be determined before the route is congested, and the hysteresis of route optimization is effectively reduced.
Drawings
Fig. 1 is a schematic flowchart of a method for determining a routing path according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of a routing path determining method according to a second embodiment of the present invention;
fig. 3 is a schematic flow chart of another routing path determining method according to the second embodiment of the present invention;
fig. 4 is a schematic view of a scenario of a routing path determining method according to a second embodiment of the present invention.
Fig. 5 is a schematic structural diagram of a routing path determining apparatus according to a third embodiment of the present invention;
fig. 6 is a schematic structural diagram of a control device according to a fourth embodiment of the present invention;
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.
Before discussing exemplary embodiments in more detail, it should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart may describe the operations (or steps) as a sequential process, many of the operations can be performed in parallel, concurrently or simultaneously. In addition, the order of the operations may be re-arranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figure. The processes may correspond to methods, functions, procedures, subroutines, and the like. In addition, the embodiments and features of the embodiments in the present invention may be combined with each other without conflict.
The term "include" and variations thereof as used herein are intended to be open-ended, i.e., "including but not limited to". The term "based on" is "based, at least in part, on". The term "one embodiment" means "at least one embodiment".
Example one
Fig. 1 is a schematic flowchart of a routing path determining method according to an embodiment of the present invention, where the method is applicable to determining reply information before a route is congested in a data transmission process, and the method may be executed by a routing path determining apparatus, where the apparatus may be implemented by software and/or hardware and is generally integrated on a control device, and the control device may be considered as a device capable of implementing dynamic routing planning. As shown in fig. 1, a method for determining a routing path according to an embodiment of the present invention includes the following steps:
s110, at least two application messages are obtained, the transmission time slots included in each application message are the same, and the application messages are used for applying for routing paths in the transmission time slots.
In this embodiment, the application information may be information included in an application that the sending core proposes to the destination core before data transmission is performed between any two cores. The sending core may be a core applying for sending data, and the destination core may be a core receiving data.
The at least two application information obtained in this step may come from different cores, and each application information may correspond to one sending core. In this step, it can be considered that at least two cores apply for data transmission in the same transmission time slot when obtaining the application information that at least two transmission time slots are the same. Each application message may include a transmission timeslot, and the transmission timeslots of the application messages may be the same, and for example, any two cores may apply for data transmission in the same transmission timeslot. After the control device obtains the at least two application information, routing path planning can be performed for the routing node corresponding to each application information.
When a plurality of cores transmit data on a chip or an inter-chip network, in a transmission time slot, before data transmission is performed between the cores, application information needs to be sent through a sending core to request for routing required for sending the data. The data amount transmitted by each sending core to the corresponding destination core may be consistent, for example, the transmitted data amount may be a unit data amount, so that the control device performs routing planning for each core.
The application information may include source address information and destination address information. The source address information may represent an address of a source routing node corresponding to the sending core, and the destination address information may represent an address of a destination routing node corresponding to the destination core.
The source routing node and the destination routing node may be routing nodes corresponding to a sending core and a destination core, respectively, where one core is connected to a routing node corresponding to the core, that is, the core and the routing node appear in pairs, for example, before data transmission, the sending core may apply for a route for transmitting data to the destination core to the control device, and the application information corresponding to the application may include information of an address where the routing node corresponding to the sending core, that is, the source routing node, is located and information of an address where the routing node corresponding to the destination core, that is, the destination routing node, is located.
In some optional embodiments, part of the acquired application information may be the same among the plurality of application information. For example, a plurality of application information is obtained, where 2 application information are all used by the core a to apply for data transmission to the core b in the target transmission timeslot.
The transmission time slot may be a time gap for transmitting data, for example, the time is divided into a plurality of time slots which do not overlap with each other, different sub-channels are established by different time slots, and the route may be divided into a plurality of time slots, and data transmission is performed in each time slot. The transmission time slot may also be considered as a sending time slot, the sending core applies for sending data in the transmission time slot to the control device, and the control device may determine replication information for the sending core based on the application information, so as to determine a routing path for the sending core.
The routing path may be a path formed by connecting routing nodes, and each application information may be used to apply for a routing path. The routing node may be a routing node to which each core should be connected. Illustratively, a plurality of cores may be included in the network on chip, each core corresponds to a routing node, the routing nodes are uniformly distributed, and the routing nodes are connected with each other to form a routing path. The routing path applied by the application information in this embodiment may be used for data transmission.
And S120, determining reply information corresponding to each application information according to each application information and path resource information, wherein the path resource information indicates the occupation state of a routing path in the network.
The path resource information may be information characterizing the occupation states of all routing paths in the network, that is, the path resource information may be used to indicate the occupation states of all routing paths in the network. Wherein the occupied status may indicate occupied and unoccupied. The path resource information may be used to determine idle routing paths in the network to facilitate determination of routing paths.
The reply information may be information characterizing the reply result, and for example, the reply information may be the reply result indicating approval, and the reply information may also be the reply result indicating rejection. The replication information can be determined according to each application information and the path resource information. When the reply information includes a reply result indicating approval, the reply information may further include path information corresponding to the selected feasible routing path.
In this embodiment, the feasible routing path may be a routing path selected from all routing paths from an address corresponding to the source address information of the application information to an address corresponding to the destination address information of the application information, for example, at least one idle routing path is determined from all routing paths from an address corresponding to the source address information of the application information to an address corresponding to the destination address information of the application information, and the occupied states of all sub-paths of the idle routing path are idle, so that any idle routing path may be determined as the feasible routing path.
In one possible implementation, the feasible routing path indicates idle for the occupied status of each sub-path in the plurality of routing paths, and the routing path with the minimum number of nodes is experienced. The feasible routing path can be selected according to the number of nodes from the address corresponding to the source address information of the application information to the address corresponding to the destination address information of the application information. Therefore, when data transmission is carried out in the transmission time slot, each sub-path of the routing path is idle, and the data transmission efficiency can be improved by minimizing the number of the experienced nodes. The present disclosure does not limit the manner in which feasible routing paths are selected.
For example, selecting a feasible routing path may be determining multiple routing paths to be selected according to the source address information and the destination address information, where the number of nodes experienced by each routing path may not be completely the same. At least one routing path with each idle sub-path can be determined according to the path resource information in the transmission time slot, and the routing path with the least number of nodes in the at least one routing path with each idle sub-path is determined as a feasible routing path.
The feasible routing path may also be selected by determining a routing path with the smallest number of nodes among the multiple routing paths to be selected as a reference routing path, and determining whether the reference routing path is selected as the feasible routing path according to the path resource information in the transmission timeslot and the reference routing path. For example, it may be determined whether each sub-path of the reference routing path is idle, and if each sub-path of the reference routing path is idle, the reference routing path may be selected as a feasible routing path. If the reference routing path comprises the non-idle sub-path, removing the reference routing path from the plurality of routing paths to be selected, obtaining the removed routing path to be selected again, selecting the routing path with the least number of nodes again, and determining the reselected routing path as the reference routing path.
And determining the occupation state of each routing path according to the occupation state of the routing path in the network indicated by the path resource information. The approval information may include path information indicating the approved approval result and the selected feasible routing path, wherein the path information may be information identifying the feasible routing path. When the feasible routing path is selected, if the selection times are greater than a set threshold value or each routing path to be selected includes a non-idle sub-routing path (it is determined that there is no feasible routing path), the reply information may include a reply result indicating rejection.
If the reply information includes the path information of the selected feasible routing path, updating the path resource information in the transmission time slot, for example, modifying the occupation state of the sub-path included in the feasible routing path included in the reply information into occupation. The set threshold may be a preset value, and the specific value is not limited herein.
And S130, transmitting each batch of complex information.
After the application information is determined, the reply information may be transmitted to the core that transmits the corresponding application information, and the reply information may be a reply result of the application information transmitted by the corresponding core.
The reply information may also include path information, and the path information may be path information corresponding to the selected feasible routing path. When the reply information includes the path information corresponding to the selected feasible routing path, the path information may be transmitted to the routing node corresponding to the core that sent the application information. The routing node can determine the routing path of the routing node according to the path information, so as to transmit data.
For example, the path information may be used to indicate a connection direction between each hop of routing nodes between the source routing node and the destination routing node, where a path formed by connecting the routing nodes is a feasible routing path indicated by the path information.
In a routing path determining method provided in an embodiment of the present invention, at least two application messages are obtained, where transmission time slots included in each application message are the same, and the application messages are used to apply for a routing path in the transmission time slots; determining reply information corresponding to each application information according to each application information and path resource information, wherein the path resource information indicates the occupation state of a routing path in the network; and transmitting each of the batch messages. By the method, the reply information can be determined before the route is congested, and the hysteresis of route optimization is effectively reduced.
Further, each application message includes source address information and destination address information; correspondingly, the determining the reply information corresponding to each application information according to each application information and the path resource information includes: aiming at each application message, selecting a feasible routing path according to the source address message, the destination address message and the path resource message in the transmission time slot of the application message; determining path information corresponding to the selected feasible routing path and a reply result indicating approval as reply information of the application information; updating the path resource information in the transmission time slot according to the reply information; wherein, the occupation states of the sub-paths included in the feasible routing path all indicate idle.
The feasible routing path may be an unoccupied routing path determined by the source address information and the destination address information, and the occupation states of all sub-paths included in the feasible routing path indicate idling. When selecting a feasible routing path corresponding to the application information, the feasible routing path may be selected based on the address corresponding to the source address information included in the application information, the destination address information included in the application information, and path resource information in the transmission timeslot.
The feasible routing path can be selected according to the path resource information in the transmission time slot, and the occupation states of all sub-paths included in the feasible routing path are indicated to be idle, that is, not occupied. The sub-path may be a path between any two adjacent routing nodes within the feasible routing path, which may include one or more sub-paths. The occupation state indication idle state can be characterized in that the corresponding sub path is not occupied, and whether the sub path is occupied or not can be known through path resource information. Selecting a feasible routing path may include the following operations: selecting a routing path with the least number of nodes from source address information to destination address information, if the sub-path in the routing path is occupied, selecting the routing path which experiences the least number of nodes plus 1 node, if the sub-path in the routing path is occupied, continuing to select the routing path which experiences the least number of nodes plus 2 nodes, and selecting a feasible routing path when increasing one node number. And repeating the information until the times of selecting the feasible routing paths are larger than the set threshold value, or each routing path to be selected comprises a non-idle sub-routing path (no feasible routing path is determined), and then repeating the information to comprise the result of repeating the information indicating the rejection. The selecting times may be times of selecting a feasible routing path.
After the feasible routing path is selected, the replication information may include path information corresponding to the feasible routing path and a replication result indicating approval. The reply information may include a reply result indicating a rejection after the feasible routing path is not selected.
When the reply information includes the selected feasible routing path, the path resource information may be updated based on the feasible routing path included in the reply information, that is, the occupation state of the routing path in the network on chip is corrected. When determining the reply information of the next application information, the path resource information can be determined according to the updated path resource information.
Further, when a feasible routing path is selected, if the selection times are greater than a set threshold value or no feasible routing path is determined, the reply result indicating rejection is determined as the reply information of the application information.
After the reply result indicating rejection is determined as the reply information of the application information, the core of the application information can continue to send the application information of other transmission time slots to the control device, and the control device continues to determine the reply information of other transmission time slots.
Further, when a feasible routing path is selected, the routing path with the minimum number of nodes and the idle state of each sub-path among the routing paths from the address corresponding to the source address information of the application information to the address corresponding to the destination address information of the application information is determined as the feasible routing path.
The address corresponding to the source address information of the application information may be an address location where a source routing node included in the application information is located, and the address corresponding to the destination address information of the application information may be an address location where a destination routing node included in the application information is located, where the number of nodes may be the number of routing nodes.
Further, the transmitting each of the plurality of pieces of complex information includes: transmitting the reply result included in the reply information to a core sending the corresponding application information; and when the reply information comprises path information corresponding to the selected feasible routing path, transmitting the path information to a routing node corresponding to a core sending the corresponding application information.
After determining the reply information, the reply result may be transmitted to the corresponding core, and the path information may be transmitted to the corresponding routing node, so as to instruct the routing node to perform data transmission based on the path information.
Further, the application information is sent in a transmission time slot before the transmission time slot, and the application information is used for pre-applying for a routing path in the transmission time slot.
Before the transmission time slot transmits data, application information can be sent to the control device for applying for data transmission in the transmission time slot. For example, the application information may be sent in any transmission time slot before the transmission time slot, and the application information may be used to apply for a routing path in the transmission time slot in advance, so that the reply information may be determined before the transmission time slot transmits data.
Example two
Fig. 2 is a flowchart illustrating a routing path determining method according to a second embodiment of the present invention. When many cores pass through on-chip and inter-chip network data transmission, local routing over-congestion often occurs, so that partial data transmission time is long, and due to the influence of a barrel effect, next calculation operation can be performed after all data transmission is finished, so that the routing needs to be optimized.
The traditional static route optimization technology can realize the accurate control of route resources through methods such as precompilation and the like, but cannot process the situation of dynamic data. The dynamic routing technology can plan a routing path in real time according to the routing congestion condition in the operation process, but may need a more complex decision and scheduling mechanism. Since most of the methods adopt a post-scheduling mechanism, that is, measures are taken only after the route is congested, the route optimization has hysteresis and cannot reach an optimal scheme.
In the conventional dynamic routing technology, a sender, namely a sending core, requests a nearest sending routing node to transmit data, a route usually informs the sender whether the sender can send the data through a pressure feedback method, namely, the current routing node is not busy, the sender agrees to send the request and can send the request, and if the current node is busy, namely, a feasible routing path is occupied, the sending application is rejected. The method is difficult to dynamically control the busy condition of the route, and is easy to cause some local network congestion.
Therefore, how to realize the dynamic routing technology at a lower cost when the many cores transmit data through the network on and between the chips, and ensuring the data transmission efficiency becomes a technical problem to be solved urgently at present.
In the method for determining a routing path according to this embodiment, a route is divided into transmission slots according to time, and when a current transmission slot (denoted as nth slot) transmits data in the previous T transmission slots, data, that is, a transmission application, is sent, and a destination address, that is, destination address information, is notified. At this time, the network on chip may predict how much data that all nodes need to transmit in the nth time slot when the previous T transmission time slots transmit data, that is, determine the data that can be transmitted in the nth time slot according to the result of the batch. The optimized transmission path, i.e. the feasible routing path, of each application message is calculated through a network optimization algorithm (such as a water injection theorem), if an undesolvable path or a route is excessively congested, a sender can be informed that the sending application is invalid at any stage before a transmission time slot n comes, i.e. when the feasible routing path is selected, if the selection times are greater than a set threshold value or no feasible path is determined, the reply result indicating rejection is determined as the reply message of the application message, and at the moment, the application messages of other transmission time slots can be continuously acquired.
As shown in fig. 2, a network on chip has a plurality of cores, each core corresponds to a routing node, each sending core applies for a dynamic routing planning apparatus, that is, a control device, the dynamic routing planning apparatus transmits replication information of an application corresponding to each sending core, and the corresponding sending core transmits path information corresponding to a feasible routing path in the replication information to a corresponding node.
Each routing path of the network on chip under each transmission time slot can be regarded as a resource pool, namely path resource information, the routing path is arranged to send a certain amount of data equivalent to water injection in the resource pool, when the data injected by the routing path is more than other paths, namely the routing path is occupied, therefore, the data can flow into other paths, namely idle routing paths, and the final optimization result is that the data transmission amount of each routing path is basically equivalent. The method can make the data bypass to other paths, thereby relieving local congestion and realizing global optimization.
Fig. 3 is a flowchart of another routing path determining method according to the second embodiment of the present invention, where as shown in fig. 3, a core may be a many core, application information corresponding to each sending core may form a routing application list, each transmission time slot may be respectively planned through a path planning algorithm according to the routing application list, that is, replication information corresponding to each application information is determined according to each application information and path resource information, and path information corresponding to a feasible routing path in the replication information is transmitted to a path resource pool after planning. On the other hand, the replication result, i.e., the replication information, may be sent to the core, and the routing configuration information, i.e., the path information corresponding to the feasible routing path, may be transmitted to the routing node corresponding to the core, so as to indicate the routing node to determine the feasible routing path.
Fig. 4 is a scene schematic diagram of a routing path determining method according to a second embodiment of the present invention, and as shown in fig. 4, there are four data applications, that is, four application information.
Applying for 1, sending a core (1,2) to apply for transmitting data to a target core (2, 2);
applying for 2, sending a core (0,2) to apply for transmitting data to a target core (3, 2);
applying for 3, sending a core (0,3) to apply for transmitting data to a target core (3, 2);
applying 4, the sending core (1,2) applies for transmitting data to the destination core (2, 2);
the data volume of each application for transmission is consistent, that is, the data volume of each sending core for transmission is consistent, that is, the data volume is a unit data volume.
The routing path of application 1 is first planned. The routing paths (1,2) - (2,2) are routing paths, i.e. sub-paths, composed of two adjacent routing nodes in the network on chip, and the routing paths occupy one unit data volume, as shown by the arrow of application 1 in fig. 4, the routing paths are not occupied, so that application 1 obtains approval, i.e. indicates approval of the approval.
And then planning the routing path of the application 2. Although the distance of the routing path (0,2) - (1,2) - (2,2) - (3,2) is shortest, since the sub-path (1,2) - (2,2) is occupied, the routing path shown by the arrow of application 2 in fig. 4, which is not occupied, is adopted, and application 2 is approved.
And then planning the routing path of the application 3. Although the routing path of the sub-path passing through (1,3) - (2,3) or the sub-path of (1,2) - (2,2) is shortest, the occupied sub-path can only select other feasible routing paths from the idle paths, so that the routing path where the arrow of application 3 is located can be selected as shown in fig. 4, and application 3 is approved.
Finally, the routing path of application 4 is planned. Since the sub-paths (1,2) - (2,2), (1,1) - (2,2), (1,3) - (2,3) are all occupied, if no feasible routing path is selected from the idle routing paths, the application 4 is rejected, that is, the rejected reply result is indicated.
In all routing paths from the source node, i.e., the source routing node, to the destination node, i.e., the destination routing node, the number of times of selection during the optimal path transfer, i.e., the path, is greater than the set threshold (in this embodiment, the set threshold is 1), and then the rejected reply result is indicated.
The optimal path transfer can be expressed as that the number of nodes experienced from the source node to the destination node after the transfer is reduced, namely that the feasible routing path is idle as the occupation state of each sub-path in the feasible routing path, and the experienced routing path with the least number of nodes, and the non-optimal path transfer refers to that the number of nodes experienced from the source node to the destination node after the transfer is increased, namely that the routing path with the number increased than the number of routing nodes experienced in the previous optimal path can be selected from the idle routing path as the current feasible routing path after the current optimal path is occupied.
According to the routing path determining method provided by the embodiment, the batch information is obtained in a period of time before the real data transmission, and the routing can be optimized before the routing is congested at a low cost.
EXAMPLE III
Fig. 5 is a schematic structural diagram of a routing path determining apparatus according to a third embodiment of the present invention, which is applicable to a case where replication information is determined before excessive congestion occurs in a route during data transmission, where the apparatus may be implemented by software and/or hardware, and is generally integrated on a control device.
As shown in fig. 5, the apparatus includes:
an obtaining module 510, configured to obtain at least two application messages, where transmission time slots included in each of the application messages are the same, and the application messages are used to apply for a routing path in the transmission time slots;
a determining module 520, configured to determine replication information corresponding to each application information according to each application information and path resource information, where the path resource information indicates an occupied state of a routing path in a network;
a transmission module 530, configured to transmit each of the pieces of complex information.
In this embodiment, the apparatus first uses an obtaining module 510 to obtain at least two application messages, where transmission time slots included in each of the application messages are the same, and the application messages are used to apply for a routing path in the transmission time slots; then, the determining module 520 is configured to determine replication information corresponding to each application information according to each application information and path resource information, where the path resource information indicates an occupied state of a routing path in a network; finally, the transmission module 530 is used for transmitting each batch of complex information.
The embodiment provides a routing path determining method, which can determine the reply information before the routing is congested and effectively reduce the hysteresis of routing optimization.
Further, each application message includes source address information and destination address information; accordingly, the determining module 520 includes: a path selecting unit, configured to select, for each application message, a feasible routing path according to source address information and destination address information of the application message and path resource information in the transmission timeslot; the information determining unit is used for determining path information corresponding to the selected feasible routing path and a reply result indicating approval as reply information of the application information; the information updating unit is used for updating the path resource information in the transmission time slot according to the reply information; wherein, the occupation states of the sub-paths included in the feasible routing path all indicate idle.
Further, when a feasible routing path is selected, if the selection times are greater than a set threshold value or no feasible routing path is determined, the reply result indicating rejection is determined as the reply information of the application information.
Further, when a feasible routing path is selected, the routing path with the minimum number of nodes and the idle state of each sub-path among the routing paths from the address corresponding to the source address information of the application information to the address corresponding to the destination address information of the application information is determined as the feasible routing path.
Further, the transmission module 530 includes: transmitting the reply result included in the reply information to a core sending the corresponding application information; and when the reply information comprises path information corresponding to the selected feasible routing path, transmitting the path information to a routing node corresponding to a core sending the corresponding application information.
Further, the application information is sent in a transmission time slot before the transmission time slot, and the application information is used for pre-applying for a routing path in the transmission time slot.
The routing path determining device can execute the routing path determining method provided by any embodiment of the invention, and has corresponding functional modules and beneficial effects of the executing method.
Example four
Fig. 6 is a schematic structural diagram of a control device according to a fourth embodiment of the present invention. As shown in fig. 6, a control device according to a fourth embodiment of the present invention includes: one or more processors 61 and storage 62; the processor 61 in the control device may be one or more, and one processor 61 is taken as an example in fig. 6; storage 62 is used to store one or more programs; the one or more programs are executed by the one or more processors 61, so that the one or more processors 61 implement the routing path determination method according to any one of the embodiments of the present invention.
The control apparatus may further include: an input device 63 and an output device 64.
The processor 61, the storage means 62, the input means 63 and the output means 64 in the control device may be connected by a bus or other means, as exemplified by the bus connection in fig. 6.
The storage device 62 in the control apparatus is used as a computer-readable storage medium for storing one or more programs, which may be software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the routing path determining method provided in the first embodiment or the second embodiment of the present invention (for example, the modules in the routing path determining device shown in fig. 5 include an obtaining module 510, a determining module 520, and a transmitting module 530). The processor 61 executes various functional applications of the control device and data processing by running software programs, instructions and modules stored in the storage device 62, that is, implements the routing path determination method in the above-described method embodiment.
The storage device 62 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the control apparatus, and the like. Further, the storage device 62 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some examples, the storage device 62 may further include memory located remotely from the processor 61, which may be connected to the device over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input device 63 is operable to receive input numeric or character information and to generate key signal inputs relating to user settings and function control of the control apparatus. The output device 64 may include a display device such as a display screen.
And, when one or more programs included in the above-described control apparatus are executed by the one or more processors 61, the programs perform the following operations:
acquiring at least two application messages, wherein the transmission time slots included in each application message are the same, and the application messages are used for applying for a routing path in the transmission time slots;
determining reply information corresponding to each application information according to each application information and path resource information, wherein the path resource information indicates the occupation state of a routing path in the network;
and transmitting each batch of complex information.
EXAMPLE five
An embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program is used, when executed by a processor, to execute a routing path determining method, where the method includes:
acquiring at least two application messages, wherein the transmission time slots included in each application message are the same, and the application messages are used for applying for a routing path in the transmission time slots;
determining reply information corresponding to each application information according to each application information and path resource information, wherein the path resource information indicates the occupation state of a routing path in the network;
and transmitting each batch of complex information.
Optionally, the program, when executed by a processor, may be further adapted to perform a method provided by any of the embodiments of the invention.
Computer storage media for embodiments of the invention may employ any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer-readable storage medium may be, for example, but is not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a Read Only Memory (ROM), an Erasable Programmable Read Only Memory (EPROM), a flash Memory, an optical fiber, a portable CD-ROM, an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. A computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take a variety of forms, including, but not limited to: an electromagnetic signal, an optical signal, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, Radio Frequency (RF), etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.
Claims (10)
1. A method for determining a routing path, comprising:
acquiring at least two application messages, wherein the transmission time slots included in each application message are the same, and the application messages are used for applying for a routing path in the transmission time slots;
determining reply information corresponding to each application information according to each application information and path resource information, wherein the path resource information indicates the occupation state of a routing path in the network;
and transmitting each batch of complex information.
2. The method of claim 1, wherein each of the application messages includes source address information and destination address information; correspondingly, the determining the reply information corresponding to each application information according to each application information and the path resource information includes:
aiming at each application message, selecting a feasible routing path according to the source address message, the destination address message and the path resource message in the transmission time slot of the application message;
determining path information corresponding to the selected feasible routing path and a reply result indicating approval as reply information of the application information;
updating the path resource information in the transmission time slot according to the reply information;
wherein, the occupation states of the sub-paths included in the feasible routing path all indicate idle.
3. The method according to claim 2, wherein when the feasible routing path is selected, if the selection times is greater than a set threshold or no feasible routing path is determined, the reply result indicating rejection is determined as the reply information of the application information.
4. The method according to claim 2, wherein when selecting the feasible routing path, the routing path with the least number of nodes and idle sub-paths among the routing paths from the address corresponding to the source address information of the application information to the address corresponding to the destination address information of the application information is determined as the feasible routing path.
5. The method of claim 1, wherein said transmitting each of said batches of information comprises:
transmitting the reply result included in the reply information to a core sending the corresponding application information;
and when the reply information comprises path information corresponding to the selected feasible routing path, transmitting the path information to a routing node corresponding to a core sending the corresponding application information.
6. The method of claim 1, wherein the application information is sent in a transmission slot prior to the transmission slot, and wherein the application information is used to pre-apply for a routing path in the transmission slot.
7. A routing path determination apparatus, the apparatus comprising:
an obtaining module, configured to obtain at least two application messages, where transmission time slots included in each of the application messages are the same, and the application messages are used to apply for a routing path in the transmission time slots;
the determining module is used for determining reply information corresponding to each application information according to each application information and path resource information, and the path resource information indicates the occupation state of a routing path in a network;
and the transmission module is used for transmitting each batch of complex information.
8. The apparatus of claim 7, wherein each of the application messages includes source address information and destination address information; accordingly, the determining module comprises:
a path selecting unit, configured to select, for each application message, a feasible routing path according to source address information and destination address information of the application message and path resource information in the transmission timeslot;
the information determining unit is used for determining path information corresponding to the selected feasible routing path and a reply result indicating approval as reply information of the application information;
the information updating unit is used for updating the path resource information in the transmission time slot according to the reply information;
wherein, the occupation states of the sub-paths included in the feasible routing path all indicate idle.
9. A control apparatus, characterized by comprising:
one or more processors;
storage means for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the routing path determination method of any of claims 1-6.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out a method for determining a routing path according to any one of claims 1 to 6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010820916.7A CN112003787B (en) | 2020-08-14 | 2020-08-14 | Routing path determining method, device, control equipment and storage medium |
| PCT/CN2021/112591 WO2022033587A1 (en) | 2020-08-14 | 2021-08-13 | Path planning method and apparatus, electronic device, and readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010820916.7A CN112003787B (en) | 2020-08-14 | 2020-08-14 | Routing path determining method, device, control equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112003787A true CN112003787A (en) | 2020-11-27 |
| CN112003787B CN112003787B (en) | 2022-09-09 |
Family
ID=73472422
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010820916.7A Active CN112003787B (en) | 2020-08-14 | 2020-08-14 | Routing path determining method, device, control equipment and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112003787B (en) |
| WO (1) | WO2022033587A1 (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113111029A (en) * | 2021-04-14 | 2021-07-13 | 北京希姆计算科技有限公司 | Method, chip and storage medium for determining data transmission path |
| CN113141305A (en) * | 2021-05-31 | 2021-07-20 | 深圳华云信息系统有限公司 | Communication method, communication device, electronic equipment and computer-readable storage medium |
| WO2022033587A1 (en) * | 2020-08-14 | 2022-02-17 | 北京灵汐科技有限公司 | Path planning method and apparatus, electronic device, and readable medium |
| WO2022143020A1 (en) * | 2020-12-31 | 2022-07-07 | Oppo广东移动通信有限公司 | Chip and control method therefor, and computer-readable storage medium and electronic device |
| WO2022184008A1 (en) * | 2021-03-01 | 2022-09-09 | 北京灵汐科技有限公司 | Many-core route mapping method and apparatus, device and medium |
| CN115250251A (en) * | 2021-04-26 | 2022-10-28 | 北京希姆计算科技有限公司 | Transmission path planning method and device in network-on-chip simulation, electronic equipment and computer-readable storage medium |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114612049B (en) * | 2022-05-11 | 2022-08-05 | 弥费实业(上海)有限公司 | Path generation method and device, computer equipment and storage medium |
| CN115883447B (en) * | 2023-02-06 | 2023-07-18 | 极芯通讯技术(南京)有限公司 | Method and system for transmitting data on temporary circuit based on packet route establishment |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101035013A (en) * | 2006-03-08 | 2007-09-12 | 中兴通讯股份有限公司 | Resource receiving control method and system |
| CN101227248A (en) * | 2008-01-29 | 2008-07-23 | 中兴通讯股份有限公司 | Method for establishing business path |
| JP2009246500A (en) * | 2008-03-28 | 2009-10-22 | Fujitsu Ltd | Route simulation method and route simulation system in ip network |
| US7639663B1 (en) * | 2005-03-04 | 2009-12-29 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for dynamic channel access within wireless networks |
| CN101895931A (en) * | 2009-05-20 | 2010-11-24 | 中国科学院沈阳自动化研究所 | Searching and balance idea based industrial wireless network communication resource distributing method |
| CN103052127A (en) * | 2012-12-28 | 2013-04-17 | 浙江中控技术股份有限公司 | Dispatching communication method and device in industrial wireless sensing network |
| US20170273002A1 (en) * | 2014-12-03 | 2017-09-21 | Convida Wireless, Llc | Efficient hybrid resource and schedule management in time slotted channel hopping networks |
| CN107395503A (en) * | 2017-08-25 | 2017-11-24 | 东南大学 | A kind of network-on-chip method for routing based on linear programming |
| CN107846706A (en) * | 2017-12-14 | 2018-03-27 | 重庆邮电大学 | A kind of coding cognitive radio mesh network multipaths footpath method for routing of Congestion Avoidance |
| CN110178410A (en) * | 2017-12-21 | 2019-08-27 | 华为技术有限公司 | A kind of communication path determines method and the network equipment |
| CN110875886A (en) * | 2018-08-31 | 2020-03-10 | 阿里巴巴集团控股有限公司 | Data transmission method, device and system for transmission network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPWO2010104033A1 (en) * | 2009-03-09 | 2012-09-13 | 日本電気株式会社 | Inter-processor communication system and communication method, network switch, and parallel computing system |
| CN112003787B (en) * | 2020-08-14 | 2022-09-09 | 北京灵汐科技有限公司 | Routing path determining method, device, control equipment and storage medium |
-
2020
- 2020-08-14 CN CN202010820916.7A patent/CN112003787B/en active Active
-
2021
- 2021-08-13 WO PCT/CN2021/112591 patent/WO2022033587A1/en active Application Filing
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7639663B1 (en) * | 2005-03-04 | 2009-12-29 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for dynamic channel access within wireless networks |
| CN101035013A (en) * | 2006-03-08 | 2007-09-12 | 中兴通讯股份有限公司 | Resource receiving control method and system |
| CN101227248A (en) * | 2008-01-29 | 2008-07-23 | 中兴通讯股份有限公司 | Method for establishing business path |
| JP2009246500A (en) * | 2008-03-28 | 2009-10-22 | Fujitsu Ltd | Route simulation method and route simulation system in ip network |
| CN101895931A (en) * | 2009-05-20 | 2010-11-24 | 中国科学院沈阳自动化研究所 | Searching and balance idea based industrial wireless network communication resource distributing method |
| CN103052127A (en) * | 2012-12-28 | 2013-04-17 | 浙江中控技术股份有限公司 | Dispatching communication method and device in industrial wireless sensing network |
| US20170273002A1 (en) * | 2014-12-03 | 2017-09-21 | Convida Wireless, Llc | Efficient hybrid resource and schedule management in time slotted channel hopping networks |
| CN107395503A (en) * | 2017-08-25 | 2017-11-24 | 东南大学 | A kind of network-on-chip method for routing based on linear programming |
| CN107846706A (en) * | 2017-12-14 | 2018-03-27 | 重庆邮电大学 | A kind of coding cognitive radio mesh network multipaths footpath method for routing of Congestion Avoidance |
| CN110178410A (en) * | 2017-12-21 | 2019-08-27 | 华为技术有限公司 | A kind of communication path determines method and the network equipment |
| CN110875886A (en) * | 2018-08-31 | 2020-03-10 | 阿里巴巴集团控股有限公司 | Data transmission method, device and system for transmission network |
Non-Patent Citations (2)
| Title |
|---|
| 郑相全等: "双向路径重选的自组网负载均衡路由协议", 《计算机研究与发展》 * |
| 黄启嵩等: "无线网状网中多并发流路由结合调度的组合方案", 《华南师范大学学报(自然科学版)》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022033587A1 (en) * | 2020-08-14 | 2022-02-17 | 北京灵汐科技有限公司 | Path planning method and apparatus, electronic device, and readable medium |
| WO2022143020A1 (en) * | 2020-12-31 | 2022-07-07 | Oppo广东移动通信有限公司 | Chip and control method therefor, and computer-readable storage medium and electronic device |
| WO2022184008A1 (en) * | 2021-03-01 | 2022-09-09 | 北京灵汐科技有限公司 | Many-core route mapping method and apparatus, device and medium |
| CN113111029A (en) * | 2021-04-14 | 2021-07-13 | 北京希姆计算科技有限公司 | Method, chip and storage medium for determining data transmission path |
| CN113111029B (en) * | 2021-04-14 | 2024-03-26 | 广州希姆半导体科技有限公司 | Method, chip and storage medium for determining data transmission path |
| CN115250251A (en) * | 2021-04-26 | 2022-10-28 | 北京希姆计算科技有限公司 | Transmission path planning method and device in network-on-chip simulation, electronic equipment and computer-readable storage medium |
| CN115250251B (en) * | 2021-04-26 | 2023-07-28 | 北京希姆计算科技有限公司 | Transmission path planning method and device in network-on-chip simulation, electronic equipment and computer readable storage medium |
| CN113141305A (en) * | 2021-05-31 | 2021-07-20 | 深圳华云信息系统有限公司 | Communication method, communication device, electronic equipment and computer-readable storage medium |
| CN113141305B (en) * | 2021-05-31 | 2021-11-23 | 深圳华云信息系统有限公司 | Communication method, communication device, electronic equipment and computer-readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2022033587A1 (en) | 2022-02-17 |
| CN112003787B (en) | 2022-09-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112003787B (en) | Routing path determining method, device, control equipment and storage medium | |
| CN109981765B (en) | Method and apparatus for determining access path of content distribution network | |
| JP2793467B2 (en) | Apparatus and method for selecting an optimal route for a packet communication system | |
| US9853906B2 (en) | Network prioritization based on node-level attributes | |
| JPWO2011148583A1 (en) | Bus control device and control device for outputting instructions to bus control device | |
| JP4421978B2 (en) | Delay guarantee path setting system | |
| EP2993842A1 (en) | Search for disjoint paths through a network | |
| CN112491983A (en) | Intelligent contract scheduling method, device, equipment and storage medium based on block chain | |
| CN111382115B (en) | Path creating method and device for network on chip and electronic equipment | |
| CN115208815A (en) | Routing method and routing device | |
| Oh et al. | RT-SDN: adaptive routing and priority ordering for software-defined real-time networking | |
| CN114500354A (en) | Switch control method, device, control equipment and storage medium | |
| CN105814850B (en) | Route method, node and the communication system of data packet | |
| EP3063969B1 (en) | System and method for traffic engineering using link buffer status | |
| CN113852554B (en) | Data transmission method, device and equipment | |
| JP2002359634A (en) | Method and device for designing communication path and program | |
| CN114422453B (en) | Method, device and storage medium for online planning of time-sensitive stream | |
| CN112804162B (en) | Scheduling method, scheduling device, terminal equipment and storage medium | |
| US20230275807A1 (en) | Data processing method and device | |
| CN114996199A (en) | Many-core route mapping method, device, equipment and medium | |
| CN114079634A (en) | Message forwarding method and device and computer readable storage medium | |
| CN112437021B (en) | Routing control method, device, routing equipment and storage medium | |
| US10165468B2 (en) | Method for authorising transmission requests | |
| CN112929283B (en) | Data processing method, device, equipment and storage medium | |
| CN111796950B (en) | Data processing method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |