CN110493137A - A kind of Tiered broadcast method, apparatus and system based on fixed route network - Google Patents
A kind of Tiered broadcast method, apparatus and system based on fixed route network Download PDFInfo
- Publication number
- CN110493137A CN110493137A CN201910866501.0A CN201910866501A CN110493137A CN 110493137 A CN110493137 A CN 110493137A CN 201910866501 A CN201910866501 A CN 201910866501A CN 110493137 A CN110493137 A CN 110493137A
- Authority
- CN
- China
- Prior art keywords
- node
- hop
- data packet
- routing table
- hop count
- 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.)
- Pending
Links
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/04—Interdomain routing, e.g. hierarchical routing
-
- 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/16—Multipoint routing
-
- 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/20—Hop count for routing purposes, e.g. TTL
-
- 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
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
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 kind of Tiered broadcast method, apparatus, system and computer readable storage mediums based on fixed route network, the data packet sent including receiving a upper node layer, and obtain the hop count of the source node identification in data packet and corresponding source node to present node；Corresponding each next-hop node is determined from routing table corresponding with present node according to hop count and source node；Wherein, it pre-establishes and the corresponding routing table of each node in fixed route network, routing table include multiple node groups and with each corresponding routing iinformation of node group, node group includes source node and destination node, and routing iinformation includes the hop count of next-hop node corresponding with own node and source node to own node；Hop count in data packet is carried out plus a processing obtains new data packet, new data packet is sent to each next-hop node respectively；Broadcast hop count and the occupancy to network bandwidth and critical link can be reduced, the overall performance of network is improved.
Description
Technical field
The present embodiments relate to fields of communication technology, more particularly to a kind of Tiered broadcast based on fixed route network
Method, apparatus and system.
Background technique
With the development of chip technology and the continuous promotion of application scenarios complexity, taken with the chip of different function and characteristic
The application scenarios such as interference networks or distributed system are built, all more stringent requirements are proposed to chip interference networks, how from each
The efficiency of a angle improve data transfer reduces the waste to network bandwidth, is the pass for improving entire chip interference networks performance
Key.
For fixed route network, fixed route network can safeguard a complete routing table in a network, distribution
There are in each network node, routing table information can be fixed always on ground, can also be reconfigured according to demand.Different scenes lower network
The utilization efficiency of bandwidth and deadlock can be avoided all to be determined by the design of routing table, such mode network less big in scale
In be it is most suitable, can guarantee overall performance and flexibility, still, once network is too big, the complexity of routing table be will cause greatly
Amount calculates and the occupancy of storage resource.
The traditionally broadcast data packet in network is easiest to optimization in tree network or star network, because of section
There is specific upstream-downstream relationship between point, such as in tree network, the broadcast for child node can be controlled by father node, without
With the message sent from the source node of broadcast data to each node.And in the network of fixed route, broadcast take be all
The mode of data is individually sent from source node to other each nodes, it is clear that identical data the shortcomings that the broadcast mode
It sends repeatedly, to occupy that same communication link is multiple, and number of nodes is more, same communication link is multiplexed in whole routing table
Must be more, the waste of network bandwidth is just more obvious, and data transmission efficiency is lower.
In consideration of it, how to provide it is a kind of solve above-mentioned technical problem the Tiered broadcast method based on fixed route network,
Device, system and computer readable storage medium become the current problem to be solved of those skilled in the art.
Summary of the invention
The purpose of the embodiment of the present invention is that providing a kind of Tiered broadcast method, apparatus, system based on fixed route network
And computer readable storage medium, it can be reduced under the premise of guaranteeing that all nodes all receive data in use
Hop count and broadcast data are broadcasted to the occupancy of overall network bandwidth and critical link, is conducive to the globality for improving network
Energy.
In order to solve the above technical problems, the embodiment of the invention provides a kind of Tiered broadcast sides based on fixed route network
Method, comprising:
The data packet that a upper node layer is sent is received, and obtains the source node identification in the data packet and corresponding source section
It puts to the hop count of present node；
It is determined from routing table corresponding with the present node according to the hop count and the source node corresponding each
A next-hop node；Wherein, it pre-establishes and the corresponding routing table of each node in fixed route network, the routing
Table include multiple node groups and with each corresponding routing iinformation of node group, the node group includes source node and mesh
Node is marked, the routing iinformation includes the jump of next-hop node corresponding with own node and source node to the own node
Number；
Hop count in the data packet is carried out plus a processing obtains new data packet, respectively sends out the new data packet
It send to each next-hop node.
Optionally, described to be determined from routing table corresponding with the present node according to the hop count and the source node
The process of corresponding each next-hop node out are as follows:
Routing table corresponding with the present node is determined from each routing table；
It is matched and the source from routing table corresponding with the present node according to the hop count and the source node
The corresponding each target routing iinformation of node；
Each next-hop corresponding with the hop count is filtered out from each target routing iinformation according to the hop count
Node.
Optionally, the routing table includes N × N number of node group, and the N × N number of node group is arranged according to N N matrix, institute
Stating N is the node total number amount in the fixed route network.
It optionally, further include current target node in the data packet；
The sending module, specifically for respectively by the current target node in the new data packet be revised as it is each under
One hop node, and each modified new data packet is respectively sent to corresponding next-hop node.
The embodiment of the invention provides a kind of Tiered broadcast devices based on fixed route network, comprising:
Receiving module, the data packet sent for receiving a upper node layer, and obtain the letter of the source node in the data packet
Cease the hop count with corresponding source node to present node；
Determining module, for true from routing table corresponding with the present node according to the hop count and the source node
Make corresponding each next-hop node；Wherein, it pre-establishes and the corresponding road of each node in fixed route network
By table, the routing table include multiple node groups and with each corresponding routing iinformation of node group, the node group
Including source node and destination node, the routing iinformation includes next-hop node corresponding with own node and source node to institute
State the hop count of own node；
Sending module adds a processing to obtain new data packet, respectively by institute for carrying out the hop count in the data packet
It states new data packet and is sent to each next-hop node.
Optionally, the determining module includes:
Determination unit, for determining routing table corresponding with the present node from each routing table；
Matching unit, for according to the hop count and the source node from routing table corresponding with the present node
Allot each target routing iinformation corresponding with the source node；
Screening unit, it is corresponding with the hop count for being filtered out from each target routing iinformation according to the hop count
Each next-hop node.
It optionally, further include current target node in the data packet；
The sending module, specifically for respectively by the current target node in the new data packet be revised as it is each under
One hop node, and each modified new data packet is respectively sent to corresponding next-hop node.
The embodiment of the invention also provides a kind of Tiered broadcast systems based on fixed route network, comprising:
Memory, for storing computer program；
Processor realizes that the layering as described above based on fixed route network is wide when for executing the computer program
The step of broadcasting method.
The embodiment of the invention also provides a kind of computer readable storage medium, deposited on the computer readable storage medium
Computer program is contained, the computer program realizes point as described above based on fixed route network when being executed by processor
The step of layer broadcast.
The embodiment of the invention provides a kind of Tiered broadcast method, apparatus, system and calculating based on fixed route network
Machine readable storage medium storing program for executing, this method by pre-establish with the corresponding routing table of each node in fixed route network,
And routing table include multiple node groups and with each corresponding routing iinformation of node group, wherein node group include source section
Point and destination node, routing iinformation include the jump of next-hop node corresponding with own node and source node to own node
Number；Then after the data packet that present node receives that a upper node layer is sent, can be believed according to the source node in the data packet
Breath and source node further obtain routing table corresponding with present node, so to the hop count of present node from each routing table
Afterwards further according to hop count and source node from and the corresponding routing table of present node in determine it is corresponding with the present node it is each under
One hop node, present node by the hop count in data packet carry out plus a processing after new data packet is respectively sent to it is each next
Hop node.The application can reduce broadcast forwarding under the premise of guaranteeing that all nodes all receive data in use
Number and broadcast data are conducive to the overall performance for improving network to the occupancy of overall network bandwidth and critical link.
Detailed description of the invention
It to describe the technical solutions in the embodiments of the present invention more clearly, below will be to institute in the prior art and embodiment
Attached drawing to be used is needed to be briefly described, it should be apparent that, the accompanying drawings in the following description is only some implementations of the invention
Example, for those of ordinary skill in the art, without creative efforts, can also obtain according to these attached drawings
Obtain other attached drawings.
Fig. 1 is a kind of process signal of Tiered broadcast method based on fixed route network provided in an embodiment of the present invention
Figure；
Fig. 2 is a kind of fixed route network diagram provided in an embodiment of the present invention；
Fig. 3 is a kind of structural representation of the Tiered broadcast device based on fixed route network provided in an embodiment of the present invention
Figure.
Specific embodiment
The embodiment of the invention provides a kind of Tiered broadcast method, apparatus, system and calculating based on fixed route network
Machine readable storage medium storing program for executing can reduce broadcast and turn under the premise of guaranteeing that all nodes all receive data in use
Number and broadcast data are sent out to the occupancy of overall network bandwidth and critical link, is conducive to the overall performance for improving network.
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without making creative work, shall fall within the protection scope of the present invention.
Fig. 1 is please referred to, Fig. 1 is a kind of Tiered broadcast method based on fixed route network provided in an embodiment of the present invention
Flow diagram.This method comprises:
It should be noted that by carrying out layered shaping to each node in fixed route network in the application, and adopt
The number of plies locating for present node is indicated relative to the hop count of source node with present node, specifically, in fixed route network
Each node, can pre-establish with the one-to-one routing table of each node, routing table be for corresponding node establish
, each routing table stores routing iinformation relevant to own node, wherein by taking a routing table as an example, wraps in the routing table
Include multiple node groups and with each corresponding routing iinformation of node group, wherein each node group includes a source node
With a corresponding destination node and routing iinformation corresponding with the source node and destination node, wherein the routing iinformation packet
Next-hop node corresponding with own node is included and from source node to the hop count of own node, specifically, the next-hop node
Refer to the next-hop node for needing to pass through when leading to destination node from own node.For example, fixed route net as shown in Figure 2
Include 5 nodes in network, respectively A, B, C, D and E, if then present node is B, source node A, destination node E, then with this
Source node A and the corresponding next-hop node of destination node E are C, and the hop count of source node A to own node B is 1.
Specifically, altogether including N number of node, then its corresponding road for each node in such as fixed network routing
It by including altogether N × N group node group in table, and records and checks for convenience, N × N number of node group can be made according to N × N
The form of matrix is arranged, such as fixed route network shown in Fig. 2, N=5, and foundation is corresponding with node B by taking node B as an example
Routing table, the routing table is as shown in table 1:
Table 1
It wherein, is corresponding routing iinformation with one group of source node and the corresponding element of destination node in table 1, namely and itself
The corresponding next-hop node of node B and source node to own node B hop count, by the visible one group of source node of table and destination node
Corresponding one group of routing iinformation.
Certainly, each group node group information in practical applications in routing table be not limited only to be in using aforesaid way
It is existing, it can also be presented in the form of list, can be specifically determined according to actual needs, the present embodiment does not do special limit
It is fixed.
S110: the data packet that a upper node layer is sent is received, and obtains the source node identification in data packet and corresponding source
Node to present node hop count；
Specifically, even higher level of node can send data packets to corresponding next-hop section according to corresponding routing table
Point, then for being currently received the present node of data packet of even higher level of node transmission, present node is receiving upper one
The jump of source node identification in the data packet and corresponding source node to present node can be obtained after the data packet that grade node is sent
Number, wherein when a upper node layer is to node for data forwarding packet next time, the hop count of its inside is updated, so as to next
Hop node is that can be apparent from which layer own node is in receiving data packet.
S120: corresponding each next-hop is determined from routing table corresponding with present node according to hop count and source node
Node；Wherein, pre-establish with the corresponding routing table of each node in fixed route network, routing table includes multiple sections
Point group and with each corresponding routing iinformation of node group, node group includes source node and destination node, and routing iinformation includes
Next-hop node corresponding with own node and source node to own node hop count；
It is understood that can according to present node from determined in each routing table for first establishing and present node
Corresponding routing table, then after determining hop count of the corresponding source node to present node, further according to source node to working as prosthomere
The hop count and corresponding source node of point from and the corresponding routing table of present node in match each target corresponding with source node
Routing iinformation；Each next-hop node corresponding with hop count is filtered out from each target routing iinformation according to hop count.
Such as fixed network routing shown in Fig. 2, after the data packet that Node-B receiver is sent to a upper node layer, from this
The hop count of the source node identification and source node to the current node B that obtain in data packet is respectively C and 1, then illustrates that source node is C,
Source node C to current node B hop count be 1 namely current node B relative to source node C be in the 1st layer, therefore can from
List item corresponding with source node C and hop count 1, respectively (A, 1) and (D, 1) are found in the corresponding routing table 1 of current node B,
The next-hop node that can then determine the current node B is respectively A and D.
In another example node B is source node, then for current node B, source node is exactly own node, so source is saved
The hop count of point to own node is 0, so can determine that and source node B and jump according to routing table corresponding with current node B
The corresponding list item of number 0, respectively (A, 0), (C, 0) and (D, 0), then can determine next-hop section corresponding with the current node B
Point is A, C and D.
S130: the hop count in data packet is carried out plus a processing obtains new data packet, respectively sends new data packet
To each next-hop node.
Specifically, present node will be in the data packet after determining each next-hop node corresponding with present node
Hop count process add a update after, new data packet is respectively sent to each next-hop node, so as to each next-hop node
After the data packet received, according to source node identification and corresponding hop count in data packet and corresponding with each node itself
Routing table determines corresponding next-hop node again, to be forwarded again to data, until this receives data packet
Node determines that it is the last layer after searching oneself routing table, not corresponding next-hop node, then data broadcasting
It completes.
It further, further include current target node in data packet；
New data packet is sent to the process of each next-hop node respectively are as follows:
The current target node in new data packet is revised as each next-hop node respectively, and will be each modified
New data packet is respectively sent to corresponding next-hop node.
It should be noted that data packet in the present embodiment is in addition to including source node identification and corresponding source node to current
It can also include that current target node namely a upper node layer send data packets to present node, then except the hop count of node
Current target node in data packet transmitted by a upper node layer is exactly present node, for example, node A is sent data packets to
Node B, then the current target node in the data packet is exactly node B, and node B is when forwarding the packet to node C and D, section
Point B needs the current target node in data packet being updated to node C, and the new data packet is then sent to node C, node
Current target node in data packet is updated to node D again by B, and the new data packet is then sent to node D.
It should also be noted that, be illustrated by taking simple fixed route network shown in Fig. 2 as an example in the application,
That is, the only paths between any two node, as long as the hop count to present node is also determined so source node has been determined
It is fixed, and real network is certainly more complicated, often there is mulitpath between two nodes, is establishing road corresponding with node
When by table, a wherein paths can be provided according to the actual situation, different according to destination node in a particular application, routing road
Diameter is different, and the hop count of same source node to present node also can be different, but this does not influence broadcast processing mode of the invention.Specifically
, because all nodes in fixed route network can be all included among some level in an implementation, namely relative to source
Node has fixed hop count, and in addition to source node (level 0), in the case where source node and destination node determine, each level
Node have and a hierarchy node on only one, while having 0 or multiple next hierarchy node.
That is, can be established according to the actual situation when establishing corresponding routing table to each node, every two
Suitable path is selected between a node, after the completion of routing table is established, using the data broadcasting mechanism provided in the present embodiment
The forwarding to data packet can be realized.That is, after determining source node and destination node, for broadcast, entirely
The topological structure of network logically becomes a tree network (different source nodes and the corresponding logic generated of destination node
On tree network be different), and broadcast data is that affiliated next hierarchy node is sent to by present node always, in this way
Under the premise of guaranteeing that all nodes can receive broadcast data, the hop count of broadcast data is preferably minimized.
As it can be seen that the present embodiment can be by pre-establishing and the corresponding routing of each node in fixed route network
Table, and routing table include multiple node groups and with each corresponding routing iinformation of node group, wherein node group includes source
Node and destination node, routing iinformation include the jump of next-hop node corresponding with own node and source node to own node
Number；Then after the data packet that present node receives that a upper node layer is sent, can be believed according to the source node in the data packet
Breath and source node further obtain routing table corresponding with present node, so to the hop count of present node from each routing table
Afterwards further according to hop count and source node from and the corresponding routing table of present node in determine it is corresponding with the present node it is each under
One hop node, present node by the hop count in data packet carry out plus a processing after new data packet is respectively sent to it is each next
Hop node.The application can reduce broadcast forwarding under the premise of guaranteeing that all nodes all receive data in use
Number and broadcast data are conducive to the overall performance for improving network to the occupancy of overall network bandwidth and critical link.
On the basis of the above embodiments, the embodiment of the invention provides a kind of Tiered broadcasts based on fixed route network
Device, specifically referring to figure 2., which includes:
Receiving module 21, the data packet sent for receiving a upper node layer, and obtain the source node identification in data packet
With the hop count of corresponding source node to present node；
Determining module 22, it is corresponding for being determined from routing table corresponding with present node according to hop count and source node
Each next-hop node；Wherein, it pre-establishes and the corresponding routing table of each node in fixed route network, routing table
Including multiple node groups and with each corresponding routing iinformation of node group, node group includes source node and destination node, road
It include the hop count of next-hop node corresponding with own node and source node to own node by information；
Sending module 23 adds a processing to obtain new data packet for carrying out the hop count in data packet, respectively will be new
Data packet is sent to each next-hop node.
Further, above-mentioned determining module 22 includes:
Determination unit, for determining routing table corresponding with present node from each routing table；
Matching unit, for according to hop count and source node is matched from routing table corresponding with present node and source node
Corresponding each target routing iinformation；
Screening unit, for filtering out each next-hop corresponding with hop count from each target routing iinformation according to hop count
Node.
It further, further include current target node in data packet；
Sending module, specifically for the current target node in new data packet is revised as each next-hop section respectively
Point, and each modified new data packet is respectively sent to corresponding next-hop node.
It should be noted that based on the Tiered broadcast device of fixed route network in use process provided in the application
In can reduce broadcast hop count and broadcast data to overall network under the premise of guaranteeing that all nodes all receive data
The occupancy of bandwidth and critical link is conducive to the overall performance for improving network.In addition, to involved in this present embodiment
The specific introduction of Tiered broadcast method based on fixed route network please refers to above-described embodiment, and details are not described herein by the application.
On the basis of the above embodiments, the embodiment of the invention also provides a kind of layering based on fixed route network is wide
System is broadcast, which includes:
Memory, for storing computer program；
Processor is realized when for executing computer program such as the above-mentioned Tiered broadcast method based on fixed route network
Step.
For example, the data packet that the processor in the present embodiment sends for realizing the upper node layer of reception, and obtain data
Source node identification and corresponding source node in packet to present node hop count；According to hop count and source node from present node pair
Corresponding each next-hop node is determined in the routing table answered；Wherein, it pre-establishes and each section in fixed route network
The corresponding routing table of point, routing table include multiple node groups and with each corresponding routing iinformation of node group, node
Group includes source node and destination node, routing iinformation include next-hop node corresponding with own node and source node to itself
The hop count of node；Hop count in data packet is carried out plus a processing obtains new data packet, is respectively sent to new data packet
Each next-hop node.
On the basis of the above embodiments, the embodiment of the invention also provides a kind of computer readable storage mediums, calculate
It is stored with computer program on machine readable storage medium storing program for executing, is realized when computer program is executed by processor as above-mentioned based on fixed road
By network Tiered broadcast the step of.
The computer readable storage medium may include: USB flash disk, mobile hard disk, read-only memory (Read-Only
Memory, ROM), random access memory (Random Access Memory, RAM), magnetic or disk etc. is various to deposit
Store up the medium of program code.
Each embodiment in this specification is described in a progressive manner, the highlights of each of the examples are with other
The difference of embodiment, the same or similar parts in each embodiment may refer to each other.For device disclosed in embodiment
For, since it is corresponded to the methods disclosed in the examples, so being described relatively simple, related place is said referring to method part
It is bright.
It should also be noted that, in the present specification, relational terms such as first and second and the like be used merely to by
One entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or operation
Between there are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant meaning
Covering non-exclusive inclusion, so that the process, method, article or equipment for including a series of elements not only includes that
A little elements, but also including other elements that are not explicitly listed, or further include for this process, method, article or
The intrinsic element of equipment.In the absence of more restrictions, the element limited by sentence "including a ...", is not arranged
Except there is also other identical elements in the process, method, article or apparatus that includes the element.
The foregoing description of the disclosed embodiments enables those skilled in the art to implement or use the present invention.
Various modifications to these embodiments will be readily apparent to those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, of the invention
It is not intended to be limited to the embodiments shown herein, and is to fit to and the principles and novel features disclosed herein phase one
The widest scope of cause.
Claims (9)
1. a kind of Tiered broadcast method based on fixed route network characterized by comprising
The data packet that a upper node layer is sent is received, and obtains the source node identification in the data packet and corresponding source node extremely
The hop count of present node；
According to the hop count and the source node from determined in routing table corresponding with the present node it is corresponding it is each under
One hop node；Wherein, it pre-establishes and the corresponding routing table of each node in fixed route network, the routing table packet
Include multiple node groups and with each corresponding routing iinformation of node group, the node group includes source node and target section
Point, the routing iinformation include the hop count of next-hop node corresponding with own node and source node to the own node；
Hop count in the data packet is carried out plus a processing obtains new data packet, is respectively sent to the new data packet
Each next-hop node.
2. the Tiered broadcast method according to claim 1 based on fixed route network, which is characterized in that described according to institute
It states hop count and the source node and determines corresponding each next-hop node from routing table corresponding with the present node
Process are as follows:
Routing table corresponding with the present node is determined from each routing table；
It is matched and the source node from routing table corresponding with the present node according to the hop count and the source node
Corresponding each target routing iinformation；
Each next-hop node corresponding with the hop count is filtered out from each target routing iinformation according to the hop count.
3. the Tiered broadcast method according to claim 1 based on fixed route network, which is characterized in that the routing table
Including N × N number of node group, the N × N number of node group is arranged according to N N matrix, and the N is in the fixed route network
Node total number amount.
4. the Tiered broadcast method according to claim 1 based on fixed route network, which is characterized in that the data packet
In further include current target node；
The process that the new data packet is sent to each next-hop node respectively are as follows:
The current target node in the new data packet is revised as each next-hop node respectively, and will be each modified
New data packet is respectively sent to corresponding next-hop node.
5. a kind of Tiered broadcast device based on fixed route network characterized by comprising
Receiving module, the data packet sent for receiving a upper node layer, and obtain the source node identification in the data packet and
Corresponding source node to present node hop count；
Determining module, for being determined from routing table corresponding with the present node according to the hop count and the source node
Corresponding each next-hop node；Wherein, pre-establish with the corresponding routing table of each node in fixed route network,
The routing table include multiple node groups and with each corresponding routing iinformation of node group, the node group includes source
Node and destination node, the routing iinformation include next-hop node corresponding with own node and source node to it is described itself
The hop count of node；
Sending module adds a processing to obtain new data packet for carrying out the hop count in the data packet, respectively will be described new
Data packet be sent to each next-hop node.
6. the Tiered broadcast device according to claim 5 based on fixed route network, which is characterized in that the determining mould
Block includes:
Determination unit, for determining routing table corresponding with the present node from each routing table；
Matching unit, for being matched from routing table corresponding with the present node according to the hop count and the source node
Each target routing iinformation corresponding with the source node；
Screening unit, it is corresponding with the hop count each for being filtered out from each target routing iinformation according to the hop count
A next-hop node.
7. the Tiered broadcast device according to claim 5 based on fixed route network, which is characterized in that the data packet
In further include current target node；
The sending module, specifically for the current target node in the new data packet is revised as each next-hop respectively
Node, and each modified new data packet is respectively sent to corresponding next-hop node.
8. a kind of Tiered broadcast system based on fixed route network characterized by comprising
Memory, for storing computer program；
Processor is realized when for executing the computer program and is based on fixed route as described in Claims 1-4 any one
The step of Tiered broadcast method of network.
9. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program is realized when the computer program is executed by processor and is based on fixed route net as described in Claims 1-4 any one
The step of Tiered broadcast of network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910866501.0A CN110493137A (en) | 2019-09-12 | 2019-09-12 | A kind of Tiered broadcast method, apparatus and system based on fixed route network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910866501.0A CN110493137A (en) | 2019-09-12 | 2019-09-12 | A kind of Tiered broadcast method, apparatus and system based on fixed route network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110493137A true CN110493137A (en) | 2019-11-22 |
Family
ID=68557796
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910866501.0A Pending CN110493137A (en) | 2019-09-12 | 2019-09-12 | A kind of Tiered broadcast method, apparatus and system based on fixed route network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110493137A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113411257A (en) * | 2020-03-16 | 2021-09-17 | 华为技术有限公司 | Method, device, computing equipment and storage medium for transmitting message |
| CN113543022A (en) * | 2021-07-26 | 2021-10-22 | 广州慧睿思通科技股份有限公司 | Method and device for determining transmitting power, interphone, equipment and storage medium |
| CN114554566A (en) * | 2022-01-27 | 2022-05-27 | 哈尔滨海能达科技有限公司 | Routing method and device of wireless link, electronic equipment and storage medium |
| CN115412480A (en) * | 2022-09-01 | 2022-11-29 | 芯象半导体科技(北京)有限公司 | Communication method and electronic device |
| CN117155852A (en) * | 2023-10-30 | 2023-12-01 | 苏州元脑智能科技有限公司 | Routing method and device of broadcast message, computer equipment and storage medium |
| CN114554566B (en) * | 2022-01-27 | 2024-07-09 | 哈尔滨海能达科技有限公司 | Wireless link routing method, wireless link routing device, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101959279A (en) * | 2009-07-13 | 2011-01-26 | 华为技术有限公司 | Route establishing method and device, and data transmission method |
| CN102065480A (en) * | 2010-11-22 | 2011-05-18 | 北京邮电大学 | Path priority-based wireless sensor network congestion avoidance and control method |
| CN102404372A (en) * | 2010-09-16 | 2012-04-04 | 中国移动通信集团江苏有限公司 | Method, system and node device for storing content in WEB cache in distributed mode |
| US20130148544A1 (en) * | 2007-06-15 | 2013-06-13 | Silver Spring Networks, Inc. | Method and system for providing network and routing protocols for utility services |
| CN103532845A (en) * | 2013-10-17 | 2014-01-22 | 西北大学 | Routing protocol for intermittently connected wireless sensor network |
| CN103974365A (en) * | 2014-04-14 | 2014-08-06 | 河海大学 | Ad Hoc mobile network route restoring method |
-
2019
- 2019-09-12 CN CN201910866501.0A patent/CN110493137A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130148544A1 (en) * | 2007-06-15 | 2013-06-13 | Silver Spring Networks, Inc. | Method and system for providing network and routing protocols for utility services |
| CN101959279A (en) * | 2009-07-13 | 2011-01-26 | 华为技术有限公司 | Route establishing method and device, and data transmission method |
| CN102404372A (en) * | 2010-09-16 | 2012-04-04 | 中国移动通信集团江苏有限公司 | Method, system and node device for storing content in WEB cache in distributed mode |
| CN102065480A (en) * | 2010-11-22 | 2011-05-18 | 北京邮电大学 | Path priority-based wireless sensor network congestion avoidance and control method |
| CN103532845A (en) * | 2013-10-17 | 2014-01-22 | 西北大学 | Routing protocol for intermittently connected wireless sensor network |
| CN103974365A (en) * | 2014-04-14 | 2014-08-06 | 河海大学 | Ad Hoc mobile network route restoring method |
Non-Patent Citations (1)
| Title |
|---|
| 吴礼发: "《网络原理与技术教程》", 30 September 2002, 北京希望电子出版社 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113411257A (en) * | 2020-03-16 | 2021-09-17 | 华为技术有限公司 | Method, device, computing equipment and storage medium for transmitting message |
| CN113411257B (en) * | 2020-03-16 | 2022-10-18 | 华为技术有限公司 | Method, device, computing equipment and storage medium for transmitting message |
| CN113543022A (en) * | 2021-07-26 | 2021-10-22 | 广州慧睿思通科技股份有限公司 | Method and device for determining transmitting power, interphone, equipment and storage medium |
| CN114554566A (en) * | 2022-01-27 | 2022-05-27 | 哈尔滨海能达科技有限公司 | Routing method and device of wireless link, electronic equipment and storage medium |
| CN114554566B (en) * | 2022-01-27 | 2024-07-09 | 哈尔滨海能达科技有限公司 | Wireless link routing method, wireless link routing device, electronic equipment and storage medium |
| CN115412480A (en) * | 2022-09-01 | 2022-11-29 | 芯象半导体科技(北京)有限公司 | Communication method and electronic device |
| CN115412480B (en) * | 2022-09-01 | 2024-02-23 | 芯象半导体科技(北京)有限公司 | Communication method and electronic equipment |
| CN117155852A (en) * | 2023-10-30 | 2023-12-01 | 苏州元脑智能科技有限公司 | Routing method and device of broadcast message, computer equipment and storage medium |
| CN117155852B (en) * | 2023-10-30 | 2024-02-23 | 苏州元脑智能科技有限公司 | Routing method and device of broadcast message, computer equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110493137A (en) | A kind of Tiered broadcast method, apparatus and system based on fixed route network | |
| US5495479A (en) | Method and apparatus for an automatic decomposition of a network topology into a backbone and subareas | |
| CN103379032A (en) | Acquisition method and device for cross-domain end-to-end route and secondary route computation element | |
| CN114090244B (en) | Service arrangement method, device, system and storage medium | |
| CN102891800B (en) | Method, the node of being carried out by the node in multiple nodes and the system of knowing flooding information | |
| CN103117957A (en) | Cache management method based on numbers of message replications and comprehensive effectiveness in opportunistic network | |
| CN101222426B (en) | Method and system for network data trasmitting | |
| CN102882722A (en) | PTN (packet transport network) /IPRAN (internet protocol radio access network) end-to-end business data quick creation method | |
| JP2012217164A5 (en) | ||
| CN102546380B (en) | Modified tree-based multicast routing scheme | |
| CN105430598A (en) | Layered data transmission method and device of wireless sensor network | |
| CN104301226A (en) | Designated routing bridge (DRB) election method, equipment and system | |
| CN107018545A (en) | A kind of ad hoc network method being applied in wireless communication system | |
| CN102439920B (en) | Business cross-layer separation path computing method, device and communication system | |
| CN101296178A (en) | Inter-domain flux engineering route computing method and route computing device | |
| CN100534042C (en) | Two-stage distributed application layer multicasting method facing to MSVMT problem | |
| CN105072586A (en) | Management method for forwarding of broadcast message in embedded wireless ad hoc network | |
| CN104202247A (en) | Non-linear annealing based multi-constrained routing method for SDN (Software Defined Network) | |
| CN101662374B (en) | Broadcasting method for mobile ad hoc network | |
| US20200084065A1 (en) | Fractal tree structure-based data transmit device and method, control device, and intelligent chip | |
| CN102647424B (en) | Data transmission method and data transmission device | |
| CN106559490B (en) | A kind of management method for storage cluster equipment | |
| CN109041022A (en) | A kind of network management, bluetooth module, medium and computer | |
| CN201947293U (en) | Network, system and processor using multicast route based on tree | |
| CN114338702A (en) | Communication data forwarding method and unmanned system cluster |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191122 |