CN107682264A - Data transmission method and system based on real-time active path planning - Google Patents
Data transmission method and system based on real-time active path planning Download PDFInfo
- Publication number
- CN107682264A CN107682264A CN201710885042.1A CN201710885042A CN107682264A CN 107682264 A CN107682264 A CN 107682264A CN 201710885042 A CN201710885042 A CN 201710885042A CN 107682264 A CN107682264 A CN 107682264A
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- path
- information
- data
- 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
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/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- 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/22—Alternate 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/70—Routing based on monitoring results
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the present invention provides a kind of data transmission method and system based on real-time active path planning.Method includes：Start node timing or the routing information for obtaining data transfer from routing scheduling center on demand, start node is the starting point of data transfer, and routing information includes optimal path information and alternative path information；Start node creates the logical links of data transfer according to the routing information of acquisition, and transmission data and routing iinformation are packaged into data block, and destination node is sent to by the routing function of via node；Because routing scheduling center can receive the transmission link congestion information of the whole network, and instant optimal path and alternative path are issued accordingly to each node, the logical links that each node can transmit according to newest optimal path dynamic adjusting data, therefore, technical scheme provided in an embodiment of the present invention can evaluate network congestion situation from the angle of the overall situation, the accuracy and promptness of routing iinformation are improved, and then improves data transmission efficiency.
Description
Technical field
The present embodiments relate to communication technical field, more particularly to a kind of data based on real-time active path planning to pass
Transmission method and system.
Background technology
Shortest path first is common routing algorithm, and the algorithm is available for start node in determination network to terminal node
Shortest path.Software defined network (software defined network, SDN), be occur in recent years it is a kind of new
Transmission via net framework, is a kind of implementation of network virtualization, a kind of its core technology OpenFlow (new network interchange modes
Type) by the way that network equipment chain of command is separated with data surface, it is achieved thereby that the flexible control of network traffics, makees network
Become more intelligent for pipeline.
But the core of this technology needs the support of routing hardware, practicality can not be put into a short time.Therefore, it is each at present
Communication generally use between corporate server node is that TCP or other custom protocols are communicated, dependent on based on TCP/
The routing device that the operator of IP agreement race provides is route.And the routing algorithm of the routing device based on TCP/IP only base
It is adjusted in partial result, optimal path can not be considered from the overall situation, the delay that data may be caused to communicate.
The content of the invention
Embodiments of the invention provide a kind of data transmission method and system based on real-time active path planning, to from
Global angle evaluation network congestion situation, improves the accuracy and promptness of routing iinformation, and then improve data transmission efficiency.
To reach above-mentioned purpose, embodiments of the invention adopt the following technical scheme that：
In a first aspect, the embodiment of the present invention provides a kind of data transmission method based on real-time active path planning, including：
Start node timing or the routing information for obtaining data transfer from routing scheduling center on demand, the start node are
The starting point of data transfer, the routing information include optimal path information and alternative path information；
Start node creates the logical links of data transfer according to the routing information of acquisition；
Start node will transmit data and routing iinformation is packaged into data block, according to routing iinformation, be sent to next node,
The next node is via node or destination node, and the via node is to have routing function in data transfer path
Transit node, the destination node be data transfer terminal.
With reference in a first aspect, in the first possible implementation of first aspect, when data transfer path occur it is different
Chang Shi, start node to routing scheduling center by sending instant unexpected message, and from routing scheduling center, routing iinformation is worked as in acquisition,
And the information returned according to routing scheduling center is made to judge, the logic chain of current optimal path dynamic adjusting data transmission is selected
Road.
Second aspect, the embodiment of the present invention provide a kind of data transmission method based on real-time active path planning, including：
Via node receives the data block that adjacent node is sent, and the via node is to have road in data transfer path
By the transit node of function；
The logical link information that via node includes according to data block header, data block is delivered to next node.
With reference to second aspect, in the first possible implementation of second aspect, in addition to：
Link information between via node collector node, and routing scheduling center is reported, the link information includes phase
Round-trip delay RTT, the packet loss of adjacent internode, and the upstream and downstream bandwidth utilization rate of via node itself and load.
The third aspect, the embodiment of the present invention provide a kind of data transmission method based on real-time active path planning, including：
Routing scheduling is centrally through the link information between via node collector node；
Routing scheduling center is according to the link information between the node of collection, the routine weight value between weighted calculation node, and raw
Into the optimal path and alternative path of node-to-node；
The optimal path of node-to-node and alternative path are sent to each start node by the timing of routing scheduling center, or
Person sends current optimal path when receiving the instant unexpected message of node transmission to node.
Fourth aspect, the embodiment of the present invention provide a kind of data transmission system based on real-time active path planning, including：
Start node, via node and routing scheduling center, it is characterised in that the start node is used for timing or adjusted on demand from route
Degree center obtains the routing information of data transfer, and the start node is the starting point of data transfer, and the routing information is included most
Shortest path information and alternative path information；
The start node is additionally operable to the routing information according to acquisition, creates the logical links of data transfer；
The start node is additionally operable to transmission data and routing iinformation being packaged into data block, according to routing iinformation, sends
To next node, the next node is via node or destination node, and the via node is in data transfer path
Transit node with routing function, the destination node are the terminal of data transfer.
With reference to fourth aspect, in the first possible implementation of fourth aspect, when data transfer path generation is different
Chang Shi, the start node are additionally operable to, by sending instant unexpected message to routing scheduling center, obtain from routing scheduling center
Current optimal path information, and the logical links transmitted according to current optimal path dynamic adjusting data.
With reference to the possible implementation of the first of fourth aspect or fourth aspect, in second of possible implementation
In, the via node is used for the data block for receiving adjacent node transmission, and the via node is the tool in data transfer path
There is the transit node of routing function；
The via node is additionally operable to the logical link information included according to data block header, data block is delivered to next
Individual node.
Second with reference to the possible implementation of the first of fourth aspect or fourth aspect or fourth aspect is possible
Implementation, in the third possible implementation, the via node is additionally operable to the link information between collector node, and on
Routing scheduling center is offered, the link information includes round-trip delay RTT, the packet loss of adjacent internode, and via node is certainly
The upstream and downstream bandwidth utilization rate of body and load.
Second with reference to the possible implementation of the first of fourth aspect or fourth aspect or fourth aspect is possible
The possible implementation of the third of implementation or fourth aspect, in the 4th kind of possible implementation, the route is adjusted
Degree center is used to pass through the link information between via node collector node；
The routing scheduling center is additionally operable to the link information between the node according to collection, the path between weighted calculation node
Weights, and generate the optimal path and alternative path of node-to-node；
The routing scheduling center be additionally operable to timing the optimal path of node-to-node and alternative path are sent to it is each
Start node, or when receiving the instant unexpected message of node transmission, current optimal path is sent to node.
Technical scheme provided in an embodiment of the present invention, start node regularly or on demand obtain data biography from routing scheduling center
Defeated routing information, start node are the starting point of data transfer, and routing information includes optimal path information and alternative path information；
Start node creates the logical links of data transfer, and will transmit data and routing iinformation encapsulation according to the routing information of acquisition
Into data block, destination node is sent to by the routing function of via node；Because routing scheduling center can receive the transmission of the whole network
Link congestion information, and issue instant optimal path and alternative path accordingly to each node, each node can be according to newest optimal
The logical links of path dynamic adjusting data transmission, therefore, technical scheme provided in an embodiment of the present invention can be from the angles of the overall situation
Degree evaluation network congestion situation, improves the accuracy and promptness of routing iinformation, and then improves data transmission efficiency.
Brief description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be in embodiment or description of the prior art
The required accompanying drawing used is briefly described, it should be apparent that, drawings in the following description are only some realities of the present invention
Example is applied, for those of ordinary skill in the art, on the premise of not paying creative work, can also be according to these accompanying drawings
Obtain other accompanying drawings.
Fig. 1 is the data transmission network schematic diagram of the invention based on real-time active path planning；
Fig. 2 is the data transmission procedure schematic diagram of the invention based on real-time active path planning；
Fig. 3 A are the flow chart of the data transmission method embodiment one of the invention based on real-time active path planning；
Fig. 3 B are the flow chart of the data transmission method embodiment two of the invention based on real-time active path planning；
Fig. 3 C are the flow chart of the data transmission method embodiment three of the invention based on real-time active path planning；
Fig. 4 is the structural representation of the data transmission system provided in an embodiment of the present invention based on real-time active path planning
Figure.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is only part of the embodiment of the present invention, rather than whole embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other under the premise of creative work is not made
Embodiment, belong to the scope of protection of the invention.
Fig. 1 is the data transmission network schematic diagram of the invention based on real-time active path planning.With reference to shown in figure 1, this hair
The increased logical network of SDN of bright embodiment individually abstracts the unconcerned data transmission problems of business, by network
Feedback network congestion information calculates each node to routing scheduling center, routing scheduling center according to current network conditions in real time
The optimal path connected between egress, then each node being handed down in network.Based on this centralized network-feedback processing
Logic, network congestion situation is evaluated from the angle of the overall situation, the routing iinformation calculated will be more accurate and timely, with this
To control the indices of overall network data transfer.
Fig. 2 is the data transmission procedure schematic diagram of the invention based on real-time active path planning.With reference to shown in figure 2, logic
Transmission of the network based on data block, information on real-time collecting link simultaneously reports global Routing Service, for specifying terminal
A path in logic, and the routing infrastructure that can be issued according to global Routing Service can be set up, selects a reality
When the optimal logic transfer path of situation.
The node of logical network can be divided into two kinds according to role：Start-stop node and via node.
Start-stop node (End Node)：The beginning and end of data transmission is only used as, is regularly obtained from routing scheduling center
Current optimal path information, and data are transmitted using which paths according to the information decision.
Via node (Re lay Node)：The transit node being only used as in data path, when receiving packet according to head
The path that portion has planned is delivered to next node；In addition, be responsible for collector node between link information and report route adjust
Degree center.
Routing scheduling center (Route Center)：Routing scheduling collects the information of each link centrally through via node
And the optimal route of each start node is calculated, periodically it is handed down to each start node.
Fig. 3 A are the flow chart of the data transmission method embodiment one of the invention based on real-time active path planning.Such as Fig. 3 A
Shown, the method for the present embodiment can include herein below.
S101, start node timing or the routing information for obtaining data transfer from routing scheduling center on demand, start node
For the starting point of data transfer, routing information includes optimal path information and alternative path information.
The optimal path is the shortest path drawn by delay, packet loss etc., or is the applied field with operation layer
The adaptable path of scape.
S102, start node create the logical links of data transfer according to the routing information of acquisition.
Start node can enter Mobile state adjustment after creating transmission path according to current best link.
S103, start node will transmit data and routing iinformation is packaged into data block, according to routing iinformation, is sent to next
Node, next node are via node or destination node, and via node is to have routing function in data transfer path
Transit node, destination node are the terminal of data transfer.
Method as described above, wherein, when data transfer path occurs abnormal, start node passes through into routing scheduling
The heart sends instant unexpected message, obtains current optimal path information from routing scheduling center, and return according to routing scheduling center
Information make to judge, select the logical links of current optimal path dynamic adjusting data transmission.
The condition that abnormal judgement occurs for data transfer path is divided into a variety of situations, can be by start node or relaying
Node reports routing scheduling center or routing scheduling center judges according to newest routing iinformation.
Fig. 3 B are the flow chart of the data transmission method embodiment two of the invention based on real-time active path planning.Such as Fig. 3 B
Shown, the method for the present embodiment can include herein below.
S201, via node receive the data block that adjacent node is sent, and via node is having in data transfer path
The transit node of routing function.
The logical link information that S202, via node include according to data block header, data block is delivered to next section
Point.
Method as described above, in addition to：
Link information between via node collector node, and routing scheduling center is reported, link information includes adjacent segments
Between round-trip delay RTT, packet loss, and the upstream and downstream bandwidth utilization rate of via node itself and load.
, can also be by the link information between independent probe node collector node during concrete application, and can be with
Together with this kind of probe node and via node, start node, destination node deployment.Via node and probe node are to route
The information that control centre reports, in addition to the link information between node, influence internodal data transmission other can also be included
Key factor information.
Fig. 3 C are the flow chart of the data transmission method embodiment three of the invention based on real-time active path planning.Such as Fig. 3 C
Shown, the method for the present embodiment can include herein below.
S301, routing scheduling are centrally through the link information between via node collector node.
S302, routing scheduling center are according to the link information between the node of collection, the routine weight value between weighted calculation node,
And generate the optimal path and alternative path of node-to-node.
The optimal path of node-to-node and alternative path are sent to each starting and saved by S303, the timing of routing scheduling center
Point, or when receiving the instant unexpected message of node transmission, current optimal path is sent to node.
The generation of route, issue and include with the process of decision-making：
1) the via node moment detects adjacent node connection, and continues to count RTT (Round-Trip Time, when coming and going
Prolong), the information such as packet loss；
2) via node finds global routing scheduling service by service discovery, and keeps growing connection；
3) via node timing reports the letter such as the RTT counted on, packet loss and itself upstream and downstream bandwidth utilization rate, load
Breath；
If 4) it is unreachable to detect adjacent node for via node, can immediate feedback give routing scheduling center, so as to quick extensive
It is multiple；
5) routing scheduling central collection weighs every terms of information weighted calculation hop according to formula to after every terms of information
Value, and generate the optimal path and alternative path of node-to-node；
6) routing scheduling center, which regularly or when node reports instant abnormal is triggered, issues current optimal path to each
Beginning node；
7) optimal path and alternative path that the starting point of data transfer issues according to routing scheduling center are initiated, creates one
Logical links, midway through the path that is passed over according to starting point of via node perform forwarding, until reaching home；
8) global routing scheduling center when issuing instant optimal path every time, contrast current optimal path and be used
Path, the toggle path if the percent value of setting is differed by more than；
9) when starting point realizes that transmission path occurs abnormal, one is selected according to current routing information (optimal and alternative path)
The path replacement current path that bar is more suitable for.
Therefore, the present embodiment has following beneficial effect：
1st, network central control logical sum mathematical logic is separated, data is collected by network node, determined by routing center control
Plan；
2nd, the routing algorithm of routing center can do decision-making from global angle, and Adjustment effect is more accurate, can control great efforts；
3rd, the routing algorithm of routing center can update upgrading at any time, and network node need not be changed.
In summary, technical scheme provided in an embodiment of the present invention, by start node timing or on demand from routing scheduling
Center obtains the routing information of data transfer, and start node is the starting point of data transfer, and routing information includes optimal path information
With alternative path information, start node creates the logical links of data transfer, and will transmit data according to the routing information of acquisition
Data block is packaged into routing iinformation, is sent to next node, next node is via node or destination node；Via node
The data block that adjacent node is sent is received, the logical link information included according to data block header, data block is delivered to next
Individual node；Further, since the optimal path of node-to-node and alternative path are sent to each by the timing of routing scheduling center
Beginning node, or when receiving the instant unexpected message of node transmission, current optimal path is sent to node, therefore, the present invention
The data transmission method based on real-time active path planning and system that embodiment provides can evaluate network from the angle of the overall situation
Congestion condition, the accuracy and promptness of routing iinformation are improved, and then improve data transmission efficiency.
Fig. 4 is the structural representation of the data transmission system provided in an embodiment of the present invention based on real-time active path planning
Figure.As shown in figure 4, the data transmission system provided in an embodiment of the present invention based on real-time active path planning includes：Starting section
Point, via node and routing scheduling center.
Specifically, the routing information that start node is used for timing or obtains data transfer from routing scheduling center on demand is played,
Start node is the starting point of data transfer, and routing information includes optimal path information and alternative path information；Start node is also used
In the routing information according to acquisition, the logical links of data transfer is created；Start node is additionally operable to believe transmission data and route
Breath is packaged into data block, according to routing iinformation, is sent to next node, and next node is via node or destination node, in
It is the transit node with routing function in data transfer path after node, destination node is the terminal of data transfer.
When data transfer path occurs abnormal, start node is additionally operable to immediately abnormal by being sent to routing scheduling center
Message, current optimal path information is obtained from routing scheduling center, and the information returned according to routing scheduling center is made to judge, selects
Select out the logical links of current optimal path dynamic adjusting data transmission.
Via node is used for the data block for receiving adjacent node transmission, and via node is to have road in data transfer path
By the transit node of function；Via node is additionally operable to the logical link information included according to data block header, and data block is delivered
To next node.
Via node is additionally operable to the link information between collector node, and reports routing scheduling center, and link information includes
Round-trip delay RTT, the packet loss of adjacent internode, and the upstream and downstream bandwidth utilization rate of via node itself and load.
Routing scheduling center is used to pass through the link information between via node collector node；Routing scheduling center is additionally operable to root
According to the link information between the node of collection, the routine weight value between weighted calculation node, and generate the optimal path of node-to-node
And alternative path；Routing scheduling center is additionally operable to timing and the optimal path of node-to-node and alternative path is sent into each
Beginning node, or when receiving the instant unexpected message of node transmission, current optimal path is sent to node.
The data transmission system based on real-time active path planning of the embodiment of the present invention can be used for performing Fig. 3 A, figure
The method of embodiment of the method shown in 3B, Fig. 3 C, possesses corresponding functional module, its realization principle and the technique effect to be reached
It is similar, it will not be repeated here.
Finally it should be noted that：The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
The present invention is described in detail with reference to the foregoing embodiments, it will be understood by those within the art that：It still may be used
To be modified to the technical scheme described in foregoing embodiments, or equivalent substitution is carried out to which part technical characteristic；
And these modifications or replacement, the essence of appropriate technical solution is departed from the scope of various embodiments of the present invention technical scheme.
Claims (10)
- A kind of 1. data transmission method based on real-time active path planning, it is characterised in that including：Start node timing or the routing information for obtaining data transfer from routing scheduling center on demand, the start node is data The starting point of transmission, the routing information include optimal path information and alternative path information；Start node creates the logical links of data transfer according to the routing information of acquisition；Start node will transmit data and routing iinformation is packaged into data block, according to routing iinformation, be sent to next node, described Next node is via node or destination node, and the via node is having in routing function in data transfer path Trochanterion, the destination node are the terminal of data transfer.
- 2. according to the method for claim 1, it is characterised in that when data transfer path occurs abnormal, start node leads to Cross to routing scheduling center and send instant unexpected message, obtain current routing information from routing scheduling center, and adjust according to route The information work that degree center returns judges, selects the logical links of current optimal path dynamic adjusting data transmission.
- A kind of 3. data transmission method based on real-time active path planning, it is characterised in that including：Via node receives the data block that adjacent node is sent, and the via node is to have route work(in data transfer path The transit node of energy；The routing iinformation that via node includes according to data block header, data block is delivered to next node.
- 4. according to the method for claim 3, it is characterised in that also include：Link information between via node collector node, and routing scheduling center is reported, the link information includes adjacent segments Between round-trip delay RTT, packet loss, and the upstream and downstream bandwidth utilization rate of via node itself and load.
- A kind of 5. data transmission method based on real-time active path planning, it is characterised in that including：Routing scheduling is centrally through the link information between via node collector node；Routing scheduling center is according to the link information between the node of collection, the routine weight value between weighted calculation node, and generates section Optimal path and alternative path of the point to node；The optimal path of node-to-node and alternative path are sent to each start node, Huo Zhe by the timing of routing scheduling center When receiving the instant unexpected message of node transmission, current optimal path is sent to node.
- 6. a kind of data transmission system based on real-time active path planning, including：Start node, via node and routing scheduling Center, it is characterised in that the start node is used for timing or obtains the path letter of data transfer from routing scheduling center on demand Breath, the start node are the starting point of data transfer, and the routing information includes optimal path information and alternative path information；The start node is additionally operable to the routing information according to acquisition, creates the logical links of data transfer；The start node is additionally operable to transmission data and routing iinformation being packaged into data block, according to routing iinformation, is sent to down One node, the next node are via node or destination node, and the via node is having in data transfer path The transit node of routing function, the destination node are the terminal of data transfer.
- 7. system according to claim 6, it is characterised in that when data transfer path occurs abnormal, the starting section Point is additionally operable to by sending instant unexpected message to routing scheduling center, and current optimal path letter is obtained from routing scheduling center Breath, and the information returned according to routing scheduling center is made to judge, selects patrolling for current optimal path dynamic adjusting data transmission Collect link.
- 8. system according to claim 6, it is characterised in that the via node is used for the number for receiving adjacent node transmission According to block, the via node is the transit node with routing function in data transfer path；The via node is additionally operable to the logical link information included according to data block header, and data block is delivered into next section Point.
- 9. system according to claim 6, it is characterised in that the via node is additionally operable to the link letter between collector node Breath, and routing scheduling center is reported, the link information includes round-trip delay RTT, the packet loss of adjacent internode, and relaying The upstream and downstream bandwidth utilization rate of node itself and load.
- 10. according to the system described in claim any one of 6-9, it is characterised in that the routing scheduling center is used in passing through Link information between node collector node；The routing scheduling center is additionally operable to the link information between the node according to collection, the path power between weighted calculation node Value, and generate the optimal path and alternative path of node-to-node；The routing scheduling center is additionally operable to timing and the optimal path of node-to-node and alternative path is sent into each starting Node, or when receiving the instant unexpected message of node transmission, current optimal path is sent to node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710885042.1A CN107682264B (en) | 2017-09-26 | 2017-09-26 | Data transmission method and system based on real-time active path planning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710885042.1A CN107682264B (en) | 2017-09-26 | 2017-09-26 | Data transmission method and system based on real-time active path planning |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107682264A true CN107682264A (en) | 2018-02-09 |
| CN107682264B CN107682264B (en) | 2018-11-16 |
Family
ID=61136293
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710885042.1A Active CN107682264B (en) | 2017-09-26 | 2017-09-26 | Data transmission method and system based on real-time active path planning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107682264B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112134763A (en) * | 2020-09-25 | 2020-12-25 | 北京浪潮数据技术有限公司 | Method, system, equipment and medium for transmitting layered messages among cluster nodes |
| CN115022230A (en) * | 2022-05-31 | 2022-09-06 | 中国人民解放军国防科技大学 | Communication path planning method and device |
| CN115514651A (en) * | 2022-09-16 | 2022-12-23 | 山东省计算中心（国家超级计算济南中心） | Cloud-edge data transmission path planning method and system based on software-defined stacked network |
| WO2024098814A1 (en) * | 2022-11-08 | 2024-05-16 | 中兴通讯股份有限公司 | Data transmission processing method and apparatus, and storage medium and electronic apparatus |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068227A (en) * | 2007-06-01 | 2007-11-07 | 广东中大讯通软件科技有限公司 | System for protecting QoS system based on family gateway and reservation band width technique and method thereof |
| US20090022056A1 (en) * | 2007-07-18 | 2009-01-22 | Bobby Ninan | Tuning routing metrics to reduce maximum link utilization and/or provide failure resiliency |
| CN103139075A (en) * | 2013-03-13 | 2013-06-05 | 杭州华三通信技术有限公司 | Message transmission method and device |
| WO2014194523A1 (en) * | 2013-06-08 | 2014-12-11 | 华为技术有限公司 | Route forwarding method, apparatus and system |
| CN104506435A (en) * | 2014-12-12 | 2015-04-08 | 杭州华为数字技术有限公司 | SDN (Software Defined Network) controller and method for determining shortest path in SDN |
| CN104683244A (en) * | 2015-03-09 | 2015-06-03 | 东北大学 | Multicast routing method based on route node driving strategy |
| CN105722150A (en) * | 2016-02-02 | 2016-06-29 | 浪潮软件集团有限公司 | Wireless network |
| CN105721307A (en) * | 2016-02-19 | 2016-06-29 | 华为技术有限公司 | Multipath message forwarding method and device |
| CN105743614A (en) * | 2016-04-01 | 2016-07-06 | 网宿科技股份有限公司 | Data transmission method and device |
-
2017
- 2017-09-26 CN CN201710885042.1A patent/CN107682264B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068227A (en) * | 2007-06-01 | 2007-11-07 | 广东中大讯通软件科技有限公司 | System for protecting QoS system based on family gateway and reservation band width technique and method thereof |
| US20090022056A1 (en) * | 2007-07-18 | 2009-01-22 | Bobby Ninan | Tuning routing metrics to reduce maximum link utilization and/or provide failure resiliency |
| CN103139075A (en) * | 2013-03-13 | 2013-06-05 | 杭州华三通信技术有限公司 | Message transmission method and device |
| WO2014194523A1 (en) * | 2013-06-08 | 2014-12-11 | 华为技术有限公司 | Route forwarding method, apparatus and system |
| CN104506435A (en) * | 2014-12-12 | 2015-04-08 | 杭州华为数字技术有限公司 | SDN (Software Defined Network) controller and method for determining shortest path in SDN |
| CN104683244A (en) * | 2015-03-09 | 2015-06-03 | 东北大学 | Multicast routing method based on route node driving strategy |
| CN105722150A (en) * | 2016-02-02 | 2016-06-29 | 浪潮软件集团有限公司 | Wireless network |
| CN105721307A (en) * | 2016-02-19 | 2016-06-29 | 华为技术有限公司 | Multipath message forwarding method and device |
| CN105743614A (en) * | 2016-04-01 | 2016-07-06 | 网宿科技股份有限公司 | Data transmission method and device |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112134763A (en) * | 2020-09-25 | 2020-12-25 | 北京浪潮数据技术有限公司 | Method, system, equipment and medium for transmitting layered messages among cluster nodes |
| CN115022230A (en) * | 2022-05-31 | 2022-09-06 | 中国人民解放军国防科技大学 | Communication path planning method and device |
| CN115022230B (en) * | 2022-05-31 | 2023-11-24 | 中国人民解放军国防科技大学 | Communication path planning method and device |
| CN115514651A (en) * | 2022-09-16 | 2022-12-23 | 山东省计算中心（国家超级计算济南中心） | Cloud-edge data transmission path planning method and system based on software-defined stacked network |
| CN115514651B (en) * | 2022-09-16 | 2023-08-15 | 山东省计算中心（国家超级计算济南中心） | Cloud edge data transmission path planning method and system based on software-defined stacked network |
| WO2024098814A1 (en) * | 2022-11-08 | 2024-05-16 | 中兴通讯股份有限公司 | Data transmission processing method and apparatus, and storage medium and electronic apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107682264B (en) | 2018-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108600102B (en) | Flexible data transmission system based on intelligent cooperative network | |
| CN108512760B (en) | Routing method based on SDN guarantee service QoS | |
| CN105471764B (en) | A kind of method of end-to-end QoS guarantee in SDN network | |
| CN107682264B (en) | Data transmission method and system based on real-time active path planning | |
| US20110133924A1 (en) | Alarm reordering to handle alarm storms in large networks | |
| CN107959633A (en) | A kind of load balance method based on price mechanism in industry real-time network | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| CN101605278B (en) | Method for realizing adaptive signaling in distributed control collaborative optical networks | |
| CN106209669A (en) | Towards SDN data center network maximum of probability path stream scheduling method and device | |
| JPH1065733A (en) | High-speed routing control system | |
| WO2000024164A1 (en) | Method and apparatus for network control | |
| CN102158812B (en) | Wireless Mesh network multicasting communication method of AC-AP (Access Controller-Access Point) framework | |
| Fotohi et al. | A Hybrid routing method for mobile ad-hoc networks | |
| CN103618677A (en) | Network flow regulation method and system | |
| CN103716208A (en) | Network management method and system supporting elephant flow, interchanger and network | |
| CN111130928B (en) | Network measurement method based on in-band detection in wide area network | |
| CN104283781B (en) | A kind of path calculation method and device | |
| CN105071947A (en) | Link optimization method for SDN network | |
| CN107800624A (en) | A kind of optimal circuitous path selection new method of regional protection key message | |
| Khalifa et al. | Transport protocol for smart grid infrastructure | |
| CN107888490A (en) | A kind of message forwarding method, routing delays calculate and dispatching device and system | |
| CN110380973A (en) | Software defined network topological detecting method | |
| CN102427596B (en) | Routing method and scheduling method of node mobile network assisted by positioning information | |
| CN110519822A (en) | A kind of chance routing candidate relay selection algorithm of low energy consumption | |
| CN102595487B (en) | Device and method used for controlling sensor network gateway congestion and based on multiple communication modules |
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 |